111 search results - page 12 / 23 » New Public Key Cryptosystems Based on the Dependent-RSA Prob... |
127
click to vote
EUROCRYPT
2012
Springer
13 years 2 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
87
Voted
PKC
2000
Springer
15 years 3 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
106
Voted
LATINCRYPT
2010
14 years 10 months ago
2010
Abstract. In this paper, we present an efficient cryptanalysis of the socalled HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, ...
75
Voted
CCGRID
2005
IEEE
15 years 5 months ago
2005
IEEE
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
178
click to vote
CTRSA
2011
Springer
14 years 3 months ago
2011
Springer
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...