Cryptology ePrint Archive: Report 1998/001
On Protocol Divertibility
Abstract: In this paper, we establish the notion of divertibility as a
as opposed to the existing notion as a language property (see Okamoto,
Ohta). We give a definition of protocol divertibility that applies to
arbitrary 2-party protocols and is compatible with Okamoto and Ohta's
in the case of interactive zero-knowledge proofs. Other important examples
falling under the new definition are blind signature protocols. A sufficient
criterion for divertibility is presented and found to be satisfied by many
examples of protocols in the literature. The generality of the definition is
further demonstrated by examples from protocol classes that have not been
considered for divertibility before. We show diverted El-Gamal encryption and
diverted Diffie-Hellman key exchange.
Category / Keywords: protocols, interactive proofs, proofs of knowledge, signatures, key exchange
Publication Info: Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Date: received Jan 8th, 1998.
Contact author: bleumer at research att com
Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]