Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions

M. Abdalla; M. Bellare; D. Catalano; E. Kiltz; Tadayoshi Kohno; T. Lange; J. Malone-Lee; G. Neven; P. Paillier; H. Shi

doi:10.1007/11535218_13

Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions

M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, Tadayoshi Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › 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 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005)
Editors	V. Shoup
Place of Publication	Berlin
Publisher	Springer
Pages	205-222
ISBN (Print)	978-3-540-28114-6
DOIs	https://doi.org/10.1007/11535218_13
Publication status	Published - 2005

Publication series

Name	Lecture Notes in Computer Science
Volume	3621
ISSN (Print)	0302-9743

Access to Document

10.1007/11535218_13

Cite this

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 V. Shoup (Ed.), Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005) (pp. 205-222). (Lecture Notes in Computer Science; Vol. 3621). Springer. https://doi.org/10.1007/11535218_13

Abdalla, M. ; Bellare, M. ; Catalano, D. et al. / Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions. Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005). editor / V. Shoup. Berlin : Springer, 2005. pp. 205-222 (Lecture Notes in Computer Science).

@inproceedings{0309c450a565443db3a7b7a21af8f17e,

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 = "M. Abdalla and M. Bellare and D. Catalano and E. Kiltz and Tadayoshi Kohno and T. Lange and J. Malone-Lee and G. Neven and P. Paillier and H. Shi",

year = "2005",

doi = "10.1007/11535218_13",

language = "English",

isbn = "978-3-540-28114-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "205--222",

editor = "V. Shoup",

booktitle = "Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005)",

address = "Germany",

}

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 V Shoup (ed.), Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005). Lecture Notes in Computer Science, vol. 3621, Springer, Berlin, pp. 205-222. https://doi.org/10.1007/11535218_13

Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions. / Abdalla, M.; Bellare, M.; Catalano, D. et al.

Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005). ed. / V. Shoup. Berlin : Springer, 2005. p. 205-222 (Lecture Notes in Computer Science; Vol. 3621).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions

AU - Abdalla, M.

AU - Bellare, M.

AU - Catalano, D.

AU - Kiltz, E.

AU - Kohno, Tadayoshi

AU - Lange, T.

AU - Malone-Lee, J.

AU - Neven, G.

AU - Paillier, P.

AU - Shi, H.

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.

U2 - 10.1007/11535218_13

DO - 10.1007/11535218_13

M3 - Conference contribution

SN - 978-3-540-28114-6

T3 - Lecture Notes in Computer Science

SP - 205

EP - 222

BT - Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005)

A2 - Shoup, V.

PB - Springer

CY - Berlin

ER -

Abdalla M, Bellare M, Catalano D, Kiltz E, Kohno T, Lange T et al. Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions. In Shoup V, editor, Advances in Cryptology - CRYPTO 2005 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005). Berlin: Springer. 2005. p. 205-222. (Lecture Notes in Computer Science). doi: 10.1007/11535218_13

Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions

Abstract

Publication series

Access to Document

Fingerprint

Cite this