PM-ABE: Puncturable Bilateral Fine-Grained Access Control From Lattices for Secret Sharing

被引:2
作者
Yang, Mengxue [1 ]
Wang, Huaqun [1 ]
He, Debiao [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Comp, Nanjing 210003, Peoples R China
[2] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Receivers; Encryption; Access control; Security; Lattices; Law enforcement; Servers; Attribute-Based encryption; lattice; matchmaking encryption; puncturable encryption; ATTRIBUTE-BASED ENCRYPTION; CIPHERTEXT;
D O I
10.1109/TDSC.2024.3431035
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In the era of flourishing sustainable smart cities, with the accessibility of Internet and the persistent evolution of distributed computing, there is an increasing reliance on cloud/fog computing environments and online data storage platforms for secure data sharing. However, existing cryptographic schemes fall short in simultaneously satisfying security requirements such as bilateral fine-grained access control, resilience to quantum attacks, assurance of the authenticity of decrypted data, and forward security for historical data. To tackle these challenges, we propose the innovative puncturable attribute-based matchmaking encryption scheme based on lattice cryptography. The method adeptly satisfies the aforementioned stringent security requirements concurrently, offering a triple-layered assurance for the secure implementation of secret sharing. The receiver, unable to successfully decrypt, remains uninformed about any specifics regarding ciphertexts and the access policy. Our PM-ABE scheme has manifested resilience against quantum attacks, collusion attacks, chosen plaintext attacks and ensuring unforgeability under chosen message attacks. Furthermore, our comprehensive efficiency analysis substantiates that our scheme maintains a favorable level of computational efficiency and storage consumption.
引用
收藏
页码:1210 / 1223
页数:14
相关论文
共 26 条
[1]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[2]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6110, P553
[3]  
Ajtai M., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P1
[4]   Match Me if You Can: Matchmaking Encryption and Its Applications [J].
Ateniese, Giuseppe ;
Francati, Danilo ;
Nunez, David ;
Venturi, Daniele .
ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 :701-731
[5]   Dual-Policy Attribute Based Encryption: Simultaneous Access Control with Ciphertext and Key Policies [J].
Attrapadung, Nuttapong ;
Imai, Hideki .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (01) :116-125
[6]   Secret handshakes from pairing-based key agreements [J].
Balfanz, D ;
Durfee, G ;
Shankar, N ;
Smetters, D ;
Staddon, J ;
Wong, HC .
2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :180-196
[7]   Ciphertext-policy attribute-based encryption [J].
Bethencourt, John ;
Sahai, Amit ;
Waters, Brent .
2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, :321-+
[8]   Puncturable identity-based and attribute-based encryption from lattices [J].
Dutta, Priyanka ;
Susilo, Willy ;
Dung Hoang Duong ;
Roy, Partha Sarathi .
THEORETICAL COMPUTER SCIENCE, 2022, 929 :18-38
[9]  
Gagné M, 2010, LECT NOTES COMPUT SC, V6280, P154, DOI 10.1007/978-3-642-15317-4_11
[10]  
Gentry C, 2008, ACM S THEORY COMPUT, P197