1064 search results - page 174 / 213 » Cryptography from Anonymity |
141
click to vote
CHES
2006
Springer
15 years 5 months ago
2006
Springer
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...
126
Voted
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
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 ...
110
click to vote
EUROCRYPT
2006
Springer
15 years 5 months ago
2006
Springer
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...
ACSAC
2001
IEEE
15 years 5 months ago
2001
IEEE
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...
NSDI
2008
15 years 4 months ago
2008
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 ...