Uncloneable Cryptographic Primitives with Interaction

• URL: http://arxiv.org/abs/2303.00048v1
• Date: Tue, 28 Feb 2023 19:46:15 GMT
• Title: Uncloneable Cryptographic Primitives with Interaction
• Abstract summary: We construct three new cryptographic primitives whose security is based on uncloneability. We prove an extension of the MoE property of coset states introduced by Coladangelo, Liu, Liu, and Zhandry.
• Score: 0.6091702876917281
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: 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 security can be established via a novel monogamy-of-entanglement (MoE) property: - We define interactive uncloneable encryption, a version of the uncloneable encryption defined by Broadbent and Lord [TQC 2020] where the receiver must partake in an interaction with the sender in order to decrypt the ciphertext. We provide a one-round construction that is secure in the information-theoretic setting, in the sense that no other receiver may learn the message even if she eavesdrops on all the interactions. - We provide a way to make a bit string commitment scheme uncloneable. The scheme is augmented with a check step chronologically in between the commit and open steps, where an honest sender verifies that the commitment may not be opened by an eavesdropper, even if the receiver is malicious. - We construct a receiver-independent quantum key distribution (QKD) scheme, which strengthens the notion of one-sided device independent QKD of Tomamichel, Fehr, Kaniewski, and Wehner (TFKW) [NJP 2013] by also permitting the receiver's classical device to be untrusted. Explicitly, the sender remains fully trusted while only the receiver's communication is trusted. To show security, we prove an extension of the MoE property of coset states introduced by Coladangelo, Liu, Liu, and Zhandry [Crypto 2021]. In our stronger version, the player Charlie also receives Bob's answer prior to making his guess, simulating a party who eavesdrops on an interaction. To use this property, we express it as a new type of entropic uncertainty relation which arises naturally from the structure of the underlying MoE game.

Related papers

• Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange [7.877552575246053]
  We show that AI agents can carry out a parallel secret conversation while still producing a transcript that is computationally indistinguishable from an honest interaction.<n>We introduce a new cryptographic primitive, which we call pseudorandom noise-resilient key exchange.<n>Results show that transcript auditing alone cannot rule out covert coordination between AI agents.
  arXiv  Detail & Related papers  (2026-04-06T15:25:38Z)
• The uncloneable bit exists [0.5352699766206808]
  We establish quantum uncloneable encryption with unconditional security.<n>We prevent two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key.
  arXiv  Detail & Related papers  (2026-03-09T20:33:33Z)
• Secure Quantum Relay Networks Using Distributed Entanglement without Classical Authentication [0.0]
  Current quantum communication protocols rely heavily on classical authentication for message origin verification.<n>We propose a novel framework for secure quantum relay networks that completely avoids classical authentication.
  arXiv  Detail & Related papers  (2025-07-07T20:25:10Z)
• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom. We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• Relating Quantum Tamper-Evident Encryption to Other Cryptographic Notions [0.0]
  A quantum tamper-evident encryption scheme is a non-interactive symmetric-key encryption scheme mapping classical messages to quantum ciphertexts. This quantum cryptographic primitive was first introduced by Gottesman in 2003. We further our understanding of tamper-evident encryption by formally relating it to other cryptographic primitives in an information-theoretic setting.
  arXiv  Detail & Related papers  (2024-11-05T02:20:29Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography [5.360892674012226]
  We present a new approach to unclonable encryption via a reduction to a novel question about nonlocal quantum state discrimination. Our main technical result is showing that the players cannot distinguish between each player receiving independently-chosen Haar random states versus all players receiving the same Haar random state. We also show other implications to single-decryptor encryption and leakage-resilient secret sharing.
  arXiv  Detail & Related papers  (2024-05-16T17:30:55Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions [12.45203887838637]
  We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical.
  arXiv  Detail & Related papers  (2023-04-04T13:57:17Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel [1.5070870469725095]
  We propose a new proof method for direct coding theorems for wiretap channels. The method yields errors that decay exponentially with increasing block lengths. It provides a guarantee of a quantum version of semantic security.
  arXiv  Detail & Related papers  (2022-05-16T13:25:56Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication [10.973034520723957]
  Broadbent and Islam proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted message is deleted. Although deletion certificates are privately verifiable, which means a verification key for a certificate has to be kept secret, in the definition by Broadbent and Islam, we can also consider public verifiability.
  arXiv  Detail & Related papers  (2021-05-12T01:41:46Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• Quantum-secure message authentication via blind-unforgeability [74.7729810207187]
  We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. This notion defines a function to be predictable if there exists an adversary who can use "partially blinded" access to predict values. We show the suitability of blind unforgeability for supporting canonical constructions and reductions.
  arXiv  Detail & Related papers  (2018-03-10T05:31:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.