93 search results - page 18 / 19 » Unifying Zero-Knowledge Proofs of Knowledge |
CTRSA
2011
Springer
12 years 11 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...