short-paper

Verifiable Searchable Symmetric Encryption from Indistinguishability Obfuscation

Authors:

Kui RenAuthors Info & Claims

ASIA CCS '15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security

Pages 621 - 626

https://doi.org/10.1145/2714576.2714623

Published: 14 April 2015 Publication History

Abstract

Searchable symmetric encryption (SSE) allows a client to encrypt his data in such a manner that the data can be efficiently searched. SSE has practical application in cloud storage, where a client outsources his encrypted data to a cloud server while maintaining the searchable ability over his data. Most of the current SSE schemes assume that the cloud server is honest-but-curious. However, the cloud may actively cheat on the search process to keep its cost low. In this paper, we focus on the malicious cloud model and propose a new verifiable searchable symmetric encryption scheme. Our scheme is built on the secure indistinguishability obfuscation (iO) and can be considered as the first step to apply iO in the SSE field. Moreover, our scheme can be easily extended to multiple functionalities, such as conjunctive and boolean queries. Furthermore, it can be extended to realize a publicly verifiable SSE. Thorough analysis shows that our scheme is secure and achieves a better performance.

References

[1]

K. Ren, C. Wang, and Q. Wang. Security challenges for the public cloud. IEEE Internet Computing, 16(1):69--73, 2012.

Digital Library

[2]

C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC 2009 Proceedings, pages 169--178, 2009.

Digital Library

[3]

O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. Journal of the ACM (JACM), 43(3):431--473, 1996.

Digital Library

[4]

D. Song, D. Wagner, and A. Perrig. Practical techniques for searching on encrypted data. In Symposium on Research in Security and Privacy (SSP), pages 44--55, 2000.

Digital Library

[5]

P. Golle, J. Staddon, and B. Waters. Secure conjunctive keyword search over encrypted data. In ACNS 2004 Proceedings, pages 31--45. Springer-Verlag, 2004.

[6]

S. Kamara, C. Papamanthou, and T. Roeder. Dynamic searchable symmetric encryption. In ACM CCS 2012 Proceedings, pages 965--976, 2012.

Digital Library

[7]

D. Cash, S. Jarecki, C. S. Jutla, H. Krawczyk, M. C. Rosu, and M. Steiner. Highly-scalable searchable symmetric encryption with support for boolean queries. In CRYPTO 2013 Proceedings, pages 353--373. Springer-Verlag, 2013.

[8]

J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou. Fuzzy keyword search over encrypted data in cloud computing. In Proceedings of the 29th INFOCOM, pages 441--445. IEEE, 2010.

Digital Library

[9]

N. Cao, C. Wang, M. Li, K. Ren, and W. Lou. Privacy-preserving multi-keyword ranked search over encrypted cloud data. In INFOCOM 2011 Proceedings. IEEE, 2011.

[10]

Q. Chai and G. Gong. Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In ICC 2012 Proceedings, pages 917--922, 2012.

[11]

K. Kurosawa and Y. Ohtaki. Uc-secure searchable symmetric encryption. In FC 2012 Proceedings, pages 285--298. Springer-Verlag, 2012.

[12]

B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In CRYPTO 2001 Proceedings, pages 1--18. Springer-Verlag, 2001.

Digital Library

[13]

S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits. In FOCS 2013 Proceedings, pages 40--49, 2013.

Digital Library

[14]

D. Boneh and M. Zhandry. Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In CRYPTO 2014 Proceedings, pages 480--499. Springer-Verlag, 2014.

[15]

A. Sahai and B. Waters. How to use indistinguishability obfuscation: Deniable encryption, and more. In STOC 2014 Proceedings, pages 475--484, 2014.

Digital Library

[16]

K. Ramchen and B. Waters. Fully secure and fast signing from obfuscation. In ACM CCS 2014.

Digital Library

[17]

S. Hohenberger, A. Sahai, and B. Waters. Replacing a random oracle: full domain hash from indistinguishability obfuscation. In EUROCRYPT 2014 Proceedings, pages 201--220. Springer-Verlag, 2014.

[18]

D. Boneh and B. Waters. Constrained pseudorandom functions and their applications. In AsiaCrypt 2013 Proceedings, pages 1--23. Springer-Verlag, 2013.

[19]

E. Boyle, S. Goldwasser, and I. Ivan. Functional signatures and pseudorandom functions. In PKC 2014 Proceedings, pages 501--519. Springer-Verlag, 2014.

Digital Library

[20]

A. Kiayias, S. Papadopoulos, N. Triandopoulos, and T. Zacharias. Delegatable pseudorandom functions and applications. In ACM CCS 2013 Proceedings, pages 669--684, 2013.

Digital Library

[21]

R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: improved definitions and efficient constructions. In ACM CCS 2006 Proceedings, pages 79--88, 2006.

Digital Library

[22]

S. Kamara and C. Papamanthou. Parallel and dynamic searchable symmetric encryption. In FC 2013 Proceedings, pages 258--274. Springer-Verlag, 2013.

[23]

J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby. Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing, 28, 1999.

Digital Library

[24]

K. Kurosawa and Y. Ohtaki. How to update documents verifiably in searchable symmetric encryption. In CNS Proceedings, pages 309--328, 2013.

Digital Library

Cited By

Zhao CDu RHe KChen JLi JLiu XNing J(2025)Efficient Verifiable Dynamic Searchable Symmetric Encryption With Forward and Backward SecurityIEEE Internet of Things Journal10.1109/JIOT.2024.347077212:3(2633-2645)Online publication date: 1-Feb-2025
https://doi.org/10.1109/JIOT.2024.3470772
Luo ZSun SWang ZGu D(2024)Non-interactive Publicly Verifiable Searchable Encryption with Forward and Backward PrivacyInformation Security and Privacy10.1007/978-981-97-5025-2_15(281-302)Online publication date: 16-Jul-2024
https://doi.org/10.1007/978-981-97-5025-2_15
AlJabri ZAbawajy JHuda S(2023)A Comprehensive Review of Lightweight Authenticated Encryption for IoT DevicesWireless Communications & Mobile Computing10.1155/2023/90719692023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/9071969
Show More Cited By

Index Terms

Verifiable Searchable Symmetric Encryption from Indistinguishability Obfuscation
1. Security and privacy
  1. Network security

Recommendations

Searchable symmetric encryption: improved definitions and efficient constructions
CCS '06: Proceedings of the 13th ACM conference on Computer and communications security
Searchable symmetric encryption (SSE) allows a party to outsource the storage of its data to another party (a server) in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research in ...
Dynamic searchable symmetric encryption
CCS '12: Proceedings of the 2012 ACM conference on Computer and communications security

Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an ...
Deniable Searchable Symmetric Encryption

In the recent years, Searchable Symmetric Encryption (SSE) has become one of the hottest topic in cloud-computing area because of its availability and flexibility, and there are a series of SSE schemes were proposed. The adversary considered in these ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASIA CCS '15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security

April 2015

698 pages

ISBN:9781450332453

DOI:10.1145/2714576

General Chairs:
Feng Bao
Huawei Technologies Pte Ltd, Singapore
,
Steven Miller
Singapore Management University, Singapore
,
Program Chairs:
Jianying Zhou
Institute for Infocomm Research, Singapore
,
Gail-Joon Ahn
Arizona State University, USA

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 April 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Funding Sources

Conference

ASIA CCS '15

Sponsor:

SIGSAC

ASIA CCS '15: 10th ACM Symposium on Information, Computer and Communications Security

April 14 - March 17, 2015

Singapore, Republic of Singapore

Acceptance Rates

ASIA CCS '15 Paper Acceptance Rate 48 of 269 submissions, 18%;

Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
820
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhao CDu RHe KChen JLi JLiu XNing J(2025)Efficient Verifiable Dynamic Searchable Symmetric Encryption With Forward and Backward SecurityIEEE Internet of Things Journal10.1109/JIOT.2024.347077212:3(2633-2645)Online publication date: 1-Feb-2025
https://doi.org/10.1109/JIOT.2024.3470772
Luo ZSun SWang ZGu D(2024)Non-interactive Publicly Verifiable Searchable Encryption with Forward and Backward PrivacyInformation Security and Privacy10.1007/978-981-97-5025-2_15(281-302)Online publication date: 16-Jul-2024
https://doi.org/10.1007/978-981-97-5025-2_15
AlJabri ZAbawajy JHuda S(2023)A Comprehensive Review of Lightweight Authenticated Encryption for IoT DevicesWireless Communications & Mobile Computing10.1155/2023/90719692023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/9071969
Zhao JYu JYuan XLiu JZuo C(2023)Rethinking Practical Blockchain-Based Symmetric Searchable Encryption Services2023 IEEE 22nd International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)10.1109/TrustCom60117.2023.00060(307-317)Online publication date: 1-Nov-2023
https://doi.org/10.1109/TrustCom60117.2023.00060
Chamani JWang YPapadopoulos DZhang MJalili R(2023)Multi-User Dynamic Searchable Symmetric Encryption With Corrupted ParticipantsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.312754620:1(114-130)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TDSC.2021.3127546
Shao JLu RGuan YWei G(2022)Achieve Efficient and Verifiable Conjunctive and Fuzzy Queries over Encrypted Data in CloudIEEE Transactions on Services Computing10.1109/TSC.2019.292437215:1(124-137)Online publication date: 1-Jan-2022
https://doi.org/10.1109/TSC.2019.2924372
Wang BHou YLi M(2022)QuickN: Practical and Secure Nearest Neighbor Search on Encrypted Large-Scale DataIEEE Transactions on Cloud Computing10.1109/TCC.2020.300996110:3(2066-2078)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3009961
Miao YDeng RChoo KLiu XLi H(2022)Threshold Multi-Keyword Search for Cloud-Based Group Data SharingIEEE Transactions on Cloud Computing10.1109/TCC.2020.299977510:3(2146-2162)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.2999775
Sharma D(2022)Searchable encryption : A surveyInformation Security Journal: A Global Perspective10.1080/19393555.2022.203336732:2(76-119)Online publication date: 3-Apr-2022
https://doi.org/10.1080/19393555.2022.2033367
Gan QLiu JWang XYuan XSun SHuang DZuo CWang J(2022)Verifiable searchable symmetric encryption for conjunctive keyword queries in cloud storageFrontiers of Computer Science10.1007/s11704-021-0601-816:6Online publication date: 2-Apr-2022
https://doi.org/10.1007/s11704-021-0601-8
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten