263 search results - page 7 / 53 » A Computationally Sound Mechanized Prover for Security Proto... |
IJWMC
2006
13 years 7 months ago
2006
: Wired Equivalent Privacy (WEP) protocol was adopted to protect authorised users from unauthorised access and eavesdropping in the IEEE 802.11 wireless LANs. It has been proven th...
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ļ...
TCC
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
TCC
2004
Springer
14 years 24 days 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...
IH
2001
Springer
13 years 12 months ago
2001
Springer
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a veriļ¬er of the presence of a watermark in certain stego-data without revealing any infor...