Abstract
This paper introduces a novel cryptographic primitive called Signcryption with Delayed Identification (SCDI), where a sender signcrypts a message \(m\) such that the reciever can unsigncrypt it using his private key to recover \(m\), but cannot get any information about the identity of the sender. The sender at a later point of time can claim the ownership of the message \(m\) by providing a “tag”, which proves that the signcryptext was generated by the sender. As an application of the primitive, it is shown that it can be used for safe and anonymous contractual bidding, submission of papers in a journal or conference, etc. As regards security, formal definitions of security for the proposed primitive are given and at the end, a generic construction secure with respect to the proposed definitions is given.
The authors thank Sumit Kumar Pandey of C. R. Rao Institute, India, and Partha Sarathi Roy and Sabyasachi Dutta of University of Calcutta, India for several fruitful discussions during the work.
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
Notes
- 1.
If the content of the paper itself leaks any direct or indirect information about Alice, then nothing can be done, as the editor cannot be made blind to the content of the paper.
- 2.
Here, we assume that Bob is not the adversary. The rationale behind this assumption is that as Bob is unaware of the identity of Alice, why would he try to replace Alice’s original submission.
References
An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Proceedings of the EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer (2002)
Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. J. Cryptol. 20(2), 203–235 (2007)
Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Proceedings of the ASIACRYPT 2001. LNCS, vol. 2248, pp. 566–582. Springer (2001)
Bellare, M., Duan, S.: Partial signatures and their applications, Cryptology ePrint Archive, Report 2009/336. http://eprint.iacr.org/2009/336 (2009)
Bellare, M., Rogaway, P.: Optimal asymmetric encryption—how to encrypt with RSA. In: Proceedings of the EUROCRYPT ’94. LNCS, vol. 950. Springer (1995)
Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st CCS, pp. 62–73. ACM Press, New York (1993)
Coron, J.S., Handschuh, H., Joye, M., Paillier, P., Pointcheval, D., Tymen, C.: GEM: A generic chosen-ciphertext secure encryption method. In: Proceedings of the CT-RSA 2002. LNCS, vol. 2271, pp. 263–276. Springer (2002)
Deva Selvi, S.S., Vivek, S.S., Shiriam, J., Kalaivani, S., Pandu Rangan, C.: Identity based aggregate signcryption schemes. In: Proceedings of the INDOCRYPT 2009. LNCS, vol. 5922, pp. 378–397
Das, A., Adhikari, A.: An efficient IND-CCA2 secure Paillier-based cryptosystem. Inf. Process. Lett. 112, 885–888 (2012) (Elsevier, 2012)
Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Proceedings of the PKC ’99. LNCS, vol. 1560, pp. 53–68. Springer (1999)
Hang, Q., Wong, D.S., Yang, G.: Heterogeneous signcryption with key privacy. Comput. J. 54 (4), 525–536 (2011)
Ma, C., Chen, K., Zheng, D., Liu, S.: Efficient and proactive threshold signcryption,. In: Proceedings of the ISC 2005. LNCS, vol. 3650, pp. 233–243. Springer (2005)
Malone-Lee, J.: Identity-Based Signcryption, Cryptology ePrint Archive, Report 2002/098. http://eprint.iacr.org/2002/098
Okamoto, T., Pointcheval, D.: REACT: Rapid enhanced-security asymmetric cryptosystem transform. In: Proceedings of the CT-RSA 2001. LNCS vol. 2020, pp. 159–174. Springer (2001)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of the EUROCRYPT ’99. LNCS, vol. 1592, pp. 223–238. Springer (1999)
Pointcheval, D.: Chosen-ciphertext security for any one-way cryptosystem. In: Proceedings of the PKC 2000. LNCS, vol. 1751, pp. 29–146. Springer (2000)
Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption) \(\ll \) cost(signature) \(+\) cost(encryption). In: Proceedings of the CRYPTO 97. LNCS, vol. 1294, pp. 165–179. Springer (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Das, A., Adhikari, A. (2014). Signcryption with Delayed Identification. In: Mohapatra, R., Giri, D., Saxena, P., Srivastava, P. (eds) Mathematics and Computing 2013. Springer Proceedings in Mathematics & Statistics, vol 91. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1952-1_3
Download citation
DOI: https://doi.org/10.1007/978-81-322-1952-1_3
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1951-4
Online ISBN: 978-81-322-1952-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)