Optimistic fair exchange of digital signatures
From MaRDI portal
Publication:4249668
DOI10.1007/BFb0054156zbMath0929.68064OpenAlexW2210874835MaRDI QIDQ4249668
N. Asokan, Victor Shoup, Michael Waidner
Publication date: 17 June 1999
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0054156
Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items
Synthesizing Protocols for Digital Contract Signing ⋮ Electronic payment scheme to prevent the treachery ⋮ SoK: communication across distributed ledgers ⋮ Compositional analysis of contract-signing protocols ⋮ On the semantics of Alice \& Bob specifications of security protocols ⋮ Security of blind signatures revisited ⋮ E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation ⋮ Extending concurrent signature to multiple parties ⋮ Quantum multi-party fair exchange protocol based on three-particle GHZ states ⋮ A Generic Framework for Accountable Optimistic Fair Exchange Protocol ⋮ Fair exchange of valuable information: a generalised framework ⋮ Group-oriented fair exchange of signatures ⋮ State and progress in strand spaces: proving fair exchange ⋮ Attribute-based optimistic fair exchange: how to restrict brokers with policies ⋮ Certificate-based verifiably encrypted signatures from pairings ⋮ Resource fairness and composability of cryptographic protocols ⋮ Group Encryption ⋮ Optimistic fair exchange in the enhanced chosen-key model ⋮ Ambiguous optimistic fair exchange: definition and constructions ⋮ Concurrent signature without random oracles ⋮ Deductive verification of alternating systems ⋮ Formal Analysis of FPH Contract Signing Protocol Using Colored Petri Nets ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ How to protect privacy in optimistic fair exchange of digital signatures ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Fair multi-party contract signing using private contract signatures ⋮ On the relationships between models in protocol verification ⋮ Contract signing, optimism, and advantage ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Fair and optimistic contract signing based on quantum cryptography ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ Sequential Aggregate Signatures and Multisignatures Without Random Oracles ⋮ Computer science and decision theory ⋮ Ambiguous Optimistic Fair Exchange ⋮ Efficient Simultaneous Broadcast ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ Oblivious signature-based envelope ⋮ Assume-guarantee synthesis for digital contract signing ⋮ Cryptanalysis of the Wu-Varadhrajan fair exchange protocol ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Concurrent Signatures with Fully Negotiable Binding Control ⋮ Security of Verifiably Encrypted Signatures and a Construction without Random Oracles ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Asymptotics of quantum contract signing ⋮ On Complete Primitives for Fairness ⋮ New efficient and secure protocols for verifiable signature sharing and other applications ⋮ Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin ⋮ Practical quantum contract signing without quantum storage ⋮ Finite-state analysis of two contract signing protocols ⋮ Coin-based multi-party fair exchange
