5476 search results - page 1 / 1096 » Resettably Secure Computation |
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
CTRSA
2010
Springer
13 years 11 months ago
2010
Springer
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
ESORICS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Different security notions and settings for identification protocols have been proposed so far, considering different powerful adversaries that can play "man-in-the-...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...