ML p(r)ior | Computational Security of Quantum Encryption

Computational Security of Quantum Encryption

2016-02-03
Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes against quantum attacks. In this work, we initiate the study of another relevant topic: the encryption of quantum data in the computational setting. In this direction, we establish quantum versions of several fundamental classical results. First, we develop natural definitions for private-key and public-key encryption schemes for quantum data. We then define notions of semantic security and indistinguishability, and, in analogy with the classical work of Goldwasser and Micali, show that these notions are equivalent. Finally, we construct secure quantum encryption schemes from basic primitives. In particular, we show that quantum-secure one-way functions imply IND-CCA1-secure symmetric-key quantum encryption, and that quantum-secure trapdoor one-way permutations imply semantically-secure public-key quantum encryption.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2019-05-14

Non-malleability is an important security property for public-key encryption (PKE). Its significance… show more
PDF

Highlights - Most important sentences from the article

2019-02-23
1902.08709 | quant-ph

This work contains two major parts: comprehensively studying the security notions of cryptographic h… show more
PDF

Highlights - Most important sentences from the article

2017-04-27

Blind delegation protocols allow a client to delegate a computation to a server so that the server l… show more
PDF

Highlights - Most important sentences from the article

2017-09-19

We study the problem of encrypting and authenticating quantum data in the presence of adversaries ma… show more
PDF

Highlights - Most important sentences from the article

2019-04-25

Game-playing proofs constitute a powerful framework for classical cryptographic security arguments, … show more
PDF

Highlights - Most important sentences from the article

2018-03-10

Formulating and designing unforgeable authentication of classical messages in the presence of quantu… show more
PDF

Highlights - Most important sentences from the article

2019-04-12

The functionality of classically-instructed remotely prepared random secret qubits was introduced in… show more
PDF

Highlights - Most important sentences from the article

2018-12-05

We revisit the notion of deniability in quantum key exchange (QKE), a topic that remains largely une… show more
PDF

Highlights - Most important sentences from the article

2018-04-02

We give a protocol for producing certifiable randomness from a single untrusted quantum device that … show more
PDF

Highlights - Most important sentences from the article

2019-04-04

We investigate quantum algorithms for classification, a fundamental problem in machine learning, wit… show more
PDF

Highlights - Most important sentences from the article

2019-03-07

In this paper we study the quantum learnability of constant-depth classical circuits under the unifo… show more
PDF

Highlights - Most important sentences from the article

2018-10-11
1810.05234 | quant-ph

In this paper, we construct a new scheme for delegating a large circuit family, which we call "C+P c… show more
PDF

Highlights - Most important sentences from the article

2018-01-11
1801.03656 | cs.IT

The famous Shannon impossibility result says that any encryption scheme with perfect secrecy require… show more
PDF

Highlights - Most important sentences from the article

2019-02-20

The famous Fiat-Shamir transformation turns any public-coin three-round interactive proof, i.e., any… show more
PDF

Highlights - Most important sentences from the article

2014-12-29
1412.8356 | cs.CR

Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usu… show more
PDF

Highlights - Most important sentences from the article

2017-04-29
1705.00139 | quant-ph

Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted… show more
PDF

Highlights - Most important sentences from the article