[PDF] Top 20 A Public-key Encryption Scheme Based on Non-linear Indeterminate Equations (Giophantus)

... post-quantum public-key en- cryption scheme whose security depends on a problem arising from a multivariate non-linear indeterminate ...is based on the shortest vector ... See full document

... We mount our attack in subsection 6.2 with n = 80 and d = 10. We employ the default BKZ algorithm with block size 10 as the lattice-basis reduction algorithm and the embedding algorithm to solve the CVP instance. We ... See full document

... code based McEliece schemes are still immune from these ...However, based on the new development of cryptanalysis techniques against linear code based cryptographic systems in the recent ... See full document

... TMSSS scheme, we introduce a threshold decryption algorithm for the LWE-based public key encryption scheme based on Lindner and ...private key matrix as the secrets ... See full document

... threshold public-key encryption scheme are given in Section ...efficient non-interactive threshold public-key encryption scheme based on HDH assumption ... See full document

... the scheme implies that noisy linear encoding with respect to these noise distributions must be one-way, and in particular these distributions should not satisfy certain combinatorial properties that enable ... See full document

... homomorphic encryption (FHE) and is very powerful. Using such a scheme, any circuit can be homomorphically evaluated, effectively allowing the construction of programs which may be run on ciphertexts of ... See full document

... Public Key Cryptography with system of non-homogeneous linear equations is a two-stage secured ...of non-homogeneous linear equations and using this system, we ... See full document

... threshold encryption (HATE). We build the first HATE scheme with constant-size ciphertexts (although the public key length is linear in the number of ...obfuscation- based ... See full document

... index based encrypted string search on big dataset is the inherent problem of big index generation, maintenance and update which stops it from being dynamic in a sense that one could not modify data or add or ... See full document

... searchable encryption can be realized in either symmetric or asymmetric encryption ...Symmetric Encryption (SSE) and later they were many SSE schemes [11], [12] also designed for the enhancement of ... See full document

... DH key exchange and in 1978 with another fundamental work by Rivest, Shamir and Adleman [2], called RSA ...DH key exchange is based on the discrete logarithm problem (DLP) and RSA is based on ... See full document

... We will put all software described in this paper into the public domain. To bitslice, or not to bitslice. A basic fact in both hardware design and computational complexity theory is that every function from b bits ... See full document

... methods based on the access control list are no longer satisfied the secure requirement of cloud ...re-encrypted key and to encrypt the document ...as encryption for the confidentiality protection; ... See full document

... first scheme was introduced by Gordon, Katz and Vaikun- tanathan [26] whose solution produced signature size linear in the number of group users N ...first scheme with the signature size logarithmic ... See full document

... homomorphic encryption scheme, the last few years have witnessed dramatic progress on designing more effi- cient homomorphic encryption schemes, and some of them have been implemented for ... See full document

... Our focus here is on finding one decryption failure. After observing a de- cryption failure, the adversary should switch to a different strategy such as the recently proposed directional failure boosting of D’Anvers, ... See full document

... are based on homomorphic encryption and therefore, their schemes can not achieve security level better than nonadaptive chosen ciphertext at- tacks (CCA1) in the sense of data ...are based on ElGa- ... See full document

... of encryption schemes, Goldre- ich, Goldwasser, and Halevi [GGH97] showed how to partially eliminate errors from lattice-based encryption schemes [AD97, ...any encryption scheme [HR05, ... See full document

... STS scheme contains m quadratic equations in 2m − r variables in the public key and thus have q m−r possible valid signatures to one ...check equations and thus x one unique ... See full document