17 search results - page 3 / 4 » Computational soundness of symbolic zero-knowledge proofs |
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
ESORICS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We deļ¬ne a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
TCC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
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ļ...