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.
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.
multi-authority(MA) / smart health / lattice-based encryption / privacy-preserving
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [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] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
LEWKO A, |
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
BOOTLE J, LYUBASHEVSKY V, NGUYEN N K, |
| [38] |
|
| [39] |
REGEV O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(6): 1-40. |
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
/
| 〈 |
|
〉 |