activity
20102026
most citedNew Hardness Results in Rainbow Connectivity

19 citations · 56 across the 28 of their papers we have counts for

collaborators
Showing 2023Show all

7 papers · 1 filter

quant-ph2023

Pseudorandom Isometries

Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu +1

We introduce a new notion called -secure pseudorandom isometries (PRI). A pseudorandom isometry is an efficient quantum circuit that maps an -qubit state to an …

cs.CR2023

A Modular Approach to Unclonable Cryptography

Prabhanjan Ananth, Amit Behera

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 un…

cs.CL2023★ 16 cited

Provable Robust Watermarking for AI-Generated Text

Xuandong Zhao, Prabhanjan Ananth, Lei Li +1

We study the problem of watermarking large language models (LLMs) generated text -- one of the most promising approaches for addressing the safety challenges of LLM usage. In this…

quant-ph2023

Pseudorandom Strings from Pseudorandom Quantum States

Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen

We study the relationship between notions of pseudorandomness in the quantum and classical worlds. Pseudorandom quantum state generator (PRSG), a pseudorandomness notion in the qua…

quant-ph2023★ 1 cited

Cloning Games: A General Framework for Unclonable Primitives

Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu

The powerful no-cloning principle of quantum mechanics can be leveraged to achieve interesting primitives, referred to as unclonable primitives, that are impossible to achieve clas…

quant-ph2023★ 1 cited

Revocable Cryptography from Learning with Errors

Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan

Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible classically. In this work,…