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

A New Definition of Semantic Security for Public-Key Encryption Schemes (Foundations of Computer Science)

Hideaki Sakai, Noriko Nakamura, Yoshihide Igarashi

Published Apr 1, 2000• 0 citations
OpenAlex

Related papers

Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption

Kaibin Huang, Raylin Tso, Yu‐Chi Chen

Journal of Computer and System Sciences•Jun 19, 2017•23 citations

On the Semantic Security of Functional Encryption Schemes

Manuel Barbosa, Pooya Farshim

Lecture notes in computer science•Jan 1, 2013•29 citations

Indistinguishability and semantic security for quantum encryption scheme

Chong Xiang, Li Yang

We investigate the definition of security for encryption scheme in quantum context. We systematically define the indistinguishability and semantic security for quantum public-key and private-key encryption schemes, and for computational security, physical security and information-theoretic security. Based on our definition, we present a necessary and sufficient condition that leads to information-theoretic indistinguishability for quantum encryption scheme. The equivalence between the indistinguishability and semantic security of quantum encryption scheme is also proved.

arXiv:1506.05944•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 29, 2012•7 citations

A model for secure protocols and its application to systematic design of cryptographic protocols

Carsten Rudolph

•Jan 1, 2001•5 citations

Secure Quantum Encryption

Michael St-Jules

To the field of cryptography, quantum mechanics is a game changer. The exploitation of quantum mechanical properties through the manipulation of quantum information, the information encoded in the state of quantum systems, would allow many protocols in use today to be broken as well as lead to the expansion of cryptography to new protocols. In this thesis, quantum encryption, i.e. encryption schemes for quantum data, is defined, along with several definitions of security, broadly divisible into semantic security and ciphertext indistinguishability, which are proven equivalent, in analogy to the foundational result by Goldwasser and Micali. Private- and public-key quantum encryption schemes are also constructed from quantum-secure cryptographic primitives, and their security is proven. Most of the results are in the joint paper Computational Security of Quantum Encryption, to appear in the 9th International Conference on Information Theoretic Security (ICITS2016).

•Jan 1, 2016•1 citation

Semantically Secure Public-Key Cryptosystems Based on the Decoding Problem of Linear Codes

Kazukuni Kobara

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2004•0 citations
We investigate the definition of security for encryption scheme in quantum context. We systematically define the indistinguishability and semantic security for quantum public-key and private-key encryption schemes, and for computational security, physical security and information-theoretic security. Based on our definition, we present a necessary and sufficient condition that leads to information-theoretic indistinguishability for quantum encryption scheme. The equivalence between the indistinguishability and semantic security of quantum encryption scheme is also proved.
To the field of cryptography, quantum mechanics is a game changer. The exploitation of quantum mechanical properties through the manipulation of quantum information, the information encoded in the state of quantum systems, would allow many protocols in use today to be broken as well as lead to the expansion of cryptography to new protocols. In this thesis, quantum encryption, i.e. encryption schemes for quantum data, is defined, along with several definitions of security, broadly divisible into semantic security and ciphertext indistinguishability, which are proven equivalent, in analogy to the foundational result by Goldwasser and Micali. Private- and public-key quantum encryption schemes are also constructed from quantum-secure cryptographic primitives, and their security is proven. Most of the results are in the joint paper Computational Security of Quantum Encryption, to appear in the 9th International Conference on Information Theoretic Security (ICITS2016).