Abstract
An identity-based verifiably committed signature scheme (IB-VCS) was proposed, which is proved secure in the standard model (i.e., without random oracles). It enjoys the setup-free property and stand-alone property, both of which make an exchange protocol more practical. The scheme is unconditionally secure against the cheating signer, its security against the cheating verifier is reduced to the computational Diffie-Hellman (CDH) problem in the underlying group, it is secure against the cheating trusted third party if the underlying Paterson Schuldt’s identity based signature (IBS) scheme is secure, which is proven true based on the CDH assumption in the standard model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ray I, Ray I. Fair exchange in E-commerce [J]. ACM SIGEcomm Exchange, 2002, 3(2): 9–17.
Goldreich O. A simple protocol for signing contracts[ C]//CRYPTO’83. [s.l.]: Plenum Press, 1984: 133–136.
Zhou J Y, Gollmann D. A fair non-repudiation protocol [C]//Proceedings of the IEEE Symposium on Security and Priva. Oakland, CA: IEEE Computer Press, 1996: 55–61.
Dodis Y, Reyzin L. Breaking and repairing optimistic fair exchange from PODC 2003 [C]//Proceedings of the Third ACM Workshop on Digital Rights Management. New York: ACM Press, 2003: 47–54.
Boneh D, Gentry C, Lynn B, et al. Aggregate and verifiably encrypted signatures from bilinear maps [C]//Advances in Cryptology-Proceedings of EUROCRYPT 2003. Berlin: Springer-Verlag, 2003: 416–432.
Park J M, Chong E, Siegel H J, et al. Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures[C]//Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing. Boston: ACM Press, 2003: 172–181.
Bellare M, Rogaway P. Random oracles are practical: a paradigm for designing efficient protocols [C]//Proceedings of the First Annual Conference on Computer and Communications Security. New York: ACM Press, 1993: 62–73.
Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing [J]. Journal of Cryptography, 2004, 17(4): 297–319.
Zhang Z F, Feng D G, Xu J, et al. Efficient ID-based optimistic fair exchange with provable security [C]//Proceedings of ICICS 2005. Berlin: Springer-Verlag, 2005: 14–26.
Zhu H F, Bao F. Stand-alone and setup-free verifiably committed signatures [C]//Proceedings of CTRSA 2006. Berlin: Springer-Verlag, 2006, 159–173.
Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited [C]//Proceedings of the 30th ACM Annual Symposium on Theory of Computing. New York: ACM Press, 1998: 209–218.
Paterson K G, Schuldt J C N. Efficient identitybased signatures secure in the standard model [C]//Proceedings of the 11th Australasian Conference on Information Security and Privacy. Berlin: Springer, 2006: 207–222.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: The National Hi-Tech Research and Development Program (863) of China (No. 2005AA145110); The Pudong New Area Technology Innovation Public Service Platform of China (No. PDP2005-04)
Rights and permissions
About this article
Cite this article
Sun, X., Li, Jh. & Chen, Gl. Identity-based verifiably committed signature scheme without random oracles. J. Shanghai Jiaotong Univ. (Sci. 13, 110–115 (2008). https://doi.org/10.1007/s12204-008-0110-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-008-0110-z