# Non-malleability for quantum public-key encryption

@article{Majenz2019NonmalleabilityFQ, title={Non-malleability for quantum public-key encryption}, author={Christian Majenz and Christian Schaffner and Jeroen van Wier}, journal={IACR Cryptol. ePrint Arch.}, year={2019}, volume={2019}, pages={496} }

Non-malleability is an important security property for public-key encryption (PKE). Its significance is due to the fundamental unachievability of integrity and authenticity guarantees in this setting, rendering it the strongest integrity-like property achievable using only PKE, without digital signatures. In this work, we generalize this notion to the setting of quantum public-key encryption. Overcoming the notorious "recording barrier" known from generalizing other integrity-like security…

## One Citation

### Weak approximate unitary designs and applications to quantum encryption

- MathematicsQuantum
- 2020

This work gives a partially derandomized construction of a quantum encryption scheme that has roughly the same key size and security as the quantum one-time pad, but possesses the additional property of being non-malleable against adversaries without quantum side information.

## References

SHOWING 1-10 OF 23 REFERENCES

### Quantum Non-malleability and Authentication

- Computer Science, MathematicsCRYPTO
- 2017

It is proved that quantum non-malleability implies secrecy; this is in stark contrast to the classical setting, where the two properties are completely independent.

### Nonmalleable Cryptography

- Computer Science, MathematicsSIAM Rev.
- 2000

The cryptosystem is the first proven to be secure against a strong type of chosen ciphertext attack proposed by Rackoff and Simon, in which the attacker knows the ciphertext she wishes to break and can query the decryption oracle on any ciphertext other than the target.

### Computational Security of Quantum Encryption

- Computer Science, MathematicsICITS
- 2016

This work develops natural definitions for private-key and public-key encryption schemes for quantum data and defines notions of semantic security and indistinguishability, and constructs secure quantum encryption schemes from basic primitives.

### Unforgeable Quantum Encryption

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2017

The problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries is studied, and a new definition of one-time quantum authentication is given which authenticates ciphertexts rather than plaintexts.

### Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization

- Mathematics, Computer ScienceCRYPTO
- 1999

It is shown that non-malleability is equivalent to indistinguishability under a "parallel chosen ciphertext attack," this being a new kind of chosen cipher Text attack, in which the adversary's decryption queries are not allowed to depend on answers to previous queries, but must be made all at once.

### New Security Notions and Feasibility Results for Authentication of Quantum Data

- Computer ScienceCRYPTO
- 2017

We give a new class of security definitions for authentication in the quantum setting. These definitions capture and strengthen existing definitions of security against quantum adversaries for both…

### Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity

- Mathematics, Computer ScienceCRYPTO
- 2015

This work formally defines and gives schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only.

### Quantum-Secure Message Authentication Codes

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2012

The first Message Authentication Codes that are existentially unforgeable against a quantum chosen message attack are constructed and it is proved that a four-wise independent family is sufficient for one-time security.

### Quantum-secure message authentication via blind-unforgeability

- Computer ScienceIACR Cryptol. ePrint Arch.
- 2018

This work uncovers serious shortcomings in existing approaches to blind-unforgeability, and proposes a new definition, which coincides with standard unpredictability (EUF-CMA) in the classical-query setting, and shows that quantum-secure pseudorandom functions are BU-secure MACs.

### Nonmalleable encryption of quantum information

- Computer Science, Mathematics
- 2009

We introduce the notion of nonmalleability of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we…