54 search results - page 8 / 11 » On the Concurrent Composition of Zero-Knowledge Proofs |
ESORICS
2004
Springer
14 years 26 days ago
2004
Springer
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
CSFW
2005
IEEE
14 years 1 months ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
IS
2006
13 years 7 months ago
2006
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
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...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...