From the 1 of 5 linked papers with an AI index.
2 citations · 2 across the 4 of their papers we have counts for
5 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.
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 .
On the undecidability of quantum channel capacities
Archishna Bhattacharyya, Arthur Mehta, Yuming Zhao
An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or ev…
Sequential transmission at short times
Archishna Bhattacharyya
We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels modelled as a discr…