Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Michel Abdalla; Mihir Bellare; Dario Catalano; Eike Kiltz; Tadayoshi Kohno; Tanja Lange; John Malone-Lee; Gregory Neven; Pascal Paillier; Haixia Shi

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi

École normale supérieure

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

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 [7] is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous 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 HIBE, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.

Original language	English
Title of host publication	Advances in Cryptology - CRYPTO 2005 : 25th Annual International Cryptology Conference
Publication date	2005
Pages	205-222
ISBN (Print)	3-540-28114-2
Publication status	Published - 2005
Event	Advances in Cryptology - Crypto 2005 - Santa Barbara Duration: 1 Jan 2005 → …

Conference

Conference	Advances in Cryptology - Crypto 2005
City	Santa Barbara
Period	01/01/2005 → …

OpenUrl availability

Full text

Cite this

@inproceedings{a0b6e3c18b994f388d1941abd3afda85,

title = "Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions",

abstract = "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 [7] is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous 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 HIBE, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.",

author = "Michel Abdalla and Mihir Bellare and Dario Catalano and Eike Kiltz and Tadayoshi Kohno and Tanja Lange and John Malone-Lee and Gregory Neven and Pascal Paillier and Haixia Shi",

year = "2005",

language = "English",

isbn = "3-540-28114-2",

pages = "205--222",

booktitle = "Advances in Cryptology - CRYPTO 2005",

note = "Advances in Cryptology - Crypto 2005, Crypto 2005 ; Conference date: 01-01-2005",

}

Abdalla, M, Bellare, M, Catalano, D, Kiltz, E, Kohno, T, Lange, T, Malone-Lee, J, Neven, G, Paillier, P & Shi, H 2005, Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. in Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference. pp. 205-222, Advances in Cryptology - Crypto 2005, Santa Barbara, 01/01/2005.

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. / Abdalla, Michel; Bellare, Mihir; Catalano, Dario et al.

Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference. 2005. p. 205-222.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

AU - Abdalla, Michel

AU - Bellare, Mihir

AU - Catalano, Dario

AU - Kiltz, Eike

AU - Kohno, Tadayoshi

AU - Lange, Tanja

AU - Malone-Lee, John

AU - Neven, Gregory

AU - Paillier, Pascal

AU - Shi, Haixia

PY - 2005

Y1 - 2005

N2 - 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 [7] is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous 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 HIBE, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.

AB - 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 [7] is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous 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 HIBE, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.

M3 - Article in proceedings

SN - 3-540-28114-2

SP - 205

EP - 222

BT - Advances in Cryptology - CRYPTO 2005

T2 - Advances in Cryptology - Crypto 2005

Y2 - 1 January 2005

ER -

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this