Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers

By Qi Chai, G. Gong. 2012

266 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Auto-Keras: An Efficient Neural Architecture Search System (2018, background): “Third, the AutoML service providers are honest-but-curious [7], which cannot guarantee the security and privacy of the data.”
Blockchain based searchable encryption for electronic health record sharing (2019, methodology): “However, existing verifiable searchable encryption schemes [12-16] do not support this property, because the user already paid before the server starts searching.”
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data (2014, background): “It is worth mentioning that the secure verifiable keyword search in the symmetric-key setti ng [18] can be insecure in the public-key setting because the attacker can infer keywords in question via an off-linekeyword guessing attack (in lieu of the off-line dictionary attack a gainst passwords).”