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

arXiv:2510.12626 · Lecture notes in computer science

Multi-copy Security in Quantum Cryptography and More

Alper Çakan, Vipul Goyal, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa

Published Jan 1, 2026• 3 citations
arXivHTMLPDF
DOI
10.1007/978-3-032-35409-9_2

Related papers

Less is More: On Copy Complexity in Quantum Cryptography

Prabhanjan Ananth, Eli Goldin

arXiv:2510.04992•Lecture notes in computer science•Jan 1, 2026•4 citations

Revocable Encryption, Programs, and More: The Case of Multi-Copy Security

Prabhanjan Ananth, Mutreja, Saachi, Alexander Poremba

Fundamental principles of quantum mechanics have inspired many new research directions, particularly in quantum cryptography. One such principle is quantum no-cloning which has led to the emerging field of revocable cryptography. Roughly speaking, in a revocable cryptographic primitive, a cryptographic object (such as a ciphertext or program) is represented as a quantum state in such a way that surrendering it effectively translates into losing the capability to use this cryptographic object. All of the revocable cryptographic systems studied so far have a major drawback: the recipient only receives one copy of the quantum state. Worse yet, the schemes become completely insecure if the recipient receives many identical copies of the same quantum state - a property that is clearly much more desirable in practice. While multi-copy security has been extensively studied for a number of other quantum cryptographic primitives, it has so far received only little treatment in context of unclonable primitives. Our work, for the first time, shows the feasibility of revocable primitives, such as revocable encryption and revocable programs, which satisfy multi-copy security in oracle models. This suggest that the stronger notion of multi-copy security is within reach in unclonable cryptography more generally, and therefore could lead to a new research direction in the field.

arXiv:2410.13163•Leibniz international proceedings in informatics•Oct 17, 2024•3 citations

Quantum Cryptography in Algorithmica

William Kretschmer, Luowen Qian, Makrand Sinha +1 more

We construct a classical oracle relative to which P = NP yet single-copy secure pseudorandom quantum states exist. In the language of Impagliazzo’s five worlds, this is a construction of pseudorandom states in ”Algorithmica,” and hence shows that in a black-box setting, quantum cryptography based on pseudorandom states is possible even if one-way functions do not exist. As a consequence, we demonstrate that there exists a property of a cryptographic hash function that simultaneously (1) suffices to construct pseudorandom states, (2) holds for a random oracle, and (3) is independent of P vs. NP in the black-box setting. We also introduce a conjecture that would generalize our results to multi-copy secure pseudorandom states.

arXiv:2212.00879•ACM Symposium on Theory of Computing (STOC)•May 16, 2023•84 citations

Quantum Cryptography and Computation

ARTUR K. EKERT

NATO ASI series. Series B : Physics•Jan 1, 1995•0 citations

Sealed States And Quantum Blackmail

Andrew Lutomirski

Consider a protocol in which Belinda seals a (classical) message. She gives the resulting sealed message to Charlie, who can either unseal and read the message or return it unopened to Belinda. If he returns it unopened, Belinda should be able to verify that Charlie neither read the message nor made a copy that would allow him to read it later. Such a protocol is impossible with classical cryptography: Charlie can copy a message and do anything he likes to that copy without damaging the original. With quantum cryptography, on the other hand, the no cloning theorem implies that Charlie cannot simply copy a message and unseal the copy. Abstract In this paper, I prove that any conventional quantum cryptographic protocol can give at best a very weak security guarantee. However, quantum cryptography in conjunction with classical functions that can only be inverted by humans (i.e. CAPTCHAs) can potentially give exponential security.

arXiv:1308.6067•Aug 28, 2013•0 citations

Quantum computation and cryptography: an overview

Manuel Calixto

Natural Computing•Aug 14, 2008•10 citations
Fundamental principles of quantum mechanics have inspired many new research directions, particularly in quantum cryptography. One such principle is quantum no-cloning which has led to the emerging field of revocable cryptography. Roughly speaking, in a revocable cryptographic primitive, a cryptographic object (such as a ciphertext or program) is represented as a quantum state in such a way that surrendering it effectively translates into losing the capability to use this cryptographic object. All of the revocable cryptographic systems studied so far have a major drawback: the recipient only receives one copy of the quantum state. Worse yet, the schemes become completely insecure if the recipient receives many identical copies of the same quantum state - a property that is clearly much more desirable in practice. While multi-copy security has been extensively studied for a number of other quantum cryptographic primitives, it has so far received only little treatment in context of unclonable primitives. Our work, for the first time, shows the feasibility of revocable primitives, such as revocable encryption and revocable programs, which satisfy multi-copy security in oracle models. This suggest that the stronger notion of multi-copy security is within reach in unclonable cryptography more generally, and therefore could lead to a new research direction in the field.
We construct a classical oracle relative to which P = NP yet single-copy secure pseudorandom quantum states exist. In the language of Impagliazzo’s five worlds, this is a construction of pseudorandom states in ”Algorithmica,” and hence shows that in a black-box setting, quantum cryptography based on pseudorandom states is possible even if one-way functions do not exist. As a consequence, we demonstrate that there exists a property of a cryptographic hash function that simultaneously (1) suffices to construct pseudorandom states, (2) holds for a random oracle, and (3) is independent of P vs. NP in the black-box setting. We also introduce a conjecture that would generalize our results to multi-copy secure pseudorandom states.
Consider a protocol in which Belinda seals a (classical) message. She gives the resulting sealed message to Charlie, who can either unseal and read the message or return it unopened to Belinda. If he returns it unopened, Belinda should be able to verify that Charlie neither read the message nor made a copy that would allow him to read it later. Such a protocol is impossible with classical cryptography: Charlie can copy a message and do anything he likes to that copy without damaging the original. With quantum cryptography, on the other hand, the no cloning theorem implies that Charlie cannot simply copy a message and unseal the copy. Abstract In this paper, I prove that any conventional quantum cryptographic protocol can give at best a very weak security guarantee. However, quantum cryptography in conjunction with classical functions that can only be inverted by humans (i.e. CAPTCHAs) can potentially give exponential security.