Search Results - "Ananth, Prabhanjan"

Complexity of Gröbner basis detection and border basis detection by Ananth, Prabhanjan V., Dukkipati, Ambedkar

“…Gröbner basis detection (GBD) is defined as follows: given a set of polynomials, decide whether there exists–and if “yes” find–a term order such that the set…”
Get full text

A Modular Approach to Unclonable Cryptography by Ananth, Prabhanjan, Behera, Amit

“…We explore a new pathway to designing unclonable cryptographic primitives. We propose a new notion called unclonable puncturable obfuscation (UPO) and study…”
Get full text

A Note on Copy-Protection from Random Oracles by Ananth, Prabhanjan, Kaleoglu, Fatih

“…Quantum copy-protection, introduced by Aaronson (CCC'09), uses the no-cloning principle of quantum mechanics to protect software from being illegally…”
Get full text

Revocable Encryption, Programs, and More: The Case of Multi-Copy Security by Ananth, Prabhanjan, Mutreja, Saachi, Poremba, Alexander

“…Fundamental principles of quantum mechanics have inspired many new research directions, particularly in quantum cryptography. One such principle is quantum…”
Get full text

Cryptography in the Common Haar State Model: Feasibility Results and Separations by Ananth, Prabhanjan, Gulati, Aditya, Lin, Yao-Ting

“…Common random string model is a popular model in classical cryptography. We study a quantum analogue of this model called the common Haar state (CHS) model. In…”
Get full text

Post-Quantum Zero-Knowledge with Space-Bounded Simulation by Ananth, Prabhanjan, Grilo, Alex B

“…The traditional definition of quantum zero-knowledge stipulates that the knowledge gained by any quantum polynomial-time verifier in an interactive protocol…”
Get full text

Unclonable Encryption, Revisited by Ananth, Prabhanjan, Kaleoglu, Fatih

“…Unclonable encryption, introduced by Broadbent and Lord (TQC'20), is an encryption scheme with the following attractive feature: given a ciphertext, an…”
Get full text

Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography by Ananth, Prabhanjan, Kaleoglu, Fatih, Yuen, Henry

“…Unclonable cryptography is concerned with leveraging the no-cloning principle to build cryptographic primitives that are otherwise impossible to achieve…”
Get full text

A Note on the Common Haar State Model by Ananth, Prabhanjan, Gulati, Aditya, Lin, Yao-Ting

“…Common random string model is a popular model in classical cryptography with many constructions proposed in this model. We study a quantum analogue of this…”
Get full text

Indistinguishability Obfuscation from Low Degree Multilinear Maps by Ananth, Prabhanjan Vijendra

“…Program Obfuscation is the art of making computer programs "unintelligible" while preserving its functionality. There have been many attempts to formalize this…”
Get full text

Pseudorandom Strings from Pseudorandom Quantum States by Ananth, Prabhanjan, Lin, Yao-Ting, Yuen, Henry

“…We study the relationship between notions of pseudorandomness in the quantum and classical worlds. Pseudorandom quantum state generator (PRSG), a…”
Get full text

Ideal Pseudorandom Codes by Alrabiah, Omar, Ananth, Prabhanjan, Christ, Miranda, Dodis, Yevgeniy, Gunn, Sam

“…Pseudorandom codes are error-correcting codes with the property that no efficient adversary can distinguish encodings from uniformly random strings. They were…”
Get full text

Revocable Cryptography from Learning with Errors by Ananth, Prabhanjan, Poremba, Alexander, Vaikuntanathan, Vinod

“…Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible…”
Get full text

Pseudorandomness in the (Inverseless) Haar Random Oracle Model by Ananth, Prabhanjan, Bostanci, John, Gulati, Aditya, Lin, Yao-Ting

“…We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary,…”
Get full text

Cloning Games: A General Framework for Unclonable Primitives by Ananth, Prabhanjan, Kaleoglu, Fatih, Liu, Qipeng

“…The powerful no-cloning principle of quantum mechanics can be leveraged to achieve interesting primitives, referred to as unclonable primitives, that are…”
Get full text

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions by Ananth, Prabhanjan, Hu, Zihan, Yuen, Henry

“…Public-key quantum money is a cryptographic proposal for using highly entangled quantum states as currency that is publicly verifiable yet resistant to…”
Get full text

Unclonable Secret Sharing by Ananth, Prabhanjan, Goyal, Vipul, Liu, Jiahui, Liu, Qipeng

“…Unclonable cryptography utilizes the principles of quantum mechanics to addresses cryptographic tasks that are impossible classically. We introduce a novel…”
Get full text

Pseudorandom Isometries by Ananth, Prabhanjan, Gulati, Aditya, Kaleoglu, Fatih, Lin, Yao-Ting

“…We introduce a new notion called ${\cal Q}$-secure pseudorandom isometries (PRI). A pseudorandom isometry is an efficient quantum circuit that maps an…”
Get full text

Cryptography from Pseudorandom Quantum States by Ananth, Prabhanjan, Qian, Luowen, Yuen, Henry

“…Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable quantum states that are computationally indistinguishable from…”
Get full text

Provable Robust Watermarking for AI-Generated Text by Zhao, Xuandong, Ananth, Prabhanjan, Li, Lei, Wang, Yu-Xiang

“…We study the problem of watermarking large language models (LLMs) generated text -- one of the most promising approaches for addressing the safety challenges…”
Get full text