2967 search results - page 516 / 594 » Cryptology |
108
click to vote
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
One day, you suddenly find that a private key corresponding to your Identity is up for sale at e-Bay. Since you do not suspect a key compromise, perhaps it must be the PKG who is...