A generic framework for accountable optimistic fair exchange protocol
Summary: Optimistic Fair Exchange protocol was designed for two parties to exchange in a fair way where an arbitrator always remains offline and will be referred only if any dispute happens. There are various optimistic fair exchange protocols with different security properties in the literature. Most of the optimistic fair exchange protocols satisfy resolution ambiguity where a signature signed by the signer is computational indistinguishable from the one resolved by the arbitrator. Huang et al. proposed the first generic framework for accountable optimistic fair exchange protocol in the random oracle model where it possesses resolution ambiguity and is able to reveal the actual signer when needed. Ganjavi et al. later proposed the first generic framework in the standard model. In this paper, we propose a new generic framework for accountable optimistic fair exchange protocol in the standard model using ordinary signature, convertible undeniable signature, and ring signature scheme as the underlying building blocks. We also provide an instantiation using our proposed generic framework to obtain an efficient pairing-based accountable optimistic fair exchange protocol with short signature.
- A Generic Framework for Accountable Optimistic Fair Exchange Protocol
- Ambiguous Optimistic Fair Exchange
- Ambiguous optimistic fair exchange: definition and constructions
- Optimistic fair exchange in the enhanced chosen-key model
- An optimistic fair exchange protocol and its security in the universal composability framework
- A certified e-mail system with receiver's selective usage of delivery authority
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Generic Framework for Accountable Optimistic Fair Exchange Protocol
- Ambiguous Optimistic Fair Exchange
- An efficient ring signature scheme from pairings
- Analysis and improvement of Micali's fair contract signing protocol
- Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
- Convertible Undeniable Signatures
- Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
- How to leak a secret
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Identity-based encryption from the Weil pairing
- Invisibility and anonymity of undeniable and confirmer signatures
- Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
- Optimistic Fair Exchange in a Multi-user Setting
- P^2OFE: privacy-preserving optimistic fair exchange of digital signatures
- Proofs of partial knowledge and simplified design of witness hiding protocols
- Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
- Ring signatures: Stronger definitions, and constructions without random oracles
- Short signatures from the Weil pairing
- Stateless-recipient certified e-mail system based on verifiable encryption
- Sub-linear size traceable ring signatures without random oracles
- Theory of Cryptography
- Traceable Ring Signature
- Undeniable Signatures
- Attribute-based optimistic fair exchange: how to restrict brokers with policies
- Ambiguous Optimistic Fair Exchange
- Exploring fair exchange protocols using specification animation
- Some remarks on a fair exchange protocol
- A Generic Framework for Accountable Optimistic Fair Exchange Protocol
- Fair exchange protocol of Schnorr signatures with semi-trusted adjudicator
- A formal model of fair exchange protocols
This page was built for publication: A generic framework for accountable optimistic fair exchange protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311072)
