article

Oblivious keyword search

Authors:

Kaoru KurosawaAuthors Info & Claims

Journal of Complexity, Volume 20, Issue 2-3

Pages 356 - 371

https://doi.org/10.1016/j.jco.2003.08.023

Published: 01 April 2004 Publication History

Abstract

In this paper, we introduce a notion of oblivious keyword search (OKS). Let W be the set of possible keywords. In the commit phase, a database supplier I commits n data. In each transfer subphase, a user U can choose a keyword w∈W adaptively and find Search(w) without revealing w to I, where Search(w) is the set of all data which includes w as a keyword.We then show two efficient protocols such that the size of the commitments is only O(nB) regardless of the size of W, where B is the size of each data. It is formally proved that U learns nothing more than search(w) and J gains no information on the keywords which U searched for. We further present a more efficient adaptive OT_kⁿ protocol than the previous one [19] as an application of our first OKS protocol.

References

[1]

{1} M. Bellare, S. Micali, Non-interactive oblivious transfer, Proceedings of Crypto'89, Lecture Notes in Computer Science, Vol. 435, Springer, Berlin, 1990, pp. 547-557.]]

Digital Library

[2]

{2} M. Bellare, C. Namprempre, D. Pioncheval, M. Semanko, The power of RSA inversion oracles and the security of Chaum's RSA-based blind signature scheme, Proceedings of Financial Cryptography 2001, Lecture Notes in Computer Science, Vol. 2339, 2001, pp. 319-338.]]

Digital Library

[3]

{3} M. Bellare, C. Namprempre, D. Pioncheval, M. Semanko, The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme, An extended version of {2}. http://www-cse.ucsd.edu/users/mihir/crypto-research-papers.html.]]

[4]

{4} D. Bleichenbacher, P. Nguyen, Noisy polynomial interpolation and noisy Chinese remaindering, Proceeding of Eurocrypt 2000, Lecture Notes in Computer Science, Vol. 1807, 2000, pp. 53-69.]]

[5]

{5} G. Brassard, C. Crépeau, J.M. Robert, Information theoretic reduction among disclosure problems, 27th IEEE Symposium on Foundations of Computer Science, Toronto, Ontario, 1986, pp. 168-173.]]

Digital Library

[6]

{6} G. Brassard, C. Crépeau, J.M. Robert, All-or-nothing disclosure of secrets, Proceedings of Crypto '86, Lecture Notes in Computer Science, Vol. 263, 1987, pp. 234-238.]]

Digital Library

[7]

{7} C. Cachin, On the foundations of oblivious transfer, Proceedings of Eurocrypt '98, Lecture Notes in Computer Science, Vol. 1403, 1998, pp. 361-374.]]

[8]

{8} C. Cachin, S. Micali, M. Stadler, Computationally private informational retrieval with polylogarithmic communication, Proceedings of Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, 1999, pp. 402-414.]]

[9]

{9} D. Chaum, Blind signatures for untraceable payments, Proceedings of Crypto '82, Plenum Press, New York, 1982, pp. 199-203.]]

[10]

{10} B. Chor, N. Gilboa, M. Naor Private information retrieval by keywords, manuscript, 1998.]]

[11]

{11} B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan, Private information retrieval, J. ACM 45 (6) (1998) 965-982.]]

Digital Library

[12]

{12} C. Crépeau, Equivalence between two flavors of oblivious transfers, Proceedings of Crypto '87, Lecture Notes in Computer Science, Vol. 293, 1988, pp. 350-354.]]

Digital Library

[13]

{13} S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts, Comm. ACM 28 (1985) 637-647.]]

Digital Library

[14]

{14} Y. Gertner, Y. Ishai, E. Kushilevitz, T. Malkin, Protecting data privacy in private data retrieval schemes, 30th ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 151-160.]]

Digital Library

[15]

{15} O. Goldreich, R. Vainish, How to solve any protocol problem: an efficient improvement, Proceedings of Crypto '87, Lecture Notes in Computer Science, Vol. 293, 1988, pp. 73-86.]]

Digital Library

[16]

{16} J. Kilian, Founding cryptography on oblivious transfer, 20th ACM Symposium on Theory of Computing, Chicago, IL, 1988, pp. 20-31.]]

Digital Library

[17]

{17} E. Kushilevitz, R. Ostrovsky, Replication is not needed: single database, computationally-private informational retrieval, 38th IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 364-373.]]

Digital Library

[18]

{18} M. Naor, B. Pinkas, Oblivious transfer and polynomial evaluation, 31st ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 145-254.]]

Digital Library

[19]

{19} M. Naor, B. Pinkas, Oblivious transfer with adaptive queries, Proceedings of Crypto '99, Lecture Notes in Computer Science, Vol. 1666, 1999, Springer, Berlin, pp. 573-590.]]

Digital Library

[20]

{20} M. Naor, B. Pinkas, Efficient oblivious transfer protocols, 12th Annual Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2001, pp. 448-457.]]

Digital Library

[21]

{21} D. Pointcheval, J.P. Stern, Provably secure blind signature schemes, Proceedings of Asiacrypt '96, Lecture Notes in Computer Science, Vol. 1163, Kyongju, Korea, 1996, Springer, Berlin, pp. 252-265.]]

Digital Library

[22]

{22} M. Rabin, How to exchange secrets by oblivious transfer, Technical Report TR 81, Aiken Computation Lab, Harvard University, 1981.]]

[23]

{23} D. Song, D. Wagner, A. Perrig, Practical techniques for searches on encrypted data, IEEE Symposium on Security and Privacy, Oakland, CA, 2000.]]

Digital Library

Cited By

Mohanty TSrivastava VMesnager SDebnath S(2023)A constant round quantum secure protocol for oblivious polynomial evaluationJournal of Information Security and Applications10.1016/j.jisa.2023.10356077:COnline publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1016/j.jisa.2023.103560
Cianciullo LGhodosi H(2022)Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New ResultsJournal of Computer Science and Technology10.1007/s11390-022-0878-637:2(443-458)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11390-022-0878-6
Dorsala MSastry VChapram S(2021)Blockchain-based solutions for cloud computingJournal of Network and Computer Applications10.1016/j.jnca.2021.103246196:COnline publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1016/j.jnca.2021.103246
Show More Cited By

Index Terms

Oblivious keyword search

Recommendations

Distributed Protocols for Oblivious Transfer and Polynomial Evaluation
Progress in Cryptology – INDOCRYPT 2023
Abstract
A secure multiparty computation (MPC) allows several parties to compute a function over their inputs while keeping their inputs private. In its basic setting, the protocol involves only parties that hold inputs. In distributed MPC, there are also ...
Oblivious polynomial evaluation
Abstract
The problem of two-party oblivious polynomial evaluation (OPE) is studied, where one party (Alice) has a polynomialP(z) and the other party (Bob) with an inputx wants to learnP(x) in such an oblivious way that Bob obtainsP(x) without learning any ...
Oblivious Keyword Search with Authorization
ProvSec 2016: Proceedings of the 10th International Conference on Provable Security - Volume 10005

Oblivious keyword search OKS allows a user to search and retrieve the data associated with a chosen keyword in an oblivious way. The database supplier issues a trapdoor used for searching of a specific keyword chosen by the user while learns nothing ...

Comments

Information & Contributors

Information

Published In

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 April 2004

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

56
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mohanty TSrivastava VMesnager SDebnath S(2023)A constant round quantum secure protocol for oblivious polynomial evaluationJournal of Information Security and Applications10.1016/j.jisa.2023.10356077:COnline publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1016/j.jisa.2023.103560
Cianciullo LGhodosi H(2022)Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New ResultsJournal of Computer Science and Technology10.1007/s11390-022-0878-637:2(443-458)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11390-022-0878-6
Dorsala MSastry VChapram S(2021)Blockchain-based solutions for cloud computingJournal of Network and Computer Applications10.1016/j.jnca.2021.103246196:COnline publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1016/j.jnca.2021.103246
Li WWang WLin JWang QWang W(2021)Privacy Preserving OpenPGP Public Key Distribution with Spamming ResistanceInformation Security and Cryptology10.1007/978-3-030-88323-2_26(487-506)Online publication date: 12-Aug-2021
https://dl.acm.org/doi/10.1007/978-3-030-88323-2_26
Jiang PGuo FLiang KLai JWen Q(2020)SearchainFuture Generation Computer Systems10.1016/j.future.2017.08.036107:C(781-792)Online publication date: 1-Jun-2020
https://dl.acm.org/doi/10.1016/j.future.2017.08.036
Siva Kumar DSanthi Thilagam P(2019)Approaches and challenges of privacy preserving search over encrypted dataInformation Systems10.1016/j.is.2018.11.00481:C(63-81)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1016/j.is.2018.11.004
Vora AHegde S(2019)Keyword-based private searching on cloud data along with keyword association and dissociation using cuckoo filterInternational Journal of Information Security10.1007/s10207-018-0418-018:3(305-319)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10207-018-0418-0
Zhang ALin X(2018)Towards Secure and Privacy-Preserving Data Sharing in e-Health Systems via Consortium BlockchainJournal of Medical Systems10.1007/s10916-018-0995-542:8(1-18)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s10916-018-0995-5
Phuong TLe TThang HHu ZBui MSikdar BIDE IBinh HEngchuan WSang DOanh N(2017)Efficient Secure Text Retrieval on Multi-Keyword SearchProceedings of the 8th International Symposium on Information and Communication Technology10.1145/3155133.3155159(270-277)Online publication date: 7-Dec-2017
https://dl.acm.org/doi/10.1145/3155133.3155159
Busom NPetrlic RSeb FSorge CValls M(2017)A privacy-preserving reputation system with user rewardsJournal of Network and Computer Applications10.1016/j.jnca.2016.12.02380:C(58-66)Online publication date: 15-Feb-2017
https://dl.acm.org/doi/10.1016/j.jnca.2016.12.023
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents