Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Post-quantum Multi-client Conjunctive Searchable Symmetric Encryption from Isogenies

Sikhar Patranabis

Published Dec 9, 2024• 2 citations
Publisher
DOI
10.1007/978-3-031-80408-3_15

Related papers

An Efficient Quantum Somewhat Homomorphic Symmetric Searchable Encryption

Xiaoqiang Sun, Ting Wang, Zhiwei Sun +3 more

International Journal of Theoretical Physics•Jan 12, 2017•19 citations

Post-Quantum Encryption Scheme with Supersingular Isogenies

Nikita Lyashenko, Kristina Rysyatova, Lydia Chemerigina +4 more

Lecture notes in networks and systems•Oct 30, 2021•2 citations

Post-Quantum Public-Key Authenticated Searchable Encryption with Forward Security: General Construction, and Applications

Shiyuan Xu, Yibo Cao, Xue Chen +2 more

Lecture notes in computer science•Jan 1, 2024•23 citations

Towards Post-Quantum Key-Updatable Public-Key Encryption via Supersingular Isogenies

Edward Eaton, David Jao, Chelsea Komlo +1 more

Lecture notes in computer science•Jan 1, 2022•13 citations

Towards Post-Quantum Updatable Public-Key Encryption via Supersingular Isogenies.

Edward Eaton, David Jao, Chelsea Komlo

•Jan 1, 2020•1 citation

Conjunctive Searchable Symmetric Encryption from Hard Lattices

Debadrita Talapatra, Sikhar Patranabis, Debdeep Mukhopadhyay

Searchable Symmetric Encryption (SSE) supports efficient keyword searches over encrypted outsourced document collections while minimizing information leakage. All practically efficient SSE schemes supporting conjunctive queries rely crucially on quantum-broken cryptographic assumptions (such as discrete-log hard groups) to achieve compact storage and fast query processing. On the other hand, quantum-safe SSE schemes based on purely symmetric-key cryptoprimitives either do not support conjunctive searches, or are practically inefficient. In particular, there exists no quantum-safe yet practically efficient conjunctive SSE scheme from lattice-based hardness assumptions.We solve this open question by proposing Oblivious Post-Quantum Secure Cross Tags (OQXT) – the first lattice-based practically efficient and highly scalable conjunctive SSE scheme. The technical centerpiece of OQXT is a novel oblivious cross-tag generation protocol with provable security guarantees derived from lattice-based hardness assumptions. We prove the post-quantum simulation security of OQXT with respect to a rigorously defined and thoroughly analyzed leakage profile. We then present a prototype implementation of OQXT and experimentally validate its practical efficiency and scalability over extremely large real-world databases. Our experiments show that OQXT has competitive end-to-end search latency when compared with the best (quantum-broken) conjunctive SSE schemes.

IEEE European Symposium on Security and Privacy•Jul 1, 2023•11 citations
Searchable Symmetric Encryption (SSE) supports efficient keyword searches over encrypted outsourced document collections while minimizing information leakage. All practically efficient SSE schemes supporting conjunctive queries rely crucially on quantum-broken cryptographic assumptions (such as discrete-log hard groups) to achieve compact storage and fast query processing. On the other hand, quantum-safe SSE schemes based on purely symmetric-key cryptoprimitives either do not support conjunctive searches, or are practically inefficient. In particular, there exists no quantum-safe yet practically efficient conjunctive SSE scheme from lattice-based hardness assumptions.We solve this open question by proposing Oblivious Post-Quantum Secure Cross Tags (OQXT) – the first lattice-based practically efficient and highly scalable conjunctive SSE scheme. The technical centerpiece of OQXT is a novel oblivious cross-tag generation protocol with provable security guarantees derived from lattice-based hardness assumptions. We prove the post-quantum simulation security of OQXT with respect to a rigorously defined and thoroughly analyzed leakage profile. We then present a prototype implementation of OQXT and experimentally validate its practical efficiency and scalability over extremely large real-world databases. Our experiments show that OQXT has competitive end-to-end search latency when compared with the best (quantum-broken) conjunctive SSE schemes.