research-article

Multi-Writer Searchable Encryption: An LWE-based Realization and Implementation

Authors:

Xingliang Yuan,

Chungen XuAuthors Info & Claims

Asia CCS '19: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security

Pages 122 - 133

https://doi.org/10.1145/3321705.3329814

Published: 02 July 2019 Publication History

Abstract

Multi-Writer Searchable Encryption, also known as public-key encryption with keyword search(PEKS), serves a wide spectrum of data sharing applications. It allows users to search over encrypted data encrypted via different keys. However, most of the existing PEKS schemes are built on classic security assumptions, which are proven to be untenable to overcome the threats of quantum computers. To address the above problem, in this paper, we propose a lattice-based searchable encryption scheme from the learning with errors (LWE) hardness assumption. Specifically, we observe that the keys of each user in a basic scheme are composed of large-sized matrices and basis of the lattice. To reduce the complexity of key management, our scheme is designed to enable users to directly use their identity for data encryption. We present several optimization techniques for implementation to make our design nearly practical. For completeness, we conduct rigorous security, complexity, and parameter analysis on our scheme, and perform comprehensive evaluations at a commodity machine. With a scenario of 100 users, the cost of key generation for each user is 125s, and the cost of searching a document with 1000 keywords is 13.4ms.

References

[1]

Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, and Haixia Shi. 2008. Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. Journal of Cryptology, Vol. 21, 3 (2008), 350--391.

Digital Library

[2]

Shweta Agrawal, Dan Boneh, and Xavier Boyen. 2010. Efficient Lattice (H)IBE in the Standard Model. Proc. of EUROCRYPT. 553--572.

Digital Library

[3]

Martin R. Albrecht, Rachel Player, and Sam Scott. 2015. On the concrete hardness of Learning with Errors. Journal of Mathematical Cryptology, Vol. 9, 3 (2015), 169--203.

[4]

Joë l Alwen and Chris Peikert. 2011. Generating Shorter Bases for Hard Random Lattices. Theory Computing System, Vol. 48, 3 (2011), 535--553.

Digital Library

[5]

Daniela Becker, Jorge Guajardo, and Karl-Heinz Zimmermann. 2018. Revisiting Private Stream Aggregation: Lattice-Based PSA. In Proc. of NDSS .

[6]

Rouzbeh Behnia, Muslum Ozgur Ozmen, and Attila Altay Yavuz. 2018. Lattice-Based Public Key Searchable Encryption from Experimental Perspectives. IEEE Trans. on Dependable and Secure Computing (2018).

[7]

Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. 2004. Public Key Encryption with Keyword Search. In Proc. of EUROCRYPT. 506--522.

[8]

Dan Boneh and Brent Waters. 2007. Conjunctive, Subset, and Range Queries on Encrypted Data. In Proc. of TCC. 535--554.

Digital Library

[9]

Ahmad Boorghany and Rasool Jalili. 2014. Implementation and Comparison of Lattice-based Identification Protocols on Smart Cards and Microcontrollers. IACR Cryptology ePrint Archive (2014), 78.

[10]

David Cash, Dennis Hofheinz, and Eike Kiltz. 2009. How to Delegate a Lattice Basis. IACR Cryptology ePrint Archive, Vol. 2009 (2009), 351.

[11]

David Cash, Dennis Hofheinz, Eike Kiltz, and Chris Peikert. 2012. Bonsai Trees, or How to Delegate a Lattice Basis. Journal of Cryptology, Vol. 25, 4 (2012), 601--639.

Digital Library

[12]

Reza Curtmola, Juan Garay, Seny Kamara, and Rafail Ostrovsky. 2011. Searchable symmetric encryption: improved definitions and efficient constructions. Journal of Computer Security, Vol. 19, 5 (2011), 895--934.

[13]

Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. 2008. Trapdoors for Hard Lattices and New Cryptographic Constructions. In Proc. of STOC. 197--206.

Digital Library

[14]

Philippe Golle, Jessica Staddon, and Brent R. Waters. 2004. Secure Conjunctive Keyword Search over Encrypted Data. In Proc. of ACNS. 31--45.

[15]

Jeffrey Hoffstein, Jill Pipher, and Joseph H Silverman. 2001. NSS: An NTRU Lattice-Based Signature Scheme. In Proc. of EUROCRYPT. 211--228.

Digital Library

[16]

Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. 2013. Outsourced symmetric private information retrieval. In Proc. of ACM CCS. 875--888.

Digital Library

[17]

Jonathan Katz and Vinod Vaikuntanathan. 2009. Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. In Proc. of Asiacrypt. 636--652.

Digital Library

[18]

Elena Kirshanova. 2014. Proxy Re-encryption from Lattices. In Proc. of PKC. 77--94.

Digital Library

[19]

Shangqi Lai, Sikhar Patranabis, Amin Sakzad, Joseph K. Liu, Debdeep Mukhopadhyay, Ron Steinfeld, Shifeng Sun, Dongxi Liu, and Cong Zuo. 2018. Result Pattern Hiding Searchable Encryption for Conjunctive Queries. In Proc. ACM CCS. 745--762.

Digital Library

[20]

Adeline Langlois and Damien Stehlé. 2015. Worst-case to Average-case Reductions for Module Lattices. Design Codes Cryptography, Vol. 75, 3 (2015), 565--599.

Digital Library

[21]

Richard Lindner and Chris Peikert. 2011. Better Key Sizes (and Attacks) for LWE-Based Encryption. In Proc. of CT-RSA. 319--339.

Digital Library

[22]

Zhe Liu, Reza Azarderakhsh, Howon Kim, and Hwajeong Seo. 2017. Efficient Software Implementation of Ring-LWE Encryption on IoT Processors. IEEE Trans. on Computers, Vol. PP, 99 (2017), 1--1.

[23]

Vadim Lyubashevsky. 2012. Lattice Signatures without Trapdoors. In Proc. of Asiacrypt. 738--755.

Digital Library

[24]

Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2013. On Ideal Lattices and Learning with Errors over Rings. Journal of ACM, Vol. 60, 6 (2013), 43:1--43:35.

Digital Library

[25]

Daniele Micciancio and Oded Regev. 2013. Lattice-based Cryptography. Lecture Notes in Computer Science, Vol. 4117, 1--2 (2013), 131--141.

[26]

T Monz, D Nigg, E. A. Martinez, M. F. Brandl, P Schindler, R Rines, S. X. Wang, I. L. Chuang, and R Blatt. 2016. Realization of a scalable Shor Algorithm. Science, Vol. 351, 6277 (2016), 1068--1070.

[27]

Chris Peikert et almbox. 2016. A decade of lattice cryptography. Foundations and Trends® in Theoretical Computer Science, Vol. 10, 4 (2016), 283--424.

Digital Library

[28]

Oded Regev. 2006. Lattice-Based Cryptography .Springer Berlin Heidelberg. 131--141 pages.

Digital Library

[29]

Oded Regev. 2009. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Journal of ACM, Vol. 56, 6 (2009), 34:1--34:40.

Digital Library

[30]

Cé dric Van Rompay, Refik Molva, and Melek Ö nen. 2018. Secure and Scalable Multi-User Searchable Encryption. In Proc. of SCC@AsiaCCS 2018. 15--25.

Digital Library

[31]

Tateaki Sasaki and Hirokazu Murao. 1982. Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems. ACM Trans. on Mathematical Software, Vol. 8, 3 (1982), 277--289.

Digital Library

[32]

Elaine Shi, John Bethencourt, Hubert T.-H. Chan, Dawn Xiaodong Song, and Adrian Perrig. 2007. Multi-Dimensional Range Query over Encrypted Data. Proc. of IEEE S&P. 350--364.

Digital Library

[33]

Peter W. Shor. 1994. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proc. of IEEE FOCS. 124--134.

Digital Library

[34]

Shifeng Sun, Joseph K. Liu, Amin Sakzad, Ron Steinfeld, and Tsz Hon Yuen. 2016. An Efficient Non-interactive Multi-client Searchable Encryption with Support for Boolean Queries. In Computer Security - ESORICS 2016 - 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26--30, 2016, Proceedings, Part I. 154--172.

[35]

Shifeng Sun, Xingliang Yuan, Joseph K. Liu, Ron Steinfeld, Amin Sakzad, Viet Vo, and Surya Nepal. 2018. Practical Backward-Secure Searchable Encryption from Symmetric Puncturable Encryption. In Proc. of the ACM CCS. 763--780.

Digital Library

[36]

Brent Waters. 2005. Efficient Identity-Based Encryption Without Random Oracles. In Proc. of EUROCRYPT. 114--127.

Digital Library

[37]

Brent R Waters, Dirk Balfanz, Glenn Durfee, and Diana K Smetters. 2004. Building an Encrypted and Searchable Audit Log. In Proc. of NDSS .

[38]

Lei Xu, Shifeng Sun, Xingliang Yuan, Joseph K Liu, Cong Zuo, and Chungen Xu. 2019. Enabling Authorized Encrypted Search for Multi-Authority Medical Databases. IEEE Transactions on Emerging Topics in Computing (2019).

Cited By

Shinoki HSato HYoshino M(2025)Simple Construction of PEKS from LWE-Based IBE in the Standard ModelProvable and Practical Security10.1007/978-981-96-0954-3_9(168-186)Online publication date: 1-Feb-2025
https://doi.org/10.1007/978-981-96-0954-3_9
Zheng YZhang WSong WWang XFu C(2024)Encrypted Video Search with Single/Multiple WritersACM Transactions on Multimedia Computing, Communications, and Applications10.1145/3643887Online publication date: 5-Feb-2024
https://doi.org/10.1145/3643887
Xu SCao YChen XGuo YYang YGuo FYiu SSerra ESpezzano F(2024)Post-Quantum Searchable Encryption Supporting User-Authorization for Outsourced Data ManagementProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679522(2702-2711)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679522
Show More Cited By

Multi-Writer Searchable Encryption: An LWE-based Realization and Implementation
1. Security and privacy
  1. Cryptography
    1. Public key (asymmetric) techniques

Recommendations

Multi-keyword ranked searchable public-key encryption

Most related works on Public-Key Encryption with Keyword Search scheme also called Searchable Public-key Encryption focus on single keyword search. Some works supporting multi-keyword search cannot provide search result ranking. In this paper, we study ...
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 ...
Decryptable searchable encryption
ProvSec'07: Proceedings of the 1st international conference on Provable security

As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces searchable encryption schemes which enable decryption. An ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Asia CCS '19: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security

July 2019

708 pages

ISBN:9781450367523

DOI:10.1145/3321705

General Chairs:
Steven Galbraith
University of Auckland, New Zealand
,
Giovanni Russello
University of Auckland, New Zealand
,
Willy Susilo
University of Wollongong, Australia
,
Program Chairs:
Dieter Gollmann
Hamburg University of Technology, Germany & Nanyang Technological University, Singapore
,
Engin Kirda
Northeastern University, USA
,
Zhenkai Liang
National University of Singapore, Singapore

Copyright © 2019 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: 02 July 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

Asia CCS '19

Sponsor:

SIGSAC

Asia CCS '19: ACM Asia Conference on Computer and Communications Security

July 9 - 12, 2019

Auckland, New Zealand

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
639
Total Downloads

Downloads (Last 12 months)63
Downloads (Last 6 weeks)3

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Shinoki HSato HYoshino M(2025)Simple Construction of PEKS from LWE-Based IBE in the Standard ModelProvable and Practical Security10.1007/978-981-96-0954-3_9(168-186)Online publication date: 1-Feb-2025
https://doi.org/10.1007/978-981-96-0954-3_9
Zheng YZhang WSong WWang XFu C(2024)Encrypted Video Search with Single/Multiple WritersACM Transactions on Multimedia Computing, Communications, and Applications10.1145/3643887Online publication date: 5-Feb-2024
https://doi.org/10.1145/3643887
Xu SCao YChen XGuo YYang YGuo FYiu SSerra ESpezzano F(2024)Post-Quantum Searchable Encryption Supporting User-Authorization for Outsourced Data ManagementProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679522(2702-2711)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679522
Huang CLiu DYang ALu RShen X(2024)Multi-Client Secure and Efficient DPF-Based Keyword Search for Cloud StorageIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.325378621:1(353-371)Online publication date: Jan-2024
https://doi.org/10.1109/TDSC.2023.3253786
Li YXu CXu LMei LZhu Y(2024)Verifiable Searchable Encryption Scheme with Flexible Access Control in the CloudJournal of Parallel and Distributed Computing10.1016/j.jpdc.2024.105025(105025)Online publication date: Dec-2024
https://doi.org/10.1016/j.jpdc.2024.105025
Tseng Y(2024)Attribute hiding subset predicate encryption: Quantum-resistant construction with efficient decryptionComputer Standards & Interfaces10.1016/j.csi.2023.10379688(103796)Online publication date: Mar-2024
https://doi.org/10.1016/j.csi.2023.103796
Qi LZhuang J(2024)RLWE-based public key searchable encryption: securer, faster, and lower end-to-end delay for cloud computingThe Journal of Supercomputing10.1007/s11227-023-05574-980:2(2767-2798)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s11227-023-05574-9
Zhu YZhou DLi YSong BWang C(2023)How Can We Achieve Query Keyword Frequency Analysis in Privacy-Preserving Situations?Future Internet10.3390/fi1506019715:6(197)Online publication date: 29-May-2023
https://doi.org/10.3390/fi15060197
Fan QHe DChen JPeng CWang L(2023)Isoga: An Isogeny-Based Quantum-Resist Searchable Encryption Scheme Against Keyword Guessing AttacksIEEE Systems Journal10.1109/JSYST.2022.318278817:2(2101-2112)Online publication date: Jun-2023
https://doi.org/10.1109/JSYST.2022.3182788
Wang JLiu D(2023)Poster: Multi-Writer Searchable Encryption with Fast Search and Post-Quantum Security2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00143(1-2)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00143
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