Advertisement

Efficient ID-Based Optimistic Fair Exchange with Provable Security

  • Zhenfeng Zhang
  • Dengguo Feng
  • Jing Xu
  • Yongbin Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3783)

Abstract

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.

Keywords

Fair exchange Identity-based Signature Provable Security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998); IEEE J. on Selected Areas in Communication 18(4), 593–610 2000.CrossRefGoogle Scholar
  2. 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
  3. 3.
    Bao, F.: Colluding Attacks to a Payment Protocol and Two Signature Exchange Schemes. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 417–429. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Bao, F., Wang, G.L., Zhou, J.Y., Zhu, H.F.: Analysis and Improvement of Micali’s Fair Contract Signing Protocol. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 176–187. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 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. 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
  7. 7.
    Bellare, M., Namprempre, C., Neven, G.: Security Proofs for Identity-Based Identification and Signature Schemes. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 268–286. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Camenisch, J., Damgard, I.B.: Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 331–345. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  12. 12.
    Cha, J.C., Cheon, J.H.: An Identity-Based Signature from Gap Diffie-Hellman Groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Coron, J.S.: On the exact security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229–235. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  14. 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. 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. 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. 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. 18.
    RSA Labs: RSA Cryptography Standard: EMSAPSS-PKCS\(\sharp\)1 v2.1 (2002)Google Scholar
  19. 19.
    Shamir, A.: Identity based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  20. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Zhenfeng Zhang
    • 1
    • 2
  • Dengguo Feng
    • 1
    • 2
  • Jing Xu
    • 1
    • 3
  • Yongbin Zhou
    • 1
    • 2
  1. 1.State Key Laboratory of Information Security 
  2. 2.Institute of SoftwareChinese Academy of SciencesBeijingP.R. China
  3. 3.Graduate School of Chinese Academy of SciencesBeijingP.R. China

Personalised recommendations