Our construction for obfuscating conjuctions. Assuming the conjunction is sampled from a sufficiently random distribution, we prove security under the LPN assumption. Along the way, we prove a partial converse to a theorem of Arora and Ge, showing that LPN remains hard under structured noise when the number of samples is small. See .
Can you hide secrets in software? For decades, attempts at obfuscation applied code transformations such as inserting dummy operations or re-naming variables. These transformations make extracting secrets harder, but not impossible. A new, stronger form of obfuscation has emerged, however, that applies mathematical transformations to software, and has the potential to make extracting secrets effectively impossible. Obfuscation has numerous connections to cryptography and computer science generally.

Adaptive Security in SNARGs via iO and Lossy Functions
By Brent Waters and Mark Zhandry
In CRYPTO 2024

Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles
By Damiano Abram, Brent Waters and Mark Zhandry
In CRYPTO 2023

Computational Wiretap Coding from Indistinguishability Obfuscation
By Yuval Ishai, Aayush Jain, Paul Lou, Amit Sahai and Mark Zhandry
In CRYPTO 2023

Tracing Quantum State Distinguishers via Backtracking
By Mark Zhandry
In CRYPTO 2023

Collusion-Resistant Copy-Protection for Watermarkable Functionalities
By Jiahui Liu, Qipeng Liu, Luowen Qian and Mark Zhandry
In TCC 2022, QIP 2023

Adaptive Multiparty NIKE
By Venkata Koppula, Brent Waters and Mark Zhandry
In TCC 2022

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption
By James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai and Mark Zhandry
In ITCS 2020

The Distinction Between Fixed and Random Generators in Group-Based Assumptions
By James Bartusek, Fermi Ma and Mark Zhandry
In CRYPTO 2019

Quantum Lightning Never Strikes the Same State Twice
By Mark Zhandry
In EUROCRYPT 2019 (Best Paper), Journal of Cryptology (Invited)

New Techniques for Obfuscating Conjunctions
By James Bartusek, Tancrède Lepoint, Fermi Ma and Mark Zhandry
In EUROCRYPT 2019

Preventing Zeroizing Attacks on GGH15
By James Bartusek, Jiaxin Guan, Fermi Ma and Mark Zhandry
In TCC 2018

The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks
By Fermi Ma and Mark Zhandry
In TCC 2018

Decomposable Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness
By Qipeng Liu and Mark Zhandry
In TCC 2017, Journal of Cryptology (Invited)

Breaking the Sub-Exponential Barrier in Obfustopia
By Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan and Mark Zhandry
In EUROCRYPT 2017

Encryptor Combiners: A Unified Approach to Multiparty NIKE, (H)IBE, and Broadcast Encryption
By Fermi Ma and Mark Zhandry

How to Generate and use Universal Samplers
By Dennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters and Mark Zhandry
In ASIACRYPT 2016

Secure Obfuscation in a Weak Multilinear Map Model
By Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan and Mark Zhandry
In TCC 2016-B

The Magic of ELFs
By Mark Zhandry
In CRYPTO 2016 (Early Career Award), Journal of Cryptology (Invited)

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
By Eric Miles, Amit Sahai and Mark Zhandry
In CRYPTO 2016

Post-Zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
By Saikrishna Badrinarayanan, Eric Miles, Amit Sahai and Mark Zhandry
In EUROCRYPT 2016

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
By Ryo Nishimaki, Daniel Wichs and Mark Zhandry
In EUROCRYPT 2016

Order-Revealing Encryption and the Hardness of Private Learning
By Mark Bun and Mark Zhandry
In TCC 2016-A

Cutting-Edge Cryptography Through the Lens of Secret Sharing
By Ilan Komargodski and Mark Zhandry
In TCC 2016-A, Information and Computation

Adaptively Secure Broadcast Encryption with Small System Parameters
By Mark Zhandry

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
By Dan Boneh and Mark Zhandry
In CRYPTO 2014, Algorithmica (Invited to Special Issue on Algorithmic Tools in Cryptography)

Differing-Inputs Obfuscation and Applications
By Prabhanjan Ananth, Dan Boneh, Sanjam Garg, Amit Sahai and Mark Zhandry