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

Springer eBooks

Public-key Encryption

Jiang Zhang, Zhenfeng Zhang

Published Jan 1, 2020• 1 citation
Publisher
DOI
10.1007/978-981-15-8427-5_3

Related papers

Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond

Giuseppe Persiano, Duong Hieu Phan, Moti M. Yung

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

Symmetric Public-Key Encryption

Zvi Galil, Stuart Haber, Moti M. Yung

Springer eBooks•Feb 28, 2007•26 citations

Lattice-based public key encryption with equality test supporting flexible authorization in standard model

Dung Hoang Duong, Kazuhide Fukushima, Shinsaku Kiyomoto +3 more

Public key encryption with equality test (PKEET) supports to check whether two ciphertexts encrypted under different public keys contain the same message or not. PKEET has many interesting applications such as keyword search on encrypted data, encrypted data partitioning for efficient encrypted data management, personal health record systems, spam filtering in encrypted email systems and so on. However, the PKEET scheme lacks an authorization mechanism for a user to control the comparison of its ciphertexts with others. In 2015, Ma et al. introduce the notion of PKEET with flexible authorization (PKEET-FA) which strengthens privacy protection. Since 2015, there are several follow-up works on PKEET-FA. But, all are secure in the random-oracle model. Moreover, all are vulnerable to quantum attacks. In this paper, we provide three constructions of quantum-safe PKEET-FA secure in the standard model. Proposed constructions are secure based on the hardness assumptions of integer lattices and ideal lattices. Finally, we implement the PKEET-FA scheme over ideal lattices.

arXiv:2005.05308•May 9, 2020•0 citations

Building Key-Private Public-Key Encryption Schemes

Kenneth G. Paterson, Sriramkrishnan Srinivasan

Lecture notes in computer science•Jan 1, 2009•12 citations

A complete classification of quantum public-key encryption protocols

Chenmiao Wu, Li Yang

We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research on quantum public-key encryption protocol should be focus on the existed kinds and the unproposed kinds.

arXiv:1507.03765•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 13, 2015•7 citations

A Simple Construction of Quantum Public-Key Encryption from Quantum-Secure One-Way Functions

Khashayar Barooti, Giulio Malavolta, Michael Walter

Quantum public-key encryption [Gottesman; Kawachi et al., Eurocrypt'05] generalizes public-key encryption (PKE) by allowing the public keys to be quantum states. Prior work indicated that quantum PKE can be constructed from assumptions that are potentially weaker than those needed to realize its classical counterpart. In this work, we show that quantum PKE can be constructed from any quantum-secure one-way function. In contrast, classical PKE is believed to require more structured assumptions. Our construction is simple, uses only classical ciphertexts, and satisfies the strong notion of CCA security.

arXiv:2303.01143•Mar 2, 2023•1 citation
Public key encryption with equality test (PKEET) supports to check whether two ciphertexts encrypted under different public keys contain the same message or not. PKEET has many interesting applications such as keyword search on encrypted data, encrypted data partitioning for efficient encrypted data management, personal health record systems, spam filtering in encrypted email systems and so on. However, the PKEET scheme lacks an authorization mechanism for a user to control the comparison of its ciphertexts with others. In 2015, Ma et al. introduce the notion of PKEET with flexible authorization (PKEET-FA) which strengthens privacy protection. Since 2015, there are several follow-up works on PKEET-FA. But, all are secure in the random-oracle model. Moreover, all are vulnerable to quantum attacks. In this paper, we provide three constructions of quantum-safe PKEET-FA secure in the standard model. Proposed constructions are secure based on the hardness assumptions of integer lattices and ideal lattices. Finally, we implement the PKEET-FA scheme over ideal lattices.
We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research on quantum public-key encryption protocol should be focus on the existed kinds and the unproposed kinds.
Quantum public-key encryption [Gottesman; Kawachi et al., Eurocrypt'05] generalizes public-key encryption (PKE) by allowing the public keys to be quantum states. Prior work indicated that quantum PKE can be constructed from assumptions that are potentially weaker than those needed to realize its classical counterpart. In this work, we show that quantum PKE can be constructed from any quantum-secure one-way function. In contrast, classical PKE is believed to require more structured assumptions. Our construction is simple, uses only classical ciphertexts, and satisfies the strong notion of CCA security.