Practical and provably secure release of a secret and exchange of signatures

DOI10.1007/BF00191356zbMath0840.94014MaRDI QIDQ1903345

Ivan B. Damgård

Publication date: 4 July 1996

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

RSAsignaturesdigital signatureszero-knowledgeRabinEl Gamalexchange of secrets

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Partial fairness in secure two-party computation ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Resource fairness and composability of cryptographic protocols ⋮ Contract signing, optimism, and advantage ⋮ Fair and optimistic contract signing based on quantum cryptography ⋮ On Complete Primitives for Fairness ⋮ Practical quantum contract signing without quantum storage ⋮ Finite-state analysis of two contract signing protocols

Cites Work

• Minimum disclosure proofs of knowledge
• Zero-knowledge proofs of identity
• Fair Exchange of Secrets (extended abstract)
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• The Knowledge Complexity of Interactive Proof Systems
• Coin flipping by telephone a protocol for solving impossible problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item