.png){kind=icon}
Return
Decentralized multi-client boolean keyword search for encrypted cloud storage
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csi.2026.104127.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Eliminating Key Escrow Problem. This manuscript address the key escrow problem in multi-client searchable symmetric encryption by introducing an aggregation key agreement that requires no secure channel. • Sub-linear Search Complexity. We present a semi-generic construction of decentralized multi-client searchable symmetric encryption and re-construct the OXT-based trapdoor tuples for sub-linear complexity. • Experimental Verification. We conduct the implementation over a well-known dataset (Enron) under real-world cloud platform, the experiment confirms that our scheme achieves comparable performance while eliminating key escrow problem.
Journal
C
IF:
3.1
Papers:
65
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave no more
no more