18 search results - page 2 / 4 » Resettable Zero Knowledge in the Bare Public-Key Model under... |
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...
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 [...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
CCS
2006
ACM
13 years 8 months ago
2006
ACM
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...