From the 1 of 10 linked papers with an AI index.
1 citations · 1 across the 2 of their papers we have counts for
10 papers
Statistically secure uncloneable encryption of arbitrary messages
Archishna Bhattacharyya, Anne Broadbent, Eric Culf
The paper presents a polynomial‑time scheme that extends statistically secure uncloneable encryption from a single bit to messages of arbitrary length using Clifford unitaries.
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…
The uncloneable bit exists
Archishna Bhattacharyya, Anne Broadbent, Eric Culf
We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext even wh…
Uncloneable Encryption from Decoupling
Archishna Bhattacharyya, Eric Culf
We show that uncloneable encryption exists with no computational assumptions, with security in the security parameter .
The quantum smooth label cover problem is undecidable
Eric Culf, Kieran Mastel, Connor Paddock +1
We show that the quantum smooth label cover problem is undecidable and RE-hard. This sharply contrasts the quantum unique label cover problem, which can be decided efficiently by a…
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…