Sciweavers

1064 search results - page 174 / 213
» Cryptography from Anonymity
Sort
View
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
14 years 29 days 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
FOCS
2004
IEEE
14 years 29 days ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
EUROCRYPT
2006
Springer
14 years 27 days ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
ACSAC
2001
IEEE
14 years 26 days ago
Privacy-Preserving Cooperative Statistical Analysis
The growth of the Internet opens up tremendous opportunities for cooperative computation, where the answer depends on the private inputs of separate entities. Sometimes these comp...
Wenliang Du, Mikhail J. Atallah
NSDI
2008
13 years 11 months ago
Passport: Secure and Adoptable Source Authentication
We present the design and evaluation of Passport, a system that allows source addresses to be validated within the network. Passport uses efficient, symmetric-key cryptography to ...
Xin Liu, Ang Li, Xiaowei Yang, David Wetherall