Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Plaintext Checkable Signcryption

  • Conference paper
  • First Online:
Information Systems Security (ICISS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9478))

Included in the following conference series:

  • 1603 Accesses

Abstract

Digital signature guarantees the authenticity and encryption ensures the confidentiality of a transmitted message. Signcryption, as the name indicates, is a primitive which serves both these purpose with added efficiency and features. In this paper, we introduce a variant of signcryption called Plaintext Checkable Signcryption (PCSC), which extends signcryption by the following functionality: given a signcryptext c, a plaintext m and the corresponding public values, it is universally possible to check whether c is a signcryption of m. The security requirements of such a primitive is studied and a suitable model of security is proposed. Moreover, we provide efficient generic model construction for PCSC based on “Encrypt-then-Sign” paradigm using an arbitrary partially trapdoor one-way function and a signature scheme. Finally, the construction is shown to be secure in the proposed model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that authentication of the message is important in this scenario to avoid spam messages.

References

  1. An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. J. Cryptology 20(2), 203–235 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st CCS, 62–73. ACM Press, New York (1993)

    Google Scholar 

  4. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Canard, S., Fuchsbauer, G., Gouget, A., Laguillaumie, F.: Plaintext-Checkable Encryption. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 332–348. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Das, A., Adhikari, A.: Signcryption from randomness recoverable PKE revisited. In: Bagchi, A., Ray, I. (eds.) ICISS 2013. LNCS, vol. 8303, pp. 78–90. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Das, A., Adhikari, A.: Signcryption with delayed identification, ICMC 2013. Springer Proc. Math. Stat. 91, 23–40 (2014)

    Article  Google Scholar 

  8. Das, A., Adhikari, A., Sakurai, K.: Plaintext checkable encryption with designated checker. Adv. Math. Commun. 9(1), 37–53 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  9. Selvi, S.S.D., Vivek, S.S., Shriram, J., Kalaivani, S., Rangan, C.P.: Identity based aggregate signcryption schemes. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 378–397. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Fuhr, T., Paillier, P.: Decryptable searchable encryption. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol. 4784, pp. 228–236. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Ibraimi, L., Nikova, S., Hartel, P., Jonker, W.: Public-Key encryption with delegated search. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 532–549. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Hang, Q., Wong, D.S., Yang, G.: Heterogeneous signcryption with key privacy. Comput. J. 54(4), 525–536 (2011)

    Article  Google Scholar 

  13. Ma, C., Chen, K., Zheng, D., Liu, S.: Efficient and proactive threshold signcryption. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 233–243. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Malone-Lee, J.: Identity-Based Signcryption, Cryptology ePrint Archive, Report 2002/098. http://eprint.iacr.org/2002/098

  15. Pointcheval, D.: Chosen-ciphertext security for any one-way cryptosystem. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 129–146. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption) \(<<\) cost(signature) + cost(encryption. In: Kaliski Jr, B.S. (ed.) CRYPTO 1997. Lecture Notes in Computer Science, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Acknowledgement

The authors would like to thank Partha Sarathi Roy and Sabyasachi Dutta of University of Calcutta, India for several fruitful discussions during the work. The research is supported in part by NBHM, DAE, Government of India (No 2/48(10)/2013/NBHM(R.P.)/R&D II/695).

Author information

Authors and Affiliations

  1. Department of Mathematics, St. Xavier’s College, Kolkata, India

    Angsuman Das

  2. Department of Pure Mathematics, University of Calcutta, Kolkata, India

    Avishek Adhikari

Authors
  1. Angsuman Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avishek Adhikari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Avishek Adhikari .

Editor information

Editors and Affiliations

  1. Center for Secure Information Systems, Fairfax, Virginia, USA

    Sushil Jajoda

  2. Jadavpur University, Kolkata, India

    Chandan Mazumdar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Das, A., Adhikari, A. (2015). Plaintext Checkable Signcryption. In: Jajoda, S., Mazumdar, C. (eds) Information Systems Security. ICISS 2015. Lecture Notes in Computer Science(), vol 9478. Springer, Cham. https://doi.org/10.1007/978-3-319-26961-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26961-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26960-3

  • Online ISBN: 978-3-319-26961-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation