Skip to main content
SpringerLink
Log in

Identity-based aggregate signcryption in the standard model from multilinear maps

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by “digital signature followed by public key encryption”. It does this by signing and encrypting a message in a single step. An aggregate signcryption scheme allows individual signcryption ciphertexts intended for the same recipient to be aggregated into a single (shorter) combined ciphertext without losing any of the security guarantees.We present an aggregate signcryption scheme in the identity-based setting using multilinear maps, and provide a proof of security in the standard model. To the best of our knowledge, our new scheme is the first aggregate signcryption scheme that is secure in the standard model.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Zheng Y L. Digital signcryption or how to achieve cost (signature & encryption) << cost(signature) + cost(encryption). In: Proceedings of the 17th Annual International Cryptology Conference. 1997, 165–179

    Google Scholar 

  2. Baek J, Steinfeld R, Zheng Y L. Formal proofs for the security of signcryption. In: Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems. 2002, 80–98

    Google Scholar 

  3. Zheng Y L, Imai H. How to construct efficient signcryption schemes on elliptic curves. Information Processing Letters, 1998, 68(5): 227–233

    Article  MathSciNet  MATH  Google Scholar 

  4. Bao F, Deng R H. A signcryption scheme with signature directly verifiable by public key. In: Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography. 1998, 55–59

    Google Scholar 

  5. Hwang R S, Lai C H, Su F F. An efficient signcryption scheme with forward secrecy based on elliptic curve. Applied Mathematics and Computation, 2005, 167(2): 870–881

    Article  MathSciNet  MATH  Google Scholar 

  6. Shamir A. Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO. 1984, 47–53

    Google Scholar 

  7. Malone-Lee J. Identity-based signcryption. IACR Cryptology ePrint Archive, 2002, 98

    Google Scholar 

  8. Libert B, Quisquater J J. New identity based signcryption schemes from pairings. IACR Cryptology ePrint Archive, 2003, 23

    Google Scholar 

  9. Chow S S M, Yiu S M, Hui L C K, Chow K P. Efficient forward and provably secure id-based signcryption scheme with public verifiability and public ciphertext authenticity. In: Proceedings of the 6th International Conference on Information Security and Cryptology (ICISC 2003). 2003, 352–369

    Google Scholar 

  10. Boyen X. Multipurpose identity-based signcryption. In: Proceedings of the 23rd Annual International Cryptology Conference. 2003, 383–399

    Google Scholar 

  11. Chen L Q, Malone-Lee J. Improved identity-based signcryption. In: Proceedings of the 8th International Workshop on Theory and Practice in Public Key Cryptography. 2005, 362–379

    Google Scholar 

  12. Barreto P S L M, Libert B, McCullagh N, Quisquater J J. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In: Proceedings of the 11th International Conference on the Theory and Application of Cryptology and Information Security. 2005, 515–532

    Google Scholar 

  13. Selvi S S D, Vivek S S, Shriram J, Kalaivani S, Rangan C P. Identity based aggregate signcryption schemes. In: Proceedings of the 10th International Conference on Cryptology in India. 2009, 378–397

    Google Scholar 

  14. Ren X Y, Qi Z H, Geng Y. Provably secure aggregate signcryption scheme. ETRI Journal, 2012, 34(3): 421–428

    Article  Google Scholar 

  15. Qi Z H, Ren X Y, Geng Y. Provably secure general aggregate signcryption scheme in the random oracle modele. China Communications, 2012, 9(11): 107–116

    Google Scholar 

  16. Kar J. Provably secure identity-based aggregate signcryption scheme in random oracles. IACR Cryptology ePrint Archive, 2013, 37

    Google Scholar 

  17. Dent A W. Aggregate signcryption. IACR Cryptology ePrint Archive, 2012, 200

    Google Scholar 

  18. Eslami Z, Pakniat N. Certificateless aggregate signcryption schemes. IACR Cryptology ePrint Archive, 2011, 360

    Google Scholar 

  19. Lu H J, Xie Q. An efficient certificateless aggregate signcryption scheme from pairings. In: Proceedings of 2011 International Conference on Electronics, Communications and Control (ICECC-2011). 2011, 132–135

    Chapter  Google Scholar 

  20. Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited. Journal of the ACM, 2004, 51(4): 557–594

    Article  MathSciNet  MATH  Google Scholar 

  21. Hohenberger S, Sahai A, Waters B. Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures. In: Proceedings of the 33rd Annual Cryptology Conference, Part I. 2013, 494–512

    Google Scholar 

  22. Boneh D, Silverberg A. Applications of multilinear forms to cryptography. Contemporary Mathematics, 2003, 324(1): 71–90

    Article  MathSciNet  MATH  Google Scholar 

  23. Garg S, Gentry C, Halevi S. Candidate multilinear maps from ideal lattices. In: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2013, 1–17

    Google Scholar 

  24. Freire E S V, Hofheinz D, Paterson K G, Striecks C. Programmable hash functions in the multilinear setting. In: Proceedings of the 33rd Annual Cryptology Conference, Part I. 2013, 513–530

    Google Scholar 

  25. Wang H, Zheng Z H, Yang B. New identity-based key-encapsulation mechanism and its applications in cloud computing. International Journal of High Performance Computing and Networking, 2015, 8(2): 124–134

    Article  Google Scholar 

  26. Hoffstein J, Pipher J, Silverman J H. NTRU: a ring-based public key cryptosystem. In: Proceedings of the 3rd Intemational Symposium on Algorithmic Number Theory (ANTS-III). 1998, 267–288

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Shandong Normal University, Jinan, 250014, China

    Hao Wang

  2. Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology, Jinan, 250014, China

    Hao Wang

  3. Security and Data Sciences, Hong Kong Applied Science and Technology Research Institute (ASTRI), Hong Kong, China

    Zhen Liu & Duncan S. Wong

  4. Laboratory of Algorithmics, Cryptology and Security (LACS), University of Luxembourg, Luxembourg, L-1359, Luxembourg

    Zhe Liu

Authors
  1. Hao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhe Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Duncan S. Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhe Liu.

Additional information

Hao Wang received his BS degree in information and computing science from Qufu Normal University, China in 2007, and his PhD degree in computer science from Shandong University, China in 2012. He is currently a lecturer in Shandong Normal University. His primary interest is publickey cryptography, in particular, designing cryptographic primitives and provable security. Currently, he is focusing on attribute-based cryptography and security in cloud computing.

Zhen Liu received the BS degree in applied mathematics and MS degree in mathematics from Shanghai Jiao Tong University, China, and received the PhD degrees in computer science from City University of Hong Kong, China and Shanghai Jiao Tong University, China. His primary interest is Applied Cryptography, in particular, encryption and signature schemes. With a mathematical background, he is interested in studying provable security and designing cryptographic primitives, for the research problems motivated by practical applications. Currently, he is focusing on lattice-based cryptography (mainly on lattice-based functional encryption) and Fully Homomorphic Encryption (FHE).

Zhe Liu received his BE degree in software engineering from Shandong University, China with first class honors, MS degrees in computer science from University of Luxembourg, Luxembourg and Shandong University, China in 2010 and 2011, respectively. Since 2011, he has been a PhD student in the Laboratory of Algorithmics, Cryptology and Security (LACS), University of Luxembourg. His research interests include computer arithmetics, with special focus on efficient implementation of Public key Cryptography (PKC) on Wireless Sensor Networks (WSNs).

Duncan S. Wong received the BE degree from the University of Hong Kong, China in 1994, theMPhil degree from the Chinese University of Hong Kong, China in 1998, and the PhD degree from Northeastern University, USA in 2002. He has been with the Chinese University of Hong Kong and then the City University of Hong Kong. He is currently a director in Security and Data Sciences at Hong Kong Applied Science and Technology Research Institute (ASTRI), China. His primary research interest is cryptography; in particular, cryptographic protocols, encryption and signature schemes, and anonymous systems. He is also interested in other topics in information security, such as network security, wireless security, database security, and security in cloud computing.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, H., Liu, Z., Liu, Z. et al. Identity-based aggregate signcryption in the standard model from multilinear maps. Front. Comput. Sci. 10, 741–754 (2016). https://doi.org/10.1007/s11704-015-5138-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-015-5138-2

Keywords

Search

Navigation