Abstract
Verifiably encrypted signature is a extended signature type and plays an important role in the constructing optimistic fair exchange. In the work, we propose a novel verifiably encrypted signature scheme without random oracles, and show that the security of the scheme is based on the difficulty of solving the Chosen-Target-Inverse-CDH with square problem. By comparing our scheme with Boneh et al scheme and S.Lu et al scheme, we show that our proposed scheme has the following advantages: (1) short signature size, only 320 bits; (2)low computation, only 2 pairing operations are needed in the phase of producing and verifying verifiably encrypted signature, respectively. (3)simplification-ability, the creation of verifiably encrypted signature is able to be completed in a logic step.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signature (extended abstract). In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998)
Ateniese, G.: Efficient Verifiable Encryption (and Fair Exchange) of Digital Signatures. In: Proc. of the 6th Conference on CCS, pp. 138–146. ACM Press, New York (1999)
Bao, F., Deng, R.H., Mao, W.: Efficient and Practical fair exchange protocols with off-line TTP. In: IEEE Symposium on Security and Privacy, Oakland, CA (1998)
Camenisch, J.: Victor Shoup, Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126–144. Springer, Heidelberg (2003)
Ateniese, G.: Verifiable Encryption of Digital Signature and Applications. ACM Transactions on Information and System Security 7(1), 1–20 (2004)
Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2), 281–308 (1988)
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st ACM Conference on Computer and Computer and Communications Security, pp. 62–73 (1993)
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)
Boneh, D., Lynn, B., Shacham, H.: Short signture from the Weil pairing. Journal of Cryptology 17(4), 297–319 (2004)
Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)
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)
Lu, S., et al.: Sequential aggregate signtures and multisignatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 465–485. Springer, Heidelberg (2006)
Gu, C.X., Zhu, Y.F.: An ID-based Verifiable Encrypted Signature Scheme Based on Hess’s Scheme. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 42–52. Springer, Heidelberg (2005)
Saxena, A., Gorantla, M.C.: Verifiably Encrypted Signature Scheme Without Random Oracles. In: Chakraborty, G. (ed.) ICDCIT 2005. LNCS, vol. 3816, pp. 357–363. Springer, Heidelberg (2005)
Herranz, J., Laguillaumie, F.: Blind Ring Signatures Secure under the Chosen-Target-CDH Assumption. In: Katsikas, S.K., et al. (eds.) ISC 2006. LNCS, vol. 4176, pp. 117–130. Springer, Heidelberg (2006)
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)
Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology 13(3), 361–396 (2000)
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)
Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-redution. IEICE Trans. Fundamentals E84-A(5), 1234–1243 (2001)
Joux, A.: The Weil and Tate pairings as building blocks for public key cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20–32. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Mao, J. (2007). A Novel Verifiably Encrypted Signature Scheme Without Random Oracle. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72163-5_7
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)