Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: 21st IEEE Computer Security Foundations Symposium (CSF'08)
Guest editors: Andrei SabelfeldGuest Editor
Article type: Research Article
Authors: Backes, Michaela; b | Unruh, Dominiquea; **
Affiliations: [a] Saarland University, Saarbrücken, Germany | [b] Max Planck Institute for Software Systems, Saarbrücken, Germany
Correspondence: [**] Corresponding author: Dominique Unruh, Saarland University, Campus E1 1, 66041 Saarbrücken, Germany. Tel.: +49 681 302 57375; Fax: +49 681 302 57365; E-mail: unruh@mmci.uni-saarland.de.
Note: [*] A preliminary version of this paper appeared at CSF 2008 [18].
Abstract: The abstraction of cryptographic operations by term algebras, called Dolev–Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significant progress was made in proving that Dolev–Yao models offering the core cryptographic operations such as encryption and digital signatures can be sound with respect to actual cryptographic realizations and security definitions. Recent work, however, has started to extend Dolev–Yao models to more sophisticated operations with unique security features. Zero-knowledge proofs arguably constitute the most amazing such extension. In this paper, we first identify which additional properties a cryptographic (non-interactive) zero-knowledge proof needs to fulfill in order to serve as a computationally sound implementation of symbolic (Dolev–Yao style) zero-knowledge proofs; this leads to the novel definition of a symbolically-sound zero-knowledge proof system. We prove that even in the presence of arbitrary active adversaries, such proof systems constitute computationally sound implementations of symbolic zero-knowledge proofs. This yields the first computational soundness result for symbolic zero-knowledge proofs and the first such result against fully active adversaries of Dolev–Yao models that go beyond the core cryptographic operations.
Keywords: Computational soundness, zero-knowledge, symbolic cryptography
DOI: 10.3233/JCS-2009-0392
Journal: Journal of Computer Security, vol. 18, no. 6, pp. 1077-1155, 2010
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl