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

International Journal of Theoretical Physics

An Efficient Quantum Somewhat Homomorphic Symmetric Searchable Encryption

Xiaoqiang Sun, Ting Wang, Zhiwei Sun, Ping Wang, Jianping Yu, Weixin Xie

Published Jan 12, 2017• 19 citations
Publisher
DOI
10.1007/s10773-017-3275-0

Related papers

Symmetric quantum fully homomorphic encryption with perfect security

Min Liang

arXiv:1304.5087•Quantum Information Processing•Aug 23, 2013•85 citations

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

Sikhar Patranabis

Lecture notes in computer science•Dec 9, 2024•2 citations

Efficient quantum fully homomorphic encryption scheme based on the quantum circuit

Zhenzhen Li, Ming-Kui Liu, Jun Xu +2 more

Quantum Information Processing•Jun 9, 2026•0 citations

Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation

Jiang Liu, Qin Li, Junyu Quan +3 more

Designs Codes and Cryptography•Jan 8, 2022•27 citations

On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols

Nirattaya Khamsemanan, Rafail Ostrovsky, William E. Skeith

In this work, we develop a methodology for determining the communication required to implement various two-party functionalities noninteractively. In the particular setting on which we focus, the protocols are based upon somewhat homomorphic encryption, and furthermore, they treat the homomorphic properties as a black box. In this setting, we develop lower bounds which give a smooth trade-off between the communication complexity and the “expressiveness” of the cryptosystem---the latter being measured in terms of the depth of the arithmetic circuits that can be evaluated on ciphertext. Given the current state of the art in homomorphic encryption, this trade-off may also be viewed as one between communication and computation, since at present, more expressive cryptosystems are markedly less efficient. We then apply this methodology to place lower bounds on a number of cryptographic protocols including private information retrieval writing and private keyword search. Our work provides a useful “litmus test” of feasibility for use by other cryptographic researchers attempting to develop new protocols that use somewhat homomorphic encryption in a black-box way and require certain levels of communication efficiency. We also answer an open question from the thesis of Doerte K. Rappe [Homomorphic Cryptosystems and Their Applications, Universität Dortmund, Germany, 2006] regarding the construction of fully homomorphic encryption from group homomorphic encryption.

SIAM Journal on Discrete Mathematics•Jan 1, 2016•4 citations

Quantum Homomorphic Encryption

Tao Shang

Springer eBooks•Oct 15, 2024•0 citations
In this work, we develop a methodology for determining the communication required to implement various two-party functionalities noninteractively. In the particular setting on which we focus, the protocols are based upon somewhat homomorphic encryption, and furthermore, they treat the homomorphic properties as a black box. In this setting, we develop lower bounds which give a smooth trade-off between the communication complexity and the “expressiveness” of the cryptosystem---the latter being measured in terms of the depth of the arithmetic circuits that can be evaluated on ciphertext. Given the current state of the art in homomorphic encryption, this trade-off may also be viewed as one between communication and computation, since at present, more expressive cryptosystems are markedly less efficient. We then apply this methodology to place lower bounds on a number of cryptographic protocols including private information retrieval writing and private keyword search. Our work provides a useful “litmus test” of feasibility for use by other cryptographic researchers attempting to develop new protocols that use somewhat homomorphic encryption in a black-box way and require certain levels of communication efficiency. We also answer an open question from the thesis of Doerte K. Rappe [Homomorphic Cryptosystems and Their Applications, Universität Dortmund, Germany, 2006] regarding the construction of fully homomorphic encryption from group homomorphic encryption.