Efficient ID-Based Optimistic Fair Exchange with Provable Security
The notion of identity based cryptosystem was introduced by Shamir in 1984, and has attracted much interest since it eliminates the need of certificates and simplify the key management. In this paper, we propose an optimistic fair exchange protocol for identity-based signatures. A semi-trust third party (ttp) is still involved in our protocol to ensure fairness. However, there is no need for registrations between users and ttp, and no zero-knowledge proof is needed to provide verifiability. The proposed optimistic fair exchange protocol is much concise and efficient, and can be shown to be secure in the random model with a tight security reduction.
KeywordsFair exchange Identity-based Signature Provable Security
Unable to display preview. Download preview PDF.
- 2.Ateniese, G.: Efficient verifiable encryption (and fair exchange) of digital signatures. In: Sixth ACM Conference on Computer and Communication Security, pp. 138–146. ACM, New York (1999); Verifiable encryption of digital signatures and applications. ACM Transactions on Information and System Security 7(1), pp. 1–20 (2004)CrossRefGoogle Scholar
- 5.Bao, F., Deng, R.H., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: IEEE Symposium on Security and Privacy, pp. 77–85 (1998)Google Scholar
- 6.Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the First Annual Conference on Computer and Commmunications Security. ACM, New York (1993)Google Scholar
- 14.Dodis, Y., Reyzin, L.: Breaking and Repairing Optimistic Fair Exchange from PODC 2003. In: ACM Workshop on Digital Rights Management, pp. 47–54 (2003)Google Scholar
- 15.Libert, B., Quisquater, J.-J.: The Exact Security of an Identity Based Signature and its Applications, IACR Cryptology ePrint Archive, Report 2004/102 (2004)Google Scholar
- 16.Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: 2003 ACM Symposium on Principles of Distributed Computing, pp. 12–19 (2003)Google Scholar
- 17.Park, J.M., Chong, E., Siegel, H., Ray, I.: Constructing fair exchange protocols for E-commerce via distributed computation of RSA signatures. In: 22th ACM Symp. on Principles of Distributed Computing, pp. 172–181 (2003)Google Scholar
- 18.RSA Labs: RSA Cryptography Standard: EMSAPSS-PKCS\(\sharp\)1 v2.1 (2002)Google Scholar
- 20.Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Sympoium on Cryptography and Information Security, Okinawa, Japan (2000)Google Scholar
- 21.Zhang, Z.F., Zhou, Y.B., Feng, D.G.: Efficient and Optimistic Fair Exchange based on Standard RSA with Provable Security, IACR Cryptology ePrint Archive, Report 2004/351 (2004)Google Scholar