arbitrary-length messages 1clifford unitaries 1quantum cryptography 1statistical security 1uncloneable encryption 1
From the 1 of 2 linked papers with an AI index.
2 papers
quant-ph2026
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.
quant-ph2026
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…