How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Public key signatures in the multi-user setting
Information Processing Letters
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Zero Knowledge Proofs of Knowledge in Two Rounds
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Breaking and repairing optimistic fair exchange from PODC 2003
Proceedings of the 3rd ACM workshop on Digital rights management
Zero-knowledge proofs of knowledge without interaction
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key encryption in a multi-user setting: security proofs and improvements
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Stand-Alone and setup-free verifiably committed signatures
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
Ambiguous Optimistic Fair Exchange
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Security Analysis of Zhu-Bao's Verifiably Committed Signature
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Fair Exchange from Identity-Based Signature
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fair Threshold Decryption with Semi-Trusted Third Parties
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Optimistic fair exchange with multiple arbiters
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Fair threshold decryption with semi-trusted third parties
International Journal of Applied Cryptography
A new construction of designated confirmer signature and its application to optimistic fair exchange
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
One-time trapdoor one-way functions
ISC'10 Proceedings of the 13th international conference on Information security
Group-oriented fair exchange of signatures
Information Sciences: an International Journal
Fair and abuse-free contract signing protocol from Boneh-Boyen signature
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
How to aggregate the CL signature scheme
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Usable optimistic fair exchange
Computer Networks: The International Journal of Computer and Telecommunications Networking
Further observations on optimistic fair exchange protocols in the multi-user setting
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Usable optimistic fair exchange
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Perfect ambiguous optimistic fair exchange
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Information Sciences: an International Journal
Distributing trusted third parties
ACM SIGACT News
Fair private set intersection with a semi-trusted arbiter
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 0.00 |
This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on one-way functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.