English
Related papers

Related papers: Uncloneable Decryptors from Quantum Copy-Protectio…

200 papers

We investigate the notion of untelegraphable encryption (UTE), a quantum encryption primitive that is a special case of uncloneable encryption (UE), where the adversary's capabilities are restricted to producing purely classical information…

Quantum Physics · Physics 2025-10-02 Anne Broadbent , Eric Culf , Denis Rochette

Quantum cryptography is a rapidly-developing area which leverages quantum information to accomplish classically-impossible tasks. In many of these protocols, quantum states are used as long-term cryptographic keys. Typically, this is to…

Quantum Physics · Physics 2025-11-07 Omri Shmueli , Mark Zhandry

Recently, Yamaguchi and Kempf [Phys. Rev. Lett. 136:010801, arXiv:2501.02757] proved that encrypted qubits can be cloned. In this work, we generalize the encrypted cloning protocol and prove that it also applies to higher-order quantum…

Quantum Physics · Physics 2026-04-07 Filip-Ioan Ceară

Physical Unclonable Functions evaluate manufacturing variations to generate secure cryptographic keys for embedded systems without secure key storage. It is explained how methods from coding theory are applied in order to ensure reliable…

Information Theory · Computer Science 2015-01-28 Sven Puchinger , Sven Müelich , Martin Bossert , Matthias Hiller , Georg Sigl

Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…

Quantum Physics · Physics 2015-08-03 Muhammad Nadeem

Much of the strength of quantum cryptography may be attributed to the no-cloning property of quantum information. We construct three new cryptographic primitives whose security is based on uncloneability, and that have in common that their…

Quantum Physics · Physics 2023-03-02 Anne Broadbent , Eric Culf

A well-known feature of quantum information is that it cannot, in general, be cloned. Recently, a number of quantum-enabled information-processing tasks have demonstrated various forms of uncloneability; among these forms, piracy is an…

Quantum Physics · Physics 2024-10-04 Anne Broadbent , Alex B. Grilo , Supartha Podder , Jamie Sikora

A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical…

Quantum Physics · Physics 2007-05-23 Guihua Zeng , Carlos Saavedra , Christoph H. Keitel

Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum…

Quantum Physics · Physics 2024-10-22 Barak Nehoran , Mark Zhandry

All existing quantum cryptosystems use non-orthogonal states as the carriers of information. Non-orthogonal states cannot be cloned (duplicated) by an eavesdropper. In result, any eavesdropping attempt must introduce errors in the…

Quantum Physics · Physics 2016-09-08 Lior Goldenberg , Lev Vaidman

The famous no-cloning principle has been shown recently to enable a number of uncloneable functionalities. Here we address for the first time unkeyed quantum uncloneablity, via the study of a complexity-theoretic tool that enables a…

Quantum Physics · Physics 2024-10-14 Anne Broadbent , Martti Karvonen , Sébastien Lord

We propose the first continuous-variable (CV) unclonable encryption scheme, extending the paradigm of quantum encryption of classical messages (QECM) to CV systems. In our construction, a classical message is first encrypted classically and…

Quantum Physics · Physics 2025-12-19 Arpan Akash Ray , Boris Škorić

Computational security in cryptography has a risk that computational assumptions underlying the security are broken in the future. One solution is to construct information-theoretically-secure protocols, but many cryptographic primitives…

Cryptography and Security · Computer Science 2022-07-29 Taiga Hiroka , Tomoyuki Morimae , Ryo Nishimaki , Takashi Yamakawa

Encrypted cloning enables the redundant storage of an unknown qubit while remaining compatible with the no-cloning theorem, since only one clone can later be recovered through key-consuming decryption. Because encryption in this protocol is…

Quantum Physics · Physics 2026-04-14 Gabriele Gianini , Omar Hasan , Corrrado Mio , Stelvio Cimato , Ernesto Damiani

In 2013, Boneh and Zhandry introduced the notion of indistinguishability (IND) in chosen plaintext (CPA) and chosen ciphertext (CCA) attacks by a quantum adversary which is given superposition access to an oracle for encryption and…

Quantum Physics · Physics 2016-09-14 Shahram Mossayebi , Rüdiger Schack

Given a ciphertext, is it possible to prove the deletion of the underlying plaintext? Since classical ciphertexts can be copied, clearly such a feat is impossible using classical information alone. In stark contrast to this, we show that…

Quantum Physics · Physics 2021-01-20 Anne Broadbent , Rabib Islam

Yes, we show that they are. We initiate the study of languages that necessarily need uncloneable quantum proofs and advice. We define strictly uncloneable versions of the classes QMA, BQP/qpoly and FEQP/qpoly (which is the class of…

Quantum Physics · Physics 2025-04-02 Rohit Chatterjee , Srijita Kundu , Supartha Podder

The bounded quantum storage model aims to achieve security against computationally unbounded adversaries that are restricted only with respect to their quantum memories. In this work, we provide information-theoretic secure constructions in…

Cryptography and Security · Computer Science 2025-06-05 Mohammed Barhoush , Louis Salvail

Quantum cryptography promises in-principle secure communication between two parties via a quantum channel, with the ability to discover eavesdropping when it occurs. In 1999, a telecloning protocol was invented [M. Murao {\it et al}., Phys.…

Brakerski showed that linearly decryptable fully homomorphic encryption (FHE) schemes cannot be secure in the chosen plaintext attack (CPA) model. In this paper, we show that linearly decryptable FHE schemes cannot be secure even in the…

Cryptography and Security · Computer Science 2019-06-07 Yongge Wang