Efficient privacy-preserving personal health record sharing framework based on decentralized lattice-based encryption

Yi Chuai , Leyou Zhang , Quanjiang Li

The Journal of China Universities of Posts and Telecommunications ›› 2026, Vol. 33 ›› Issue (2) : 55 -68.

PDF (1816KB)
The Journal of China Universities of Posts and Telecommunications ›› 2026, Vol. 33 ›› Issue (2) :55 -68. DOI: 10.19682/j.cnki.1005-8885.2026.1004
Information Security
research-article
Efficient privacy-preserving personal health record sharing framework based on decentralized lattice-based encryption
Author information +
History +
PDF (1816KB)

Abstract

To ensure the confidentiality of Internet of things (IoT) cloud data while enabling fine-grained access control, attribute-based encryption (ABE) schemes have been widely adopted. Despite their advantages, existing approaches suffer from three critical shortcomings: reliance on a central authority (CA) for key distribution which may lead to a single point of failure, dependence on mathematical hard problems like discrete logarithms and bilinear pairings which leaves most of them vulnerable to quantum attacks, and insufficient attention to user privacy protection mechanisms in current lattice-based ABE designs. To address these limitations, this article proposes a privacy-preserving personal health record (PHR) sharing framework based on lattice-based multi-authority attribute-based encryption (MA-ABE). The framework enhances user privacy through an anonymous commitment protocol that conceals identities and a key generation algorithm that allows decentralized authorities to issue private keys without exposing user information. Furthermore, the design extends beyond conventional single-attribute-per-authority models, enabling each authority to manage multiple attributes. Moreover, two-way anonymity for both provers and verifiers is achieved through these user privacy protection mechanisms. The proposed scheme achieves indistinguishability under selective-attribute chosen plaintext attack (IND-sAtt-CPA) security, while maintaining acceptable computational efficiency.

Keywords

multi-authority(MA) / smart health / lattice-based encryption / privacy-preserving

Cite this article

Download citation ▾
Yi Chuai, Leyou Zhang, Quanjiang Li. Efficient privacy-preserving personal health record sharing framework based on decentralized lattice-based encryption. The Journal of China Universities of Posts and Telecommunications, 2026, 33 (2) : 55-68 DOI:10.19682/j.cnki.1005-8885.2026.1004

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

SAHAI A, WATERS B . Fuzzy identity-based encryption. Advances in Cryptology: Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'05), 2005, May 22 - 26, Aarhus, Denmark. Berlin, Germany: Springer, 2005: 457-473.

[2]

GOYAL V, PANDEY O, SAHAI A, et al. Attribute-based encryption for finegrained access control of encrypted data. Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS'06), 2006, Oct 30 - Nov 3, Alexandria, VA, USA. New York, NY, USA: ACM, 2006: 89-98.

[3]

WANG H Y, LIANG J L, DING Y, et al. Ciphertext-policy attribute-based encryption supporting policy-hiding and cloud auditing in smart health. Computer Standards & Interfaces, 2023, 84: Article 103696.

[4]

ZHANG L Y, YOU W T, MU Y . Secure outsourced attributebased sharing framework for lightweight devices in smart health systems. IEEE Transactions on Services Computing, 2021, 15(5): 3019-3030.

[5]

ZHONG H, ZHOU Y Y, ZHANG Q Y, et al. An efficient and outsourcingsupported attribute-based access control scheme for edge-enabled smart healthcare. Future Generation Computer Systems, 2021, 115: 486-496.

[6]

SU J, ZHANG L Y, MU Y . BA-RMKABSE: Blockchain-aided ranked multikeyword attribute-based searchable encryption with hiding policy for smart health system. Future Generation Computer Systems, 2022, 132: 299-309.

[7]

SHOR P W . Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, Nov 20 - 22, Santa Fe, NM, USA. Piscataway, NJ, USA: IEEE, 1994: 124-134.

[8]

GROVER L K . A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing ( STOC'96 ), 1996, May 22 - 24, Philadelphia, PA, USA. New York, NY, USA: ACM, 1996: 212-219.

[9]

FORD P. The quantum cybersecurity threat may arrive sooner than you think. Computer, 2023, 56(2): 134-136.

[10]

MICCIANCIO D. Lattice-based cryptography. VAN TILBORG H C A, JAJODIA S ( eds ). Encyclopedia of Cryptography and Security, 2nd edn. Berlin, Germany: Springer, 2011: 347-349.

[11]

ZHAO S Y, JIANG R, BHARGAVA B . RL-ABE: A revocable lattice attribute-based encryption scheme based on R-LWE problem in cloud storage. IEEE Transactions on Services Computing. 2022, 15(2): 1026-1035.

[12]

ZHANG Y H, LIU X M, HU Y P . Simplified server-aided revocable identity-based encryption from lattices. Provable and Practical Security: Proceedings of the 16th International Conference on Provable and Practical Security ( ProvSec'22 ), 2022, Nov 11 - 12, Nanjing, China. Berlin, Germany: Springer, 2022: 71-87.

[13]

CHEN E, ZHU Y, LIANG K T, et al. Secure remote cloud file sharing with attribute-based access control and performance optimization. IEEE Transactions on Cloud Computing, 2023, 11(1): 579-594.

[14]

ZHANG G Y, QIN J, QAZI S . Multi-authority attribute-based encryption scheme from lattices. Journal of Universal Computer Science, 2015, 21(3): 483-501.

[15]

HUANG B X, GAO J T, LI X L . Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing. Journal of Cloud Computing, 2023, 12: Article 37.

[16]

LIU Z C, JIANG Z L, WANG X, et al. Multi-authority ciphertext policy attribute-based encryption scheme on ideal lattices. Proceedings of the 2018 IEEE International Conference on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications ( ISPA/ IUCC/ BDCloud/ SocialCom/ SustainCom'18), 2018, Dec 11 - 13, Melbourne, Australia. Piscataway, NJ, USA: IEEE, 2018: 1003-1008.

[17]

YANG Y, SUN J G, LIU Z C, et al. Practical revocable and multi-authority CP-ABE scheme from RLWE for Cloud Computing. Journal of Information Security and Applications, 2022, 65: Article 103108.

[18]

XIE S W, ZHANG L Y, WU Q, et al. Flexibly expressive and revocable multi-authority KP-ABE scheme from RLWE for Internet of medical things. Journal of Systems Architecture, 2024, 152: Article 103179.

[19]

ZHANG Y H, LIU X M, HU Y P, et al. An improved group signature scheme with VLR over lattices. Security and Communication Networks, 2021: DOI: 10.1155/2021/9988939.

[20]

SUN Y R, LIU Y Y . An efficient fully dynamic group signature with message dependent opening from lattice. Cybersecurity, 2021, 4: Article 15.

[21]

AGRAWAL S, KIRSHANOVA E, STEHLé D, et al. Practical, round-optimal lattice-based blind signatures. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (CCS'2), 2022, Nov 7 - 11, Los Angeles, CA, USA. New York, NY, USA: ACM, 2022: 39-53.

[22]

LI C Y, TIAN Y, CHEN X B, et al. An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. Information Sciences, 2021, 546: 253-64.

[23]

WATERS B, WEE H, WU D J . Multi-authority ABE from lattices without random oracles. Theory of Cryptography: Proceedings of the 20th International Conference on Theory of Cryptograph ( TCC'22 ), 2022, Nov 7 - 10, Chicago, IL, USA. Cham, Switzerland: Springer Nature Switzerland, 2022: 651-679.

[24]

CHASE M. Multi-authority attribute based encryption. Theory of Cryptography: Proceedings of the 4th Conference on Theory of Cryptograph ( TCC'07), 2007, Feb 21 - 24, Amsterdam, The Netherlands. Berlin, Germany: Springer, 2007: 515-534.

[25]

LEWKO A, WATERS B. Decentralizing attribute-based encryption. Advances in Cryptology: Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Technique ( EUROCRYPT'11), 2011, May 15 - 19, Tallinn, Estonia. Berlin, Germany: Springer, 2011: 568-588.

[26]

LIU Y, WANG L C, LI L X, et al. Secure and efficient multi-authority attribute-based encryption scheme from lattices. IEEE Access. 2018, 7: 3665-3674.

[27]

WANG Z D, FAN X, LIU F H . FE for inner products and its application to decentralized ABE. Proceedings of the 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography ( PKC'19), 2019, Apr 14 - 17, Beijing, China. Berlin, Germany: Springer, 2019: 97-127.

[28]

DATTA P, KOMARGODSKI I, WATERS B . Decentralized multi-authority ABE for DNFs from LWE. Advances in Cryptology: Proceedings of the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques ( EUROCRYPT'21 ), 2021, Oct 17 - 21, Zagreb, Croatia. Berlin, Germany: Springer, 2021: 177-209.

[29]

YAO Y F, CHEN H Y, GAO Y, et al. A decentralized multi-authority CP-ABE scheme from LWE. Journal of Information Security and Applications, 2024, 82: Article 103752.

[30]

CHASE M, CHOW S S . Improving privacy and security in multi-authority attribute-based encryption. Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS'09), 2009, Nov 9 - 13, Chicago, IL, USA. New York, NY, USA: ACM, 2009: 121-130.

[31]

HAN J G, SUSILO W, MU Y . Privacy-preserving decentralized key-policy attribute-based encryption. IEEE Transactions on parallel and distributed systems, 2012, 23(11): 2150-2162.

[32]

QIAN H L, LI J G, ZHANG Y C . Privacy-preserving decentralized ciphertext-policy attribute-based encryption with fully hidden access structure. Information and Communications Security: Proceedings of the 15th International Conference on Information and Communications Security ( ICICS '13 ), 2013, Nov 20 - 22, Beijing, China. Berlin, Germany: Springer, 2013: 363-372.

[33]

HAN J G, SUSILO W, MU Y, et al. Improving privacy and security in decentralized ciphertext-policy attribute-based encryption. IEEE Transactions on information forensics and security, 2015, 10(3): 665-678.

[34]

WANG M Q, ZHANG Z F, CHEN C . Security analysis of a privacy-preserving decentralized ciphertext-policy attribute-based encryption scheme. Concurrency and Computation: Practice and Experience, 2016, 28(4): 1237-1245.

[35]

ZHOU Y W, XU R, QIAO Z R, et al. An anonymous and efficient multimessage and multireceiver certificateless signcryption scheme for VANET. IEEE Internet of Things Journal, 2023, 10(24): 22823-22835.

[36]

JEUDY C, ROUX-LANGLOIS A, SANDERS O . Lattice signature with efficient protocols, application to anonymous credentials. Advances in Cryptology: Proceedings of the 43rd International Cryptology on Advances in Cryptology (CRYPTO'23), 2023, Aug 20 - 24, Santa Barbara, CA, USA. Berlin, Germany: Springer, 2023: 351-383.

[37]

BOOTLE J, LYUBASHEVSKY V, NGUYEN N K, et al. A framework for practical anonymous credentials from lattices. Advances in Cryptology: Proceedings of the 43rd International Cryptology on Advances in Cryptology (CRYPTO'23), 2023, Aug 20 - 24, Santa Barbara, CA, USA. Berlin, Germany: Springer, 2023: 384-417.

[38]

LAI Q Q, LIU F H, LYSYANSKAYA A, et al. Lattice-based commit-transferrable signatures and applications to anonymous credentials. IACR Cryptol ePrint Arch, 2023: Article 766.

[39]

REGEV O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(6): 1-40.

[40]

MICCIANCIO D, PEIKERT C . Trapdoors for lattices: Simpler, tighter, faster, smaller. Advances in Cryptology: Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques ( EUROCRYPT'12 ), 2012, Apr 15 - 19, Cambridge, UK. Berlin, Germany: Springer, 2012: 700-718.

[41]

GENTRY C, PEIKERT C, VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, May 17 - 20, Victoria, Canada. New York, NY, USA: ACM, 2008: 197-206.

[42]

BAUM C, DAMGÅRD I, LYUBASHEVSKY V, et al. More efficient commitments from structured lattice assumptions. Security and Cryptography for Networks: Proceedings of the 11th International Conference on Security and Cryptography for Networks ( SCN'18), 2018, Sept 5 - 7, Amalfi, Italy. Berlin, Germany: Springer, 2018: 368-385.

[43]

ZHANG J, ZHANG Z F . A ciphertext policy attribute-based encryption scheme without pairings. Information Security and Cryptology: Proceedings of the 7th International Conference on Information Security and Cryptology (INSCRYPT'11), 2011, Nov 30 - Dec 3, Beijing, China. Berlin, Germany: Springer, 2011: 324-340.

[44]

DONG X T, HU Y P, WANG B C, et al. Lattice-based revocable attribute-based encryption with decryption key exposure resistance. IET Information Security, 2021, 15(6): 428-441.

[45]

CHEN Z G, SHI Y F, SONG X X . Fully homomorphic encryption concrete security parameter analysis. Journal of Cryptology, 2016, 3(5): 480-491. (in Chinese)

[46]

AVANZI R, BOS J, DUCAS L, et al. CRYSTALS-Kyber algorithm specifications and supporting documentation. NIST PQC Round, 2017: 32p.

PDF (1816KB)

4

Accesses

0

Citation

Detail

Sections
Recommended

/

〈 〉