most citedTowards Unconditional Uncloneable Encryption

1 citations · 1 across the 1 of their papers we have counts for

collaborators

5 papers

quant-ph20261 cited

Towards Unconditional Uncloneable Encryption

Pierre Botteron, Anne Broadbent, Eric Culf +3

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of…

quant-ph2025

Noise-Robustness for Delegated Quantum Computation in the Circuit Model

Anne Broadbent, Joshua Nevin

Cloud-based quantum computing, coupled with the rapid progress in quantum algorithms, brings to the forefront the question of verifiability in delegated quantum computations. In th…

quant-ph2025

Optimal Untelegraphable Encryption and Implications for Uncloneable Encryption

Anne Broadbent, Eric Culf, Denis Rochette

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 capabilit…

quant-ph2025

Towards Universal Quantum Tamper Detection

Anne Broadbent, Upendra Kapshikar, Denis Rochette

Tamper-resilient cryptography studies how to protect data against adversaries who can physically manipulate codewords before they are decoded. The notion of tamper detection codes…

quant-ph2025

A classical proof of quantum knowledge for multi-prover interactive proof systems

Anne Broadbent, Alex B. Grilo, Nagisa Hara +1

In a proof of knowledge (PoK), a verifier becomes convinced that a prover possesses privileged information. In combination with zero-knowledge proof systems, PoKs play an important…