6 citations · 12 across the 6 of their papers we have counts for
11 papers
Normal-Form Characterization of Adaptivity and Entanglement in Pauli-Based Computation
Filipa C. R. Peres, Selman Ipek, Daniel Lovsted +2
Pauli-based computation (PBC) is a measurement-based model of quantum computation that samples from output distributions of universal Clifford+ circuits. Here, we provide a norm…
Blind Quantum Computation with a Small Quantum Server
Daniel Lovsted, Filipa C. R. Peres, Joshua Nevin +2
Blind quantum computation (BQC) allows low-resource clients to securely delegate computations to a quantum server, but server resource costs scale with the computation size, posing…
Keyless secrecy against bounded adversaries
Anne Broadbent, Upendra Kapshikar, Denis Rochette
We introduce a keyless coding/cryptographic primitive that asks for two guarantees at once: the receiver is never fooled into accepting a message other than the one sent, and the a…
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…
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…
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…
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…
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…
Algebra of Nonlocal Boxes and the Collapse of Communication Complexity
Pierre Botteron, Anne Broadbent, Reda Chhaibi +2
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function f(X,Y), where the strings X and Y are distributed to the first and second c…
Uncloneable Quantum Advice
Anne Broadbent, Martti Karvonen, Sébastien Lord
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…
Entanglement swapping, light cones and elements of reality
A. Broadbent, A. A. Methot
Recently, a number of two-participant all-versus-nothing Bell experiments have been proposed. Here, we give local realistic explanations for these experiments. More precisely, we e…