Cryptology ePrint Archive: Report 2007/289

Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol

Michael Backes and Matteo Maffei and Dominique Unruh

Abstract: We devise an abstraction of zero-knowledge protocols that is accessible to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theory that abstractly characterizes the cryptographic semantics of zero-knowledge proofs. We present an encoding from the equational theory into a convergent rewriting system that is suitable for the automated protocol verifier ProVerif. The encoding is sound and fully automated. We successfully used ProVerif to obtain the first mechanized analysis of the Direct Anonymous Attestation (DAA) protocol. The analysis in particular required us to devise novel abstractions of sophisticated cryptographic security definitions based on interactive games.

Category / Keywords: foundations / zero-knowledge, abstraction, mechanized analysis, direct anonymous attestation, DAA

Date: received 27 Jul 2007

Contact author: backes at cs uni-sb de

Available format(s): PDF | BibTeX Citation

Version: 20070807:153347 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]