Mark Zhandry

Orcid: 0000-0001-7071-6272

According to our database1, Mark Zhandry authored at least 105 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Full Quantum Equivalence of Group Action DLog and CDH, and More.
J. Cryptol., December, 2024

Verifiable Quantum Advantage without Structure.
J. ACM, June, 2024

Optimal Traitor Tracing from Pairings.
IACR Cryptol. ePrint Arch., 2024

Adaptive Security in SNARGs via iO and Lossy Functions.
IACR Cryptol. ePrint Arch., 2024

Hard Quantum Extrapolations in Quantum Cryptography.
IACR Cryptol. ePrint Arch., 2024

Quantum State Group Actions.
IACR Cryptol. ePrint Arch., 2024

Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions.
IACR Cryptol. ePrint Arch., 2024

Composability in Watermarking Schemes.
IACR Cryptol. ePrint Arch., 2024

(Quantum) Indifferentiability and Pre-Computation.
IACR Cryptol. ePrint Arch., 2024

A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire.
IACR Cryptol. ePrint Arch., 2024

The Space-Time Cost of Purifying Quantum Computations.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

A Computational Separation Between Quantum No-Cloning and No-Telegraphing.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Quantum Money from Abelian Group Actions.
IACR Cryptol. ePrint Arch., 2023

Tracing Quantum State Distinguishers via Backtracking.
IACR Cryptol. ePrint Arch., 2023

Computational Wiretap Coding from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2023

Somewhere Randomness Extraction and Security against Bounded-Storage Mass Surveillance.
IACR Cryptol. ePrint Arch., 2023

A Lower Bound on the Length of Signatures Based on Group Actions and Generic Isogenies.
IACR Cryptol. ePrint Arch., 2023

Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles.
IACR Cryptol. ePrint Arch., 2023

A Computational Separation Between Quantum No-cloning and No-teleportation.
CoRR, 2023

Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Augmented Random Oracles.
IACR Cryptol. ePrint Arch., 2022

New Constructions of Collapsing Hashes.
IACR Cryptol. ePrint Arch., 2022

To Label, or Not To Label (in Generic Groups).
IACR Cryptol. ePrint Arch., 2022

Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More.
IACR Cryptol. ePrint Arch., 2022

Collusion Resistant Copy-Protection for Watermarkable Functionalities.
IACR Cryptol. ePrint Arch., 2022

Adaptive Multiparty NIKE.
IACR Cryptol. ePrint Arch., 2022

On the Feasibility of Unclonable Encryption, and More.
IACR Cryptol. ePrint Arch., 2022

Commitments to Quantum States.
Electron. Colloquium Comput. Complex., 2022

2021
Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions.
J. Cryptol., 2021

Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness.
J. Cryptol., 2021

White Box Traitor Tracing.
IACR Cryptol. ePrint Arch., 2021

Redeeming Reset Indifferentiability and Post-Quantum Groups.
IACR Cryptol. ePrint Arch., 2021

The Relationship Between Idealized Models Under Computationally Bounded Adversaries.
IACR Cryptol. ePrint Arch., 2021

Franchised Quantum Money.
IACR Cryptol. ePrint Arch., 2021

Iterated Inhomogeneous Polynomials.
IACR Cryptol. ePrint Arch., 2021

Disappearing Cryptography in the Bounded Storage Model.
IACR Cryptol. ePrint Arch., 2021

Incompressible Cryptography.
IACR Cryptol. ePrint Arch., 2021

Hidden Cosets and Applications to Unclonable Cryptography.
IACR Cryptol. ePrint Arch., 2021

Post-Quantum Succinct Arguments.
Electron. Colloquium Comput. Complex., 2021

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering.
Electron. Colloquium Comput. Complex., 2021

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Redeeming Reset Indifferentiability and Applications to Post-quantum Security.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves.
J. Math. Cryptol., 2020

Schrödinger's Pirate: How To Trace a Quantum Decoder.
IACR Cryptol. ePrint Arch., 2020

New Techniques for Traitor Tracing: Size N<sup>1/3</sup> and More from Pairings.
IACR Cryptol. ePrint Arch., 2020

Classical vs Quantum Random Oracles.
IACR Cryptol. ePrint Arch., 2020

A Note on Separating Classical and Quantum Random Oracles.
IACR Cryptol. ePrint Arch., 2020

Quantum Immune One-Time Memories.
IACR Cryptol. ePrint Arch., 2020

Towards Non-Interactive Witness Hiding.
IACR Cryptol. ePrint Arch., 2020

Unclonable Decryption Keys.
IACR Cryptol. ePrint Arch., 2020

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.
IACR Cryptol. ePrint Arch., 2020

One-shot Signatures and Applications to Hybrid Quantum/Classical Authentication.
IACR Cryptol. ePrint Arch., 2020

New Approaches for Quantum Copy-Protection.
IACR Cryptol. ePrint Arch., 2020

2019
The Magic of ELFs.
J. Cryptol., 2019

Indifferentiability for Public Key Cryptosystems.
IACR Cryptol. ePrint Arch., 2019

On ELFs, Deterministic Encryption, and Correlated-Input Security.
IACR Cryptol. ePrint Arch., 2019

Revisiting Post-Quantum Fiat-Shamir.
IACR Cryptol. ePrint Arch., 2019

Simple Schemes in the Bounded Storage Model.
IACR Cryptol. ePrint Arch., 2019

The Distinction Between Fixed and Random Generators in Group-Based Assumptions.
IACR Cryptol. ePrint Arch., 2019

2018
Cutting-edge cryptography through the lens of secret sharing.
Inf. Comput., 2018

How to Record Quantum Queries, and Applications to Quantum Indifferentiability.
IACR Cryptol. ePrint Arch., 2018

On Finding Quantum Multi-collisions.
IACR Cryptol. ePrint Arch., 2018

Parameter-Hiding Order Revealing Encryption.
IACR Cryptol. ePrint Arch., 2018

New Techniques for Obfuscating Conjunctions.
IACR Cryptol. ePrint Arch., 2018

Preventing Zeroizing Attacks on GGH15.
IACR Cryptol. ePrint Arch., 2018

The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Return of GGH15: Provable Security Against Zeroizing Attacks.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

2017
Impossibility of Order-Revealing Encryption in Idealized Models.
IACR Cryptol. ePrint Arch., 2017

Quantum Lightning Never Strikes the Same State Twice.
IACR Cryptol. ePrint Arch., 2017

New Multilinear Maps from CLT13 with Provable Security Against Zeroizing Attacks.
IACR Cryptol. ePrint Arch., 2017

Encryptor Combiners: A Unified Approach to Multiparty NIKE, (H)IBE, and Broadcast Encryption.
IACR Cryptol. ePrint Arch., 2017

Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness.
IACR Cryptol. ePrint Arch., 2017

New security notions and feasibility results for authentication of quantum data.
IACR Cryptol. ePrint Arch., 2017

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation.
Algorithmica, 2017

2016
A Note on Quantum-Secure PRPs.
IACR Cryptol. ePrint Arch., 2016

Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks.
IACR Cryptol. ePrint Arch., 2016

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13.
IACR Cryptol. ePrint Arch., 2016

Strong Hardness of Privacy from Weak Traitor Tracing.
IACR Cryptol. ePrint Arch., 2016

Breaking the Sub-Exponential Barrier in Obfustopia.
IACR Cryptol. ePrint Arch., 2016

Secure Obfuscation in a Weak Multilinear Map Model.
IACR Cryptol. ePrint Arch., 2016

Functional Encryption Without Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

How to Generate and Use Universal Samplers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Cryptography in the age of quantum computers.
PhD thesis, 2015

A note on the quantum collision and set equality problems.
Quantum Inf. Comput., 2015

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key.
IACR Cryptol. ePrint Arch., 2015

Modern Cryptography Through the Lens of Secret Sharing.
IACR Cryptol. ePrint Arch., 2015

Order-Revealing Encryption and the Hardness of Private Learning.
IACR Cryptol. ePrint Arch., 2015

Post-Zeroizing Obfuscation: The case of Evasive Circuits.
IACR Cryptol. ePrint Arch., 2015

Quantum Oracle Classification - The Case of Group Structure.
CoRR, 2015

2014
Adaptively Secure Broadcast Encryption with Small System Parameters.
IACR Cryptol. ePrint Arch., 2014

How to Avoid Obfuscation Using Witness PRFs.
IACR Cryptol. ePrint Arch., 2014

Obfuscating Low-Rank Matrix Branching Programs.
IACR Cryptol. ePrint Arch., 2014

Fully Secure Functional Encryption without Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Fully Secure Attribute Based Encryption from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2014

Low Overhead Broadcast Encryption from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2014

Semantically Secure Order-Revealing Encryption: Multi-Input Functional Encryption Without Obfuscation.
IACR Cryptol. ePrint Arch., 2014

2013
Secure Signatures and Chosen Ciphertext Security in a Post-Quantum World.
IACR Cryptol. ePrint Arch., 2013

Differing-Inputs Obfuscation and Applications.
IACR Cryptol. ePrint Arch., 2013

Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Identity-based Encryption is Secure in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2012

How to Construct Quantum Random Functions.
Electron. Colloquium Comput. Complex., 2012

Quantum-Secure Message Authentication Codes.
Electron. Colloquium Comput. Complex., 2012

Secure Identity-Based Encryption in the Quantum Random Oracle Model.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2010
Random Oracles in a Quantum World.
IACR Cryptol. ePrint Arch., 2010


  Loading...