Sciweavers

133 search results - page 19 / 27
» On the Security of MOR Public Key Cryptosystem
Sort
View
IACR
2011
126views more  IACR 2011»
12 years 7 months ago
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
Dongdai Lin, Jean-Charles Faugère, Ludovic ...
IJACT
2008
158views more  IJACT 2008»
13 years 7 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
CCS
2010
ACM
13 years 4 months ago
Ad hoc broadcast encryption
Numerous applications in ad hoc networks, peer-to-peer networks, and on-the-fly data sharing call for confidential broadcast without relying on a dealer. To cater for such applica...
Qianhong Wu, Bo Qin, Lei Zhang, Josep Domingo-Ferr...
EUROCRYPT
2000
Springer
13 years 11 months ago
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
Victor Shoup
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 7 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai