Sciweavers

1562 search results - page 28 / 313
» Mathematics, Cryptology, Security
Sort
View
EUROCRYPT
2004
Springer
13 years 11 months ago
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
An extended abstract of this paper appears in C. Cachin and J. Camenisch, editors, Advances in Cryptology-EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 22...
Dan Boneh, Xavier Boyen
CRYPTO
1992
Springer
181views Cryptology» more  CRYPTO 1992»
14 years 2 days ago
Fair Public-Key Cryptosystems
Abstract Joseph Kilian NEC Research Princeton, NJ 08540 Tom Leighton Mathematics Department Laboratory for Computer Science MIT Cambridge, MA 02139 August 17, 1994 Fair" Publ...
Silvio Micali
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
13 years 11 months ago
Fast Generation of Prime Numbers on Portable Devices: An Update
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
Marc Joye, Pascal Paillier
EUROCRYPT
2006
Springer
13 years 11 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...
CTRSA
2006
Springer
176views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
Dan Boneh, Xavier Boyen, Shai Halevi