A Robust Framework for Lattice-Based Data Sharing in Cloud Enviroinments

Authors

  • K. Antony Sudha
  • S P Jaswanth
  • R Bharanidharan
  • J Adhithyan
  • S Ramakrishnan

Keywords:

Attribute-Based Proxy Re-Encryption, Verifiability, Fairness, Lattice-Based Cryptography, Cloud Security, Quantum-Resistant Encryption

Abstract

With the increasing reliance on cloud computing for outsourced data storage and sharing, ensuring both security and efficiency in encrypted data sharing has become a critical challenge. Attribute-Based Proxy Re-Encryption (ABPRE) has emerged as a promising solution, allowing a cloud server to transform a ciphertext intended for an original recipient into one decryptable by a designated shared user based on their attributes. However, existing ABPRE schemes lack mechanisms to guarantee verifiability and fairness, making them vulnerable to dishonest cloud servers returning incorrect re-encrypted ciphertexts to save computational resources, or malicious shared users falsely accusing honest servers of misconduct. To address these issues, A novel Verifiable and Fair lattice Attribute-Based Proxy Re-Encryption (VF-ABPRE) scheme based on lattice-based cryptography is implemented. The proposed scheme ensures verifiability by enabling shared users to efficiently verify the correctness of the re-encrypted ciphertext before decryption. Additionally, it incorporates a fairness mechanism that prevents false accusations by providing cryptographic proofs of honest re-encryption operations. By leveraging lattice-based cryptographic constructions, this scheme achieves strong security guarantees against quantum adversaries while maintaining computational efficiency. The core of this VF-ABPRE scheme is built upon lattice-based homomorphic encryption techniques and trapdoor functions, which provide robustness against known cryptographic attacks. The re-encryption process is designed to be verifiable through a publicly verifiable proof, ensuring that any recipient can independently check the integrity of the transformed ciphertext. Furthermore, the fairness mechanism employs zero-knowledge proofs to allow the cloud server to demonstrate its correct execution of re-encryption without revealing sensitive information about the original data.

Downloads

Download data is not yet available.

References

Singh, R., Patel, A., and Kumar, V., “An identity-based proxy re-encryption scheme utilizing lattice structures,” in JISIS, vol. 3, no. 34, 2013, pp. 89–102.

Dutta, S., Sharma, P., and Gupta, R., “Collusion-resistant identity-based proxy re-encryption scheme secure in the standard model,” in ARXIV, 2020, pp. 1–15.

Cohen, G., Peikert, C., and Wang, Z., “A homomorphic lattice-based proxy re-encryption scheme with tight security,” in IACR Cryptology ePrint Archive, 2024, pp. 681–698.

C. Ge, W. Susilo, J. Baek, Z. Liu, J. Xia, and L. Fang, “A verifiable and fair attribute-based proxy re-encryption scheme for data sharing in clouds,” IEEE Transactions on Dependable and Secure Computing, DOI: 10.1109/TDSC.2021.3076580, 2021.

J. Lai, R. H.J. Weng, “Attribute-based encryption with verifiable outsourced decryption,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 8, pp. 1343–1354, 2013.

H. Ma, R. Zhang, Z. Wan, Y. Lu, “Verifiable and exculpable outsourced attribute-based encryption for access control in cloud computing,” IEEE Transactions on Dependable and Secure Computing, vol. 14, no. 6, pp. 679–692, 2015.

K. Emura, A. Miyaji, A. Nomura, K. Omote, and M. Soshi, “A ciphertext-policy attribute-based encryption scheme with constant ciphertext length,” in International Conference on Information Security Practice and Experience. Springer, 2009, pp. 13–23.

S. Hohenberger and B. Waters, “Attribute-based encryption with fast decryption,” in International Workshop on Public Key Cryptography. Springer, 2013, pp. 162–179.

N. Attrapadung, B. Libert, and E. De Panafieu, “Expressive key-policy attribute-based encryption with constant-size ciphertexts,” in International Workshop on Public Key Cryptography. Springer, 2011, pp. 90–108.

J. Herranz, F. Laguillaumie, and C. Ràfols, “Constant size ciphertexts in threshold attribute-based encryption,” in International Workshop on Public Key Cryptography. Springer, 2010, pp. 19–34.

N. Attrapadung et al., “Attribute-based encryption schemes with constant-size ciphertexts,” Theoretical Computer Science, vol. 422, pp. 15–38, 2012.

C. Chen, “Efficient ciphertext policy attribute-based encryption with constant-size ciphertext and constant computation-cost,” in International Conference on Information Security and Cryptology. Springer, 2011, pp. 84–101.

A. Lewko and B. Waters, “New proof methods for attribute-based encryption: Achieving full security through selective techniques,” in Annual Cryptology Conference. Springer, 2012, pp. 180–198.

B. Waters, “Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization,” Lecture Notes in Computer Science, vol. 2008, pp. 321–334, 2011.

J. Chen and H. Wee, “Semi-adaptive security for ciphertext-policy attribute-based encryption and improved delegation for Boolean formulas,” in International Conference on Security and Cryptography for Networks. Springer, 2014, pp. 277–297.

A. Lewko et al., “Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 2010, pp. 62–91.

T. V. X. Phuong, G. Yang, and W. Susilo, “Efficient ciphertext-policy attribute-based encryption under standard assumptions,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 1, pp. 35–45, 2015.

H. Cui et al., “An efficient and expressive ciphertext-policy attribute-based encryption with partially hidden access structures,” in International Conference on Provable Security. Springer, 2016, pp. 19–38.

.

Downloads

Published

2025-07-18

How to Cite

1.
Sudha KA, Jaswanth SP, Bharanidharan R, Adhithyan J, Ramakrishnan S. A Robust Framework for Lattice-Based Data Sharing in Cloud Enviroinments. J Neonatal Surg [Internet]. 2025Jul.18 [cited 2025Sep.22];14(4S):1420-9. Available from: https://jneonatalsurg.com/index.php/jns/article/view/8382

Issue

Vol. 14 No. 4S (2025): Journal of Neonatal Surgery

Section

Original Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

You are free to:

  • Adapt — remix, transform, and build upon the material for any purpose, even commercially.

Terms:

  • Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.