How to protect privacy in optimistic fair exchange of digital signatures
From MaRDI portal
Publication:1750341
DOI10.1016/J.INS.2015.07.032zbMath1391.94762OpenAlexW859101512MaRDI QIDQ1750341
Duncan S. Wong, Qiong Huang, Willy Susilo
Publication date: 18 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.032
Cites Work
- Unnamed Item
- Unnamed Item
- Group-oriented fair exchange of signatures
- Attribute-based optimistic fair exchange: how to restrict brokers with policies
- The construction of ambiguous optimistic fair exchange from designated confirmer signature without random oracles
- Designated Verifier Proofs and Their Applications
- Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
- A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange
- Ambiguous Optimistic Fair Exchange
- Generic Transformation to Strongly Unforgeable Signatures
- Optimistic fair exchange of digital signatures
- Usable Optimistic Fair Exchange
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Information Security and Privacy
- P2OFE: Privacy-Preserving Optimistic Fair Exchange of Digital 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
- Financial Cryptography and Data Security
- Optimistic Fair Exchange in a Multi-user Setting
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Theory of Cryptography
This page was built for publication: How to protect privacy in optimistic fair exchange of digital signatures