# Composably secure device-independent encryption with certified deletion.

@article{Kundu2020ComposablySD, title={Composably secure device-independent encryption with certified deletion.}, author={Srijita Kundu and Ernest Y.-Z. Tan}, journal={arXiv: Quantum Physics}, year={2020} }

We study the task of encryption with certified deletion (ECD) introduced by Broadbent and Islam (2019), but in a device-independent setting: we show that it is possible to achieve this task even when the honest parties do not trust their quantum devices. Moreover, we define security for the ECD task in a composable manner and show that our ECD protocol satisfies conditions that lead to composable security. Our protocol is based on device-independent quantum key distribution (DIQKD), and in…

## 5 Citations

### Quantum Encryption with Certified Deletion: Public Key and Attribute-Based

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

A (reusable-key) public key encryption (PKE) and attribute-based encryption (ABE) with certified deletion is constructed assuming the existence of indistinguishability obfuscation and one-way function.

### Certified Everlasting Functional Encryption

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

For the construction of certified everlasting FE, this paper introduces and construct certified everlasting versions of secret- key encryption, public-key encryption, receiver non-committing encryption, and a garbling scheme, which are of independent interest.

### Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

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

This work presents various constructions of encryption with certified deletion, a major update version of the paper by Nishimaki and Yamakawa with many new results.

### Cryptography with Certified Deletion

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

A new, unifying framework that yields an array of cryptographic primitives that enable a party in possession of a quantum ciphertext to generate a classical certiﬁcate that the encrypted plaintext has been information-theoretically deleted, and cannot be recovered even given unbounded computational resources is proposed.

### A direct product theorem for quantum communication complexity with applications to device-independent QKD

- Computer Science, Mathematics2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
- 2022

It is shown that it is possible to do device-independent quantum key distribution (DIQKD) without the assumption that devices do not leak any information after inputs are provided to them, and a direct product theorem is given for two-input functions or relations whose outputs are non-boolean as well.

## References

SHOWING 1-10 OF 31 REFERENCES

### Quantum encryption with certified deletion

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

It is shown that it is possible to encrypt classical data into a quantum ciphertext such that the recipient of the ciphertext can produce a classical string which proves to the originator that the recipients has relinquished any chance of recovering the plaintext should the decryption key be revealed.

### Device-independent bit commitment based on the CHSH inequality

- Computer Science
- 2015

This work presents a device-independent bit commitment protocol based on CHSH testing, which achieves the same security as the optimal GHZ-based protocol, albeit at the price of fixing the time at which Alice reveals her commitment.

### The Universal Composable Security of Quantum Key Distribution

- Computer Science, MathematicsTCC
- 2005

A universal composability theorem for the quantum setting is derived that shows that keys generated by repeated runs of QKD degrade slowly and can indeed be safely used, a property ofQKD that is hitherto unproven.

### Composable security in relativistic quantum cryptography

- Computer Science, MathematicsNew Journal of Physics
- 2019

A framework for performing such a modular security analysis of classical and quantum cryptographic schemes in Minkowski space is introduced and implies in particular the non-composability of existing relativistic bit commitment and coin flipping protocols.

### Device-independent quantum key distribution secure against collective attacks

- Computer Science
- 2009

This proof exploits the full structure of quantum theory, but only holds against collective attacks, where the eavesdropper is assumed to act on the quantum systems of the honest parties independently and identically in each round of the protocol.

### Parallel Device-Independent Quantum Key Distribution

- Computer ScienceIEEE Transactions on Information Theory
- 2020

This work proves the security of a protocol where all games are executed in parallel, the first parallel security proof for a fully device-independent QKD protocol that tolerates a constant level of device imprecision and achieves a linear key rate.

### Fully distrustful quantum bit commitment and coin flipping.

- Computer Science, MathematicsPhysical review letters
- 2011

It is shown that for bit commitment, one of the most basic primitives within the model-the answer is positive, and the aim of the device-independent approach to cryptography is to do away with the latter assumption, and significantly increase security.

### Revocable Quantum Timed-Release Encryption

- Computer Science, MathematicsJ. ACM
- 2013

It is shown that revocable timed-release encryption without trusted parties is possible using quantum cryptography (while trivially impossible classically) and two proof techniques in the quantum random oracle model are developed.

### Practical device-independent quantum cryptography via entropy accumulation

- Computer ScienceNature Communications
- 2017

A property of entropy, termed “entropy accumulation”, is presented, which asserts that the total amount of entropy of a large system is the sum of its parts, which is used to prove the security of cryptographic protocols, including device-independent quantum key distribution, while achieving essentially optimal parameters.

### A largely self-contained and complete security proof for quantum key distribution

- Computer Science, Mathematics
- 2015

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and…