Ambiguous Optimistic Fair Exchange
From MaRDI portal
Publication:3600366
DOI10.1007/978-3-540-89255-7_6zbMath1206.94075OpenAlexW1552832232MaRDI QIDQ3600366
Willy Susilo, Duncan S. Wong, Qiong Huang, Guomin Yang
Publication date: 10 February 2009
Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_6
Related Items
Ambiguous One-Move Nominative Signature Without Random Oracles ⋮ Extending concurrent signature to multiple parties ⋮ Group-oriented fair exchange of signatures ⋮ Attribute-based optimistic fair exchange: how to restrict brokers with policies ⋮ Ambiguous optimistic fair exchange: definition and constructions ⋮ Concurrent signature without random oracles ⋮ How to protect privacy in optimistic fair exchange of digital signatures ⋮ Fair signature exchange via delegation on ubiquitous networks ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ Concurrent Signatures with Fully Negotiable Binding Control ⋮ A generic framework for accountable optimistic fair exchange protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Designated Verifier Proofs and Their Applications
- Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
- Optimistic fair exchange of digital signatures
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Information Security and Privacy
- Fully Anonymous Group Signatures Without Random Oracles
- Online-Untransferable Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
- Optimistic Fair Exchange in a Multi-user Setting
- Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
