EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores

To address the deficiencies in privacy-preserving expressive query and verification mechanisms in outsourced key-value stores, we propose EKV-VBQ, a scheme designed to ensure verifiable Boolean queries over encrypted key-value data. We have integrated blockchain and homomorphic Xor operations and ps...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sensors (Basel, Switzerland) Jg. 24; H. 21; S. 6792
Hauptverfasser: Li, Yuxi, Chen, Jingjing, Zhou, Fucai, Ji, Dong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Switzerland MDPI AG 22.10.2024
MDPI
Schlagworte:
Access control
bilinear accumulators
Blockchain
Boolean
Confidentiality
Data analysis
Data integrity
Dictionaries
encrypted key-value stores
homomorphic encryption
Investment analysis
Keywords
Privacy
Queries
Semantics
Usability
verifiable Boolean queries
encrypted key-value stores
homomorphic encryption
verifiable Boolean queries
blockchain
bilinear accumulators
ISSN:1424-8220, 1424-8220
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To address the deficiencies in privacy-preserving expressive query and verification mechanisms in outsourced key-value stores, we propose EKV-VBQ, a scheme designed to ensure verifiable Boolean queries over encrypted key-value data. We have integrated blockchain and homomorphic Xor operations and pseudo-random functions to create a secure and verifiable datastore, while enabling efficient encrypted Boolean queries. Additionally, we have designed a lightweight verification protocol using bilinear map accumulators to guarantee the correctness of Boolean query results. Our security analysis demonstrates that EKV-VBQ is secure against adaptive chosen label attacks (IND-CLA) and guarantees Integrity and Unforgeability under the bilinear q-strong Diffie–Hellman assumption. Our performance evaluations showed reduced server-side storage overhead, efficient proof generation, and a significant reduction in user-side computational complexity by a factor of log n. Finally, GPU-accelerated optimizations significantly enhance EKV-VBQ’s performance, reducing computational overhead by up to 50%, making EKV-VBQ highly efficient and suitable for deployment in environments with limited computational resources.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Current address: School of Computer Science and Engineering, Northeastern University, No.195, Chuangxin Road, Hunnan District, Shenyang 116024, China.
ISSN:1424-8220
1424-8220
DOI:10.3390/s24216792