Revocable cryptography from learning with errors

P Ananth, A Poremba, V Vaikuntanathan - Theory of Cryptography …, 2023 - Springer
Quantum cryptography leverages unique properties of quantum information in order to
construct cryptographic primitives that are oftentimes impossible classically. In this work, we …

[PDF][PDF] Obfuscation and Outsourced Computation with Certified Deletion.

J Bartusek, S Garg, V Goyal, D Khurana… - IACR Cryptol. ePrint …, 2023 - core.ac.uk
Can we outsource computation on encrypted data, while ensuring that the data is certifiably,
information-theoretically deleted by the server after computation? Can we encode a …

A modular approach to unclonable cryptography

P Ananth, A Behera - Annual International Cryptology Conference, 2024 - Springer
We explore a new pathway to designing unclonable cryptographic primitives. We propose a
new notion called unclonable puncturable obfuscation (UPO) and study its implications for …

One-out-of-many unclonable cryptography: definitions, constructions, and more

F Kitagawa, R Nishimaki - Theory of Cryptography Conference, 2023 - Springer
The no-cloning principle of quantum mechanics enables us to achieve amazing unclonable
cryptographic primitives, which is impossible in classical cryptography. However, the …

On the (im) plausibility of public-key quantum money from collision-resistant hash functions

P Ananth, Z Hu, H Yuen - International Conference on the Theory and …, 2023 - Springer
Public-key quantum money is a cryptographic proposal for using highly entangled quantum
states as currency that is publicly verifiable yet resistant to counterfeiting due to the laws of …

Revocable encryption, programs, and more: The case of multi-copy security

P Ananth, S Mutreja, A Poremba - arxiv preprint arxiv:2410.13163, 2024 - arxiv.org
Fundamental principles of quantum mechanics have inspired many new research directions,
particularly in quantum cryptography. One such principle is quantum no-cloning which has …

Software with certified deletion

J Bartusek, V Goyal, D Khurana, G Malavolta… - … Conference on the …, 2024 - Springer
Is it possible to prove the deletion of a computer program after having executed it? While this
task is clearly impossible using classical information alone, the laws of quantum mechanics …

On the (Im) possibility of Time-Lock Puzzles in the Quantum Random Oracle Model

A Afshar, KM Chung, YC Hsieh, YT Lin… - … Conference on the …, 2023 - Springer
Time-lock puzzles wrap a solution s inside a puzzle P in such a way that “solving” P to find s
requires significantly more time than generating the pair (s, P), even if the adversary has …

[BOOK][B] Revocable Cryptography in a Quantum World

AM Poremba - 2023 - search.proquest.com
Quantum cryptography leverages unique features of quantum mechanics in order to
construct cryptographic primitives which are oftentimes impossible for digital computers …