Skip to main content
SpringerLink
Log in

Lattice-based autonomous path proxy re-encryption in the standard model

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Autonomous path proxy re-encryption (AP-PRE) is a type of PRE that implements control on the delegation path in a multi-hop PRE. AP-PRE forces the proxy to perform the transformation along a predefined path without revealing the underlying plaintext. There are several applications of AP-PRE, including electronic medical systems, data sharing, and email systems. However, as far as we know, the existing AP-PRE scheme is provably secure in the random oracle model under the classical number-theoretic assumption, which might be vulnerable to quantum computers. Therefore, it raises the intriguing question of how to construct a quantum-resistant AP-PRE scheme. In this study, we proposed an AP-PRE scheme based on the widely accepted quantum-resistant learning with errors (LWE) assumptions. Our scheme supports the polynomial length of the delegation path. Furthermore, our scheme is proved to be selective-path CPA (sCPA) secure in the standard model under LWE assumptions.

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. Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Espoo, 1998. 127–144

  2. Shao J, Cao Z. Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption. Inf Sci, 2012, 206: 83–95

    Article  MathSciNet  MATH  Google Scholar 

  3. Deng H, Qin Z, Wu Q, et al. Flexible attribute-based proxy re-encryption for efficient data sharing. Inf Sci, 2020, 511: 94–113

    Article  MathSciNet  MATH  Google Scholar 

  4. Tang Q. Type-based proxy re-encryption and its construction. In: Proceedings of International Conference on Cryptology in India, Kharagpur, 2008. 130–144

  5. Weng J, Deng R H, Ding X H, et al. Conditional proxy re-encryption secure against chosen-ciphertext attack. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, Sydney, 2009. 322–332

  6. Cao Z, Wang H, Zhao Y. AP-PRE: autonomous path proxy re-encryption and its applications. IEEE Trans Depend Secure Comput, 2017, 16: 833–842

    Article  Google Scholar 

  7. Canetti R, Hohenberger S. Chosen-ciphertext secure proxy re-encryption. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, New York, 2007. 185–194

  8. Green M, Ateniese G. Identity-based proxy re-encryption. In: Proceedings of International Conference on Applied Cryptography and Network Security, Zhuhai, 2007. 288–306

  9. Wang H, Cao Z, Wang L. Multi-use and unidirectional identity-based proxy re-encryption schemes. Inf Sci, 2010, 180: 4042–4059

    Article  MathSciNet  MATH  Google Scholar 

  10. Liang X H, Cao Z F, Lin H, et al. Attribute based proxy re-encryption with delegating capabilities. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, Sydney, 2009. 276–286

  11. Li Z, Sharma V, Ma C, et al. Ciphertext-policy attribute-based proxy re-encryption via constrained PRFs. Sci China Inf Sci, 2021, 64: 169301

    Article  MathSciNet  Google Scholar 

  12. Fang L M, Wang J D, Ge C P, et al. Fuzzy conditional proxy re-encryption. Sci China Inf Sci, 2013, 56: 052116

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhao J, Feng D G, Zhang Z F. Attribute-based conditional proxy re-encryption with chosen-ciphertext security. In: Proceedings of IEEE Global Telecommunications Conference, Miami, 2010. 1–6

  14. Xagawa D K. Cryptography with lattices. Dissertation for Ph.D. Degree. Tokyo: Tokyo Institute of Technology, 2005

    Google Scholar 

  15. Kirshanova E. Proxy re-encryption from lattices. In: Proceedings of International Workshop on Public Key Cryptography, Buenos Aires, 2014. 77–94

  16. Micciancio D, Peikert C. Trapdoors for lattices: simpler, tighter, faster, smaller. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, 2012. 700–718

  17. Jiang M M, Hu Y P, Wang B C, et al. Lattice-based multi-use unidirectional proxy re-encryption. Secur Comm Netw, 2015, 8: 3796–3803

    Article  Google Scholar 

  18. Liang X J, Weng J, Yang A J, et al. Attribute-based conditional proxy re-encryption in the standard model under LWE. In: Proceedings of European Symposium on Research in Computer Security, Darmstadt, 2021. 147–168

  19. Susilo W, Dutta P, Duong D H, et al. Conditional proxy re-encryption secure against chosen-ciphertext attackLattice-based HRA-secure attribute-based proxy re-encryption in standard model. In: Proceedings of European Symposium on Research in Computer Security, Darmstadt, 2021. 169–191

  20. Boneh D, Gentry C, Gorbunov S, et al. Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Berlin, 2014. 533–556

  21. Wang H B, Cao Z F. A fully secure unidirectional and multi-use proxy re-encryption scheme. ACM CCS, Poster Session, 2009. https://www.sigsac.org/ccs/CCS2009/pd/abstract_16.pdf

  22. Aono Y, Boyen X, Phong L T, et al. Key-private proxy re-encryption under LWE. In: Proceedings of the 14th International Conference on Cryptology in India, Mumbai, 2013. 1–18

  23. Luo F, Al-Kuwari S, Wang F, et al. Attribute-based proxy re-encryption from standard lattices. Theor Comput Sci, 2021, 865: 52–62

    Article  MathSciNet  MATH  Google Scholar 

  24. Regev O. On lattices, learning with errors, random linear codes, and cryptography. J ACM, 2009, 56: 1–40

    Article  MathSciNet  MATH  Google Scholar 

  25. Peikert C. Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, New York, 2009. 333–342

  26. Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measures. SIAM J Comput, 2007, 37: 267–302

    Article  MathSciNet  MATH  Google Scholar 

  27. Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 2008. 197–206

  28. Agrawal S, Boneh D, Boyen X. Efficient lattice (H) IBE in the standard model. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, 2010. 553–572

  29. Cohen A. What about bob? The inadequacy of CPA security for proxy reencryption. In: Proceedings of IACR International Workshop on Public Key Cryptography, Beijing, 2019. 287–316

Download references

Acknowledgements

Jian WENG was supported by Major Program of Guangdong Basic and Applied Research Project (Grant No. 2019B030302008), National Natural Science Foundation of China (Grant Nos. 61825203, U22B2028), National Key Research and Development Plan of China (Grant No. 2020YFB1005600), Guangdong Provincial Science and Technology Project (Grant No. 2021A0505030033), Science and Technology Major Project of Tibetan Autonomous Region of China (Grant No. XZ202201ZD0006G), National Joint Engineering Research Center of Network Security Detection and Protection Technology, Guangdong Key Laboratory of Data Security and Privacy Preserving and Guangdong Hong Kong Joint Laboratory for Data Security and Privacy Protection. This work was also supported by Special Funds for the Cultivation of Guangdong College Students’ Scientific and Technological Innovation (“Climbing Program” Special Funds) (Grant No. pdjh2021a0050). We all thank the anonymous reviewers for their valuable comments and suggestions which improve the content and presentation of this work a lot.

Author information

Authors and Affiliations

  1. College of Cyber Security, Jinan University, Guangzhou, 510632, China

    Wenli Xie, Jian Weng, Xiaojian Liang, Lisha Yao & Feixiang Zhao

  2. Guangzhou Fongwell Data Limited Company, Guangzhou, 510632, China

    Yao Tong

Authors
  1. Wenli Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian Weng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yao Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaojian Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lisha Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Feixiang Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jian Weng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xie, W., Weng, J., Tong, Y. et al. Lattice-based autonomous path proxy re-encryption in the standard model. Sci. China Inf. Sci. 66, 202101 (2023). https://doi.org/10.1007/s11432-022-3612-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-022-3612-6

Keywords

Search

Navigation