An optimistic fair exchange protocol and its security in the universal composability framework

Authors:
Yusuke Okada;Yoshifumi Manabe;Tatsuaki Okamoto
Affiliations:
Department of Social Informatics, Graduate School of Informatics, Kyoto University, Kyoto, Japan.;NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation/ Department of Social Informatics,Graduate School of Informatics, Kyoto University, Kyto, Japan.;NTT Information Sharing Platform Laboratories, Nippon Telegraph and Telephone Corporation/ Department of Social Informatics, Graduate School of Informatics, Kyoto University, Kyto, Japan
Venue:
International Journal of Applied Cryptography
Year:
2008

Citing 13
Cited 4

A randomized protocol for signing contracts

Communications of the ACM
How to simultaneously exchange secrets by general assumptions

CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Efficient verifiable encryption (and fair exchange) of digital signatures

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Universally Composable Notions of Key Exchange and Secure Channels

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An Efficient Non-repudiation Protocol

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
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
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A fair non-repudiation protocol

SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Breaking and repairing optimistic fair exchange from PODC 2003

Proceedings of the 3rd ACM workshop on Digital rights management
Universally Composable Signature, Certification, and Authentication

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Optimistic fair exchange of digital signatures

IEEE Journal on Selected Areas in Communications

Timeliness optimistic fair exchange protocol based on key-exposure-free chameleon hashing scheme

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Optimistic fair priced oblivious transfer

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient autonomous signature exchange on ubiquitous networks

Journal of Network and Computer Applications
A Practical Approach of Fairness in E-Procurement

International Journal of Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by prescribing three forms of signatures, namely presignature, post-signature and notarised signature. We set an expiration date for presignature, and thus realise the timely termination of the protocol. Next, we define an ideal functionality of fair exchange protocols in the universal composability framework. Then, we construct an optimistic fair exchange protocol based on the above protocol, and prove its security in the universal composability framework.