Abstract
As many electronic items are exchanged over the Internet recently, the fair exchange problem becomes of a greater importance. When constructing fair exchange systems, verifiably encrypted signatures are usually used as a building block. Hence, we propose an efficient ID-based verifiably encrypted signature scheme based on Hess’s signature scheme because it is known as a concise and secure signature scheme in ID-PKC. Our scheme does not need registrations between users and a trusted third party called an adjudicator, does not need zero-knowledge proof, and uses an optimized adjudicator who participates in the protocol only when problem occurs. Together with a formal model, we analyze security and efficiency of our scheme and show that it is more suitable for communication requirements than previous schemes of same kind.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 593–610. Springer, Heidelberg (1998)
Bao, F., et al.: Analysis and Improvement of Micali. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 176–187. Springer, Heidelberg (2004)
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)
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)
Boneh, D., Lynn, A., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Boneh, D., et al.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003)
Dodis, Y., Reyzin, L.: Breaking and Repairing Optimistic Fair Exchange from PODC 2003. In: ACM Workshop on Digital Rights Management, pp. 47–54 (2003)
Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party. In: 4th ACM Conference on Computer and Communications Security, pp. 1–5 (1997)
Gu, C., Zhu, Y.: An ID-Based Verifiable Encrypted Signature Scheme Based on Hess. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 42–52. Springer, Heidelberg (2005)
Hess, F.: Efficient Identity based Signature Schemes based on Pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)
Joux, A., Nguyen, K.: Separating Decision Diffie-Hellman from Diffie-Hellman in Cryptographic Groups. Cryptology ePrint Archive, Report 2001/003 (2001), http://eprint.icar.org/
Lu, S., et al.: Sequential Aggregate Signatures and Multisignatures Without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 465–485. Springer, Heidelberg (2006)
Micali, S.: Certified e-mail with invisible post offices. Presented at the 1997 RSA Security Conference (1997)
Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: 22th ACM Symposium on Principles of Distributed Computing, pp. 12–19 (2003)
Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 104–118. Springer, Heidelberg (2001)
Park, J.M., et al.: Constructing fair exchange protocols for E-commerce via distributed computation of RSA signatures. In: 22th ACM Symposium on Principles of Distributed Computing, pp. 172–181 (2003)
Saeednia, S., Markowitch, O., Roggeman, Y.: Identity-based optimistic fair exchange with transparent signature recovery. In: 9th International Conference on Distributed Multimedia Systems (DMS 2003), pp. 718–721 (2003)
Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security, Okinawa, Japan (2000)
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)
Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)
Zhang, F., Safavi-Naini, R., Susilo, W.: Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 191–204. Springer, Heidelberg (2003)
Zhang, F., Safavi-Naini, R., Susulo, W.: An efficient signature scheme from bilinear pairing and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)
Zhang, J., Zou, W.: A Robust Verifiably Encrypted Signature Scheme. In: Zhou, X., et al. (eds.) EUC Workshops 2006. LNCS, vol. 4097, pp. 731–740. Springer, Heidelberg (2006)
Zhang, Z., et al.: Efficient ID-Based Optimistic Fair Exchange with Provable Security. In: Qing, S., et al. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 14–26. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kwon, S., Lee, SH. (2007). An Efficient ID-Based Verifiably Encrypted Signature Scheme Based on Hess’s Scheme. In: Dawson, E., Wong, D.S. (eds) Information Security Practice and Experience. ISPEC 2007. Lecture Notes in Computer Science, vol 4464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72163-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-72163-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72159-8
Online ISBN: 978-3-540-72163-5
eBook Packages: Computer ScienceComputer Science (R0)