We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of Boneh et al. (Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, pp. 506–522, 2004) is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous identity-based encryption (IBE) scheme to a secure PEKS scheme that, unlike the previous one, guarantees consistency. Finally, we suggest three extensions of the basic notions considered here, namely anonymous hierarchical identity-based encryption, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.
|Titolo:||Searchable Encryption Revisited: Consistency Conditions, Relation to Anonymous IBE, and Extensions|
|Data di pubblicazione:||2008|
|Citazione:||Searchable Encryption Revisited: Consistency Conditions, Relation to Anonymous IBE, and Extensions / ABDALLA MICHEL; BELLARE MIHIR; CATALANO DARIO; KILTZ EIKE; KOHNO TADAYOSHI; LANGE TANIA; MALONE-LEE JOHN; NEVEN GREGORY; PAILLIER PASCAL; SHI HAIXIA. - 21:3(2008), pp. 350-391.|
|Appare nelle tipologie:||1.1 Articolo in rivista|