default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Zhandry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Takashi Yamakawa
, Mark Zhandry:
Verifiable Quantum Advantage without Structure. J. ACM 71(3): 20 (2024)- [j9]Hart Montgomery, Mark Zhandry:
Full Quantum Equivalence of Group Action DLog and CDH, and More. J. Cryptol. 37(4): 39 (2024) - [c71]George Lu, Mark Zhandry:
Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions. CRYPTO (5) 2024: 46-74 - [c70]Brent Waters, Mark Zhandry:
Adaptive Security in SNARGs via iO and Lossy Functions. CRYPTO (10) 2024: 72-104 - [c69]Barak Nehoran, Mark Zhandry:
A Computational Separation Between Quantum No-Cloning and No-Telegraphing. ITCS 2024: 82:1-82:23 - [c68]Mark Zhandry:
Quantum Money from Abelian Group Actions. ITCS 2024: 101:1-101:23 - [c67]Mark Zhandry:
The Space-Time Cost of Purifying Quantum Computations. ITCS 2024: 102:1-102:22 - [i107]Mark Zhandry:
The Space-Time Cost of Purifying Quantum Computations. CoRR abs/2401.07974 (2024) - [i106]Brent Waters, Mark Zhandry:
Adaptive Security in SNARGs via iO and Lossy Functions. IACR Cryptol. ePrint Arch. 2024: 254 (2024) - [i105]Mark Zhandry:
Optimal Traitor Tracing from Pairings. IACR Cryptol. ePrint Arch. 2024: 867 (2024) - [i104]George Lu, Mark Zhandry:
Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions. IACR Cryptol. ePrint Arch. 2024: 993 (2024) - [i103]Luowen Qian, Justin Raizes, Mark Zhandry:
Hard Quantum Extrapolations in Quantum Cryptography. IACR Cryptol. ePrint Arch. 2024: 1500 (2024) - 2023
- [c66]Cong Zhang, Mark Zhandry:
The Relationship Between Idealized Models Under Computationally Bounded Adversaries. ASIACRYPT (6) 2023: 390-419 - [c65]Mark Zhandry:
Tracing Quantum State Distinguishers via Backtracking. CRYPTO (5) 2023: 3-36 - [c64]Yuval Ishai, Aayush Jain, Paul Lou, Amit Sahai, Mark Zhandry:
Computational Wiretap Coding from Indistinguishability Obfuscation. CRYPTO (4) 2023: 263-293 - [c63]Damiano Abram, Brent Waters, Mark Zhandry:
Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles. CRYPTO (1) 2023: 489-514 - [c62]Dan Boneh, Jiaxin Guan, Mark Zhandry:
A Lower Bound on the Length of Signatures Based on Group Actions and Generic Isogenies. EUROCRYPT (5) 2023: 507-531 - [c61]Jiahui Liu, Hart Montgomery, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: - How to Not Build It from Lattices, and More. EUROCRYPT (1) 2023: 611-638 - [c60]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. STOC 2023: 1579-1588 - [c59]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance. TCC (3) 2023: 93-122 - [i102]Barak Nehoran, Mark Zhandry:
A Computational Separation Between Quantum No-cloning and No-teleportation. CoRR abs/2302.01858 (2023) - [i101]Mark Zhandry:
Quantum Money from Abelian Group Actions. CoRR abs/2307.12120 (2023) - [i100]Dan Boneh, Jiaxin Guan, Mark Zhandry:
A Lower Bound on the Length of Signatures Based on Group Actions and Generic Isogenies. IACR Cryptol. ePrint Arch. 2023: 250 (2023) - [i99]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Somewhere Randomness Extraction and Security against Bounded-Storage Mass Surveillance. IACR Cryptol. ePrint Arch. 2023: 409 (2023) - [i98]Mark Zhandry:
Tracing Quantum State Distinguishers via Backtracking. IACR Cryptol. ePrint Arch. 2023: 673 (2023) - [i97]Damiano Abram, Brent Waters, Mark Zhandry:
Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles. IACR Cryptol. ePrint Arch. 2023: 860 (2023) - [i96]Mark Zhandry:
Quantum Money from Abelian Group Actions. IACR Cryptol. ePrint Arch. 2023: 1097 (2023) - [i95]Yuval Ishai, Aayush Jain, Paul Lou, Amit Sahai, Mark Zhandry:
Computational Wiretap Coding from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2023: 1270 (2023) - 2022
- [c58]Hart Montgomery, Mark Zhandry:
Full Quantum Equivalence of Group Action DLog and CDH, and More. ASIACRYPT (1) 2022: 3-32 - [c57]Mark Zhandry:
Augmented Random Oracles. CRYPTO (3) 2022: 35-65 - [c56]Mark Zhandry:
To Label, or Not To Label (in Generic Groups). CRYPTO (3) 2022: 66-96 - [c55]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, Mark Zhandry:
On the Feasibility of Unclonable Encryption, and More. CRYPTO (2) 2022: 212-241 - [c54]Mark Zhandry:
New Constructions of Collapsing Hashes. CRYPTO (3) 2022: 596-624 - [c53]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. EUROCRYPT (3) 2022: 372-401 - [c52]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Incompressible Cryptography. EUROCRYPT (1) 2022: 700-730 - [c51]Takashi Yamakawa, Mark Zhandry:
Verifiable Quantum Advantage without Structure. FOCS 2022: 69-74 - [c50]Venkata Koppula, Brent Waters, Mark Zhandry:
Adaptive Multiparty NIKE. TCC (2) 2022: 244-273 - [c49]Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry:
Collusion Resistant Copy-Protection for Watermarkable Functionalities. TCC (1) 2022: 294-323 - [i94]Takashi Yamakawa, Mark Zhandry:
Verifiable Quantum Advantage without Structure. CoRR abs/2204.02063 (2022) - [i93]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, Mark Zhandry:
On the Feasibility of Unclonable Encryption, and More. CoRR abs/2207.06589 (2022) - [i92]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. CoRR abs/2210.05138 (2022) - [i91]Hart Montgomery, Jiahui Liu, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More. CoRR abs/2211.11994 (2022) - [i90]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. Electron. Colloquium Comput. Complex. TR22 (2022) - [i89]Mark Zhandry:
To Label, or Not To Label (in Generic Groups). IACR Cryptol. ePrint Arch. 2022: 226 (2022) - [i88]Takashi Yamakawa, Mark Zhandry:
Verifiable Quantum Advantage without Structure. IACR Cryptol. ePrint Arch. 2022: 434 (2022) - [i87]Mark Zhandry:
New Constructions of Collapsing Hashes. IACR Cryptol. ePrint Arch. 2022: 678 (2022) - [i86]Mark Zhandry:
Augmented Random Oracles. IACR Cryptol. ePrint Arch. 2022: 783 (2022) - [i85]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, Mark Zhandry:
On the Feasibility of Unclonable Encryption, and More. IACR Cryptol. ePrint Arch. 2022: 884 (2022) - [i84]Hart Montgomery, Mark Zhandry:
Full Quantum Equivalence of Group Action DLog and CDH, and More. IACR Cryptol. ePrint Arch. 2022: 1135 (2022) - [i83]Venkata Koppula, Brent Waters, Mark Zhandry:
Adaptive Multiparty NIKE. IACR Cryptol. ePrint Arch. 2022: 1324 (2022) - [i82]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. IACR Cryptol. ePrint Arch. 2022: 1358 (2022) - [i81]Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry:
Collusion Resistant Copy-Protection for Watermarkable Functionalities. IACR Cryptol. ePrint Arch. 2022: 1429 (2022) - [i80]Hart Montgomery, Jiahui Liu, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More. IACR Cryptol. ePrint Arch. 2022: 1620 (2022) - 2021
- [j8]Mark Zhandry:
How to Construct Quantum Random Functions. J. ACM 68(5): 33:1-33:43 (2021) - [j7]Mark Zhandry:
Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions. J. Cryptol. 34(1): 6 (2021) - [j6]Qipeng Liu, Mark Zhandry:
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. J. Cryptol. 34(3): 35 (2021) - [c48]Mark Zhandry:
Redeeming Reset Indifferentiability and Applications to Post-quantum Security. ASIACRYPT (1) 2021: 518-548 - [c47]Bhaskar Roberts, Mark Zhandry:
Franchised Quantum Money. ASIACRYPT (1) 2021: 549-574 - [c46]Mark Zhandry:
White Box Traitor Tracing. CRYPTO (4) 2021: 303-333 - [c45]Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang:
New Approaches for Quantum Copy-Protection. CRYPTO (1) 2021: 526-555 - [c44]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. CRYPTO (1) 2021: 556-584 - [c43]Takashi Yamakawa, Mark Zhandry:
Classical vs Quantum Random Oracles. EUROCRYPT (2) 2021: 568-597 - [c42]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier. FOCS 2021: 49-58 - [c41]Jiaxin Guan, Mark Zhandry:
Disappearing Cryptography in the Bounded Storage Model. TCC (2) 2021: 365-396 - [i79]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. CoRR abs/2103.08140 (2021) - [i78]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. CoRR abs/2107.05692 (2021) - [i77]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. CoRR abs/2108.11015 (2021) - [i76]Bhaskar Roberts, Mark Zhandry:
Franchised Quantum Money. CoRR abs/2110.09733 (2021) - [i75]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. Electron. Colloquium Comput. Complex. TR21 (2021) - [i74]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. Electron. Colloquium Comput. Complex. TR21 (2021) - [i73]Mark Zhandry, Cong Zhang:
The Relationship Between Idealized Models Under Computationally Bounded Adversaries. IACR Cryptol. ePrint Arch. 2021: 240 (2021) - [i72]Mark Zhandry:
Redeeming Reset Indifferentiability and Post-Quantum Groups. IACR Cryptol. ePrint Arch. 2021: 288 (2021) - [i71]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. IACR Cryptol. ePrint Arch. 2021: 334 (2021) - [i70]Jiaxin Guan, Mark Zhandry:
Disappearing Cryptography in the Bounded Storage Model. IACR Cryptol. ePrint Arch. 2021: 406 (2021) - [i69]Mark Zhandry:
White Box Traitor Tracing. IACR Cryptol. ePrint Arch. 2021: 891 (2021) - [i68]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. IACR Cryptol. ePrint Arch. 2021: 946 (2021) - [i67]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. IACR Cryptol. ePrint Arch. 2021: 1093 (2021) - [i66]Jiaxin Guan, Mark Zhandry:
Iterated Inhomogeneous Polynomials. IACR Cryptol. ePrint Arch. 2021: 1399 (2021) - [i65]Bhaskar Roberts, Mark Zhandry:
Franchised Quantum Money. IACR Cryptol. ePrint Arch. 2021: 1410 (2021) - [i64]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Incompressible Cryptography. IACR Cryptol. ePrint Arch. 2021: 1679 (2021) - 2020
- [j5]Dan Boneh, Darren B. Glass, Daniel Krashen, Kristin E. Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, Mark Zhandry:
Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves. J. Math. Cryptol. 14(1): 5-14 (2020) - [c40]Mark Zhandry, Cong Zhang:
Indifferentiability for Public Key Cryptosystems. CRYPTO (1) 2020: 63-93 - [c39]Mark Zhandry:
New Techniques for Traitor Tracing: Size N1/3 and More from Pairings. CRYPTO (1) 2020: 652-682 - [c38]James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry:
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption. ITCS 2020: 82:1-82:39 - [c37]Ryan Amos, Marios Georgiou, Aggelos Kiayias, Mark Zhandry:
One-shot signatures and applications to hybrid quantum/classical authentication. STOC 2020: 255-268 - [c36]Mark Zhandry:
Schrödinger's Pirate: How to Trace a Quantum Decoder. TCC (3) 2020: 61-91 - [c35]Benjamin Kuykendall, Mark Zhandry:
Towards Non-interactive Witness Hiding. TCC (1) 2020: 627-656 - [i63]Ryan Amos, Marios Georgiou, Aggelos Kiayias, Mark Zhandry:
One-shot Signatures and Applications to Hybrid Quantum/Classical Authentication. IACR Cryptol. ePrint Arch. 2020: 107 (2020) - [i62]Takashi Yamakawa, Mark Zhandry:
A Note on Separating Classical and Quantum Random Oracles. IACR Cryptol. ePrint Arch. 2020: 787 (2020) - [i61]Qipeng Liu, Amit Sahai, Mark Zhandry:
Quantum Immune One-Time Memories. IACR Cryptol. ePrint Arch. 2020: 871 (2020) - [i60]Marios Georgiou, Mark Zhandry:
Unclonable Decryption Keys. IACR Cryptol. ePrint Arch. 2020: 877 (2020) - [i59]James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry:
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption. IACR Cryptol. ePrint Arch. 2020: 889 (2020) - [i58]Mark Zhandry:
New Techniques for Traitor Tracing: Size N1/3 and More from Pairings. IACR Cryptol. ePrint Arch. 2020: 954 (2020) - [i57]Mark Zhandry:
Schrödinger's Pirate: How To Trace a Quantum Decoder. IACR Cryptol. ePrint Arch. 2020: 1191 (2020) - [i56]Benjamin Kuykendall, Mark Zhandry:
Towards Non-Interactive Witness Hiding. IACR Cryptol. ePrint Arch. 2020: 1205 (2020) - [i55]Takashi Yamakawa, Mark Zhandry:
Classical vs Quantum Random Oracles. IACR Cryptol. ePrint Arch. 2020: 1270 (2020) - [i54]Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang:
New Approaches for Quantum Copy-Protection. IACR Cryptol. ePrint Arch. 2020: 1339 (2020)
2010 – 2019
- 2019
- [j4]Mark Zhandry:
The Magic of ELFs. J. Cryptol. 32(3): 825-866 (2019) - [c34]Mark Zhandry:
How to Record Quantum Queries, and Applications to Quantum Indifferentiability. CRYPTO (2) 2019: 239-268 - [c33]Qipeng Liu, Mark Zhandry:
Revisiting Post-quantum Fiat-Shamir. CRYPTO (2) 2019: 326-355 - [c32]James Bartusek, Fermi Ma, Mark Zhandry:
The Distinction Between Fixed and Random Generators in Group-Based Assumptions. CRYPTO (2) 2019: 801-830 - [c31]Mark Zhandry:
On ELFs, Deterministic Encryption, and Correlated-Input Security. EUROCRYPT (3) 2019: 3-32 - [c30]Qipeng Liu, Mark Zhandry:
On Finding Quantum Multi-collisions. EUROCRYPT (3) 2019: 189-218 - [c29]Mark Zhandry:
Quantum Lightning Never Strikes the Same State Twice. EUROCRYPT (3) 2019: 408-438 - [c28]Jiaxin Guan, Mark Zhandry:
Simple Schemes in the Bounded Storage Model. EUROCRYPT (3) 2019: 500-524 - [c27]James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry:
New Techniques for Obfuscating Conjunctions. EUROCRYPT (3) 2019: 636-666 - [i53]James Bartusek, Fermi Ma, Mark Zhandry:
The Distinction Between Fixed and Random Generators in Group-Based Assumptions. IACR Cryptol. ePrint Arch. 2019: 202 (2019) - [i52]Mark Zhandry:
On ELFs, Deterministic Encryption, and Correlated-Input Security. IACR Cryptol. ePrint Arch. 2019: 213 (2019) - [i51]Qipeng Liu, Mark Zhandry:
Revisiting Post-Quantum Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 262 (2019) - [i50]Mark Zhandry, Cong Zhang:
Indifferentiability for Public Key Cryptosystems. IACR Cryptol. ePrint Arch. 2019: 370 (2019) - [i49]Jiaxin Guan, Mark Zhandry:
Simple Schemes in the Bounded Storage Model. IACR Cryptol. ePrint Arch. 2019: 507 (2019) - 2018
- [j3]Ilan Komargodski, Mark Zhandry:
Cutting-edge cryptography through the lens of secret sharing. Inf. Comput. 263: 75-96 (2018) - [c26]David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang:
Parameter-Hiding Order Revealing Encryption. ASIACRYPT (1) 2018: 181-210 - [c25]Mark Zhandry, Cong Zhang:
Impossibility of Order-Revealing Encryption in Idealized Models. TCC (2) 2018: 129-158 - [c24]Fermi Ma, Mark Zhandry:
The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks. TCC (2) 2018: 513-543 - [c23]James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry:
Return of GGH15: Provable Security Against Zeroizing Attacks. TCC (2) 2018: 544-574 - [i48]Dan Boneh, Darren B. Glass, Daniel Krashen, Kristin E. Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, Mark Zhandry:
Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves. CoRR abs/1807.03038 (2018) - [i47]Qipeng Liu, Mark Zhandry:
On Finding Quantum Multi-collisions. CoRR abs/1811.05385 (2018) - [i46]Mark Zhandry:
How to Record Quantum Queries, and Applications to Quantum Indifferentiability. IACR Cryptol. ePrint Arch. 2018: 276 (2018) - [i45]James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry:
Preventing Zeroizing Attacks on GGH15. IACR Cryptol. ePrint Arch. 2018: 511 (2018) - [i44]Dan Boneh, Darren B. Glass, Daniel Krashen, Kristin E. Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, Mark Zhandry:
Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves. IACR Cryptol. ePrint Arch. 2018: 665 (2018) - [i43]David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang:
Parameter-Hiding Order Revealing Encryption. IACR Cryptol. ePrint Arch. 2018: 698 (2018) - [i42]James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry:
New Techniques for Obfuscating Conjunctions. IACR Cryptol. ePrint Arch. 2018: 936 (2018) - [i41]Qipeng Liu, Mark Zhandry:
On Finding Quantum Multi-collisions. IACR Cryptol. ePrint Arch. 2018: 1096 (2018) - 2017
- [j2]Dan Boneh, Mark Zhandry:
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. Algorithmica 79(4): 1233-1285 (2017) - [c22]Sumegha Garg, Henry Yuen, Mark Zhandry:
New Security Notions and Feasibility Results for Authentication of Quantum Data. CRYPTO (2) 2017: 342-371 - [c21]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. EUROCRYPT (3) 2017: 156-181 - [c20]Qipeng Liu, Mark Zhandry:
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. TCC (1) 2017: 138-169 - [i40]Mark Zhandry:
Quantum Lightning Never Strikes the Same State Twice. CoRR abs/1711.02276 (2017) - [i39]Fermi Ma, Mark Zhandry:
Encryptor Combiners: A Unified Approach to Multiparty NIKE, (H)IBE, and Broadcast Encryption. IACR Cryptol. ePrint Arch. 2017: 152 (2017) - [i38]Qipeng Liu, Mark Zhandry:
Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness. IACR Cryptol. ePrint Arch. 2017: 209 (2017) - [i37]Sumegha Garg, Henry Yuen, Mark Zhandry:
New security notions and feasibility results for authentication of quantum data. IACR Cryptol. ePrint Arch. 2017: 538 (2017) - [i36]Fermi Ma, Mark Zhandry:
New Multilinear Maps from CLT13 with Provable Security Against Zeroizing Attacks. IACR Cryptol. ePrint Arch. 2017: 946 (2017) - [i35]Mark Zhandry, Cong Zhang:
Impossibility of Order-Revealing Encryption in Idealized Models. IACR Cryptol. ePrint Arch. 2017: 1001 (2017) - [i34]Mark Zhandry:
Quantum Lightning Never Strikes the Same State Twice. IACR Cryptol. ePrint Arch. 2017: 1080 (2017) - 2016
- [c19]Dennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, Mark Zhandry:
How to Generate and Use Universal Samplers. ASIACRYPT (2) 2016: 715-744 - [c18]Mark Zhandry:
The Magic of ELFs. CRYPTO (1) 2016: 479-508 - [c17]Eric Miles, Amit Sahai, Mark Zhandry:
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. CRYPTO (2) 2016: 629-658 - [c16]Ryo Nishimaki, Daniel Wichs, Mark Zhandry:
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. EUROCRYPT (2) 2016: 388-419 - [c15]Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry:
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits. EUROCRYPT (2) 2016: 764-791 - [c14]Mark Bun, Mark Zhandry:
Order-Revealing Encryption and the Hardness of Private Learning. TCC (A1) 2016: 176-206 - [c13]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. TCC (B2) 2016: 241-268 - [c12]Mark Zhandry:
How to Avoid Obfuscation Using Witness PRFs. TCC (A2) 2016: 421-448 - [c11]Ilan Komargodski, Mark Zhandry:
Cutting-Edge Cryptography Through the Lens of Secret Sharing. TCC (A2) 2016: 449-479 - [c10]Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry:
Functional Encryption Without Obfuscation. TCC (A2) 2016: 480-511 - [c9]Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry:
Strong Hardness of Privacy from Weak Traitor Tracing. TCC (B1) 2016: 659-689 - [i33]Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry:
Strong Hardness of Privacy from Weak Traitor Tracing. CoRR abs/1607.06141 (2016) - [i32]Sumegha Garg, Henry Yuen, Mark Zhandry:
New security notions and feasibility results for authentication of quantum data. CoRR abs/1607.07759 (2016) - [i31]Mark Zhandry:
A Note on Quantum-Secure PRPs. CoRR abs/1611.05564 (2016) - [i30]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. IACR Cryptol. ePrint Arch. 2016: 102 (2016) - [i29]Mark Zhandry:
The Magic of ELFs. IACR Cryptol. ePrint Arch. 2016: 114 (2016) - [i28]Eric Miles, Amit Sahai, Mark Zhandry:
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. IACR Cryptol. ePrint Arch. 2016: 147 (2016) - [i27]Eric Miles, Amit Sahai, Mark Zhandry:
Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks. IACR Cryptol. ePrint Arch. 2016: 588 (2016) - [i26]Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry:
Strong Hardness of Privacy from Weak Traitor Tracing. IACR Cryptol. ePrint Arch. 2016: 721 (2016) - [i25]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. IACR Cryptol. ePrint Arch. 2016: 817 (2016) - [i24]Mark Zhandry:
A Note on Quantum-Secure PRPs. IACR Cryptol. ePrint Arch. 2016: 1076 (2016) - 2015
- [b1]Mark Zhandry:
Cryptography in the age of quantum computers. Stanford University, USA, 2015 - [j1]Mark Zhandry:
A note on the quantum collision and set equality problems. Quantum Inf. Comput. 15(7&8): 557-567 (2015) - [c8]Dan Boneh, Kevin Lewi, Mariana Raykova, Amit Sahai, Mark Zhandry, Joe Zimmerman:
Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation. EUROCRYPT (2) 2015: 563-594 - [i23]Mark Bun, Mark Zhandry:
Order-Revealing Encryption and the Hardness of Private Learning. CoRR abs/1505.00388 (2015) - [i22]Mark Zhandry:
Quantum Oracle Classification - The Case of Group Structure. CoRR abs/1510.08352 (2015) - [i21]Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry:
Post-Zeroizing Obfuscation: The case of Evasive Circuits. IACR Cryptol. ePrint Arch. 2015: 167 (2015) - [i20]Mark Bun, Mark Zhandry:
Order-Revealing Encryption and the Hardness of Private Learning. IACR Cryptol. ePrint Arch. 2015: 417 (2015) - [i19]Ilan Komargodski, Mark Zhandry:
Modern Cryptography Through the Lens of Secret Sharing. IACR Cryptol. ePrint Arch. 2015: 735 (2015) - [i18]Ryo Nishimaki, Daniel Wichs, Mark Zhandry:
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. IACR Cryptol. ePrint Arch. 2015: 750 (2015) - 2014
- [c7]Dan Boneh, Brent Waters, Mark Zhandry:
Low Overhead Broadcast Encryption from Multilinear Maps. CRYPTO (1) 2014: 206-223 - [c6]Dan Boneh, Mark Zhandry:
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. CRYPTO (1) 2014: 480-499 - [i17]Dan Boneh, Brent Waters, Mark Zhandry:
Low Overhead Broadcast Encryption from Multilinear Maps. IACR Cryptol. ePrint Arch. 2014: 195 (2014) - [i16]Mark Zhandry:
How to Avoid Obfuscation Using Witness PRFs. IACR Cryptol. ePrint Arch. 2014: 301 (2014) - [i15]Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry:
Fully Secure Attribute Based Encryption from Multilinear Maps. IACR Cryptol. ePrint Arch. 2014: 622 (2014) - [i14]Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry:
Fully Secure Functional Encryption without Obfuscation. IACR Cryptol. ePrint Arch. 2014: 666 (2014) - [i13]Mark Zhandry:
Adaptively Secure Broadcast Encryption with Small System Parameters. IACR Cryptol. ePrint Arch. 2014: 757 (2014) - [i12]Amit Sahai, Mark Zhandry:
Obfuscating Low-Rank Matrix Branching Programs. IACR Cryptol. ePrint Arch. 2014: 773 (2014) - [i11]Dan Boneh, Kevin Lewi, Mariana Raykova, Amit Sahai, Mark Zhandry, Joe Zimmerman:
Semantically Secure Order-Revealing Encryption: Multi-Input Functional Encryption Without Obfuscation. IACR Cryptol. ePrint Arch. 2014: 834 (2014) - 2013
- [c5]Dan Boneh, Mark Zhandry:
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World. CRYPTO (2) 2013: 361-379 - [c4]Dan Boneh, Mark Zhandry:
Quantum-Secure Message Authentication Codes. EUROCRYPT 2013: 592-608 - [i10]Mark Zhandry:
A Note on the Quantum Collision and Set Equality Problems. CoRR abs/1312.1027 (2013) - [i9]Dan Boneh, Mark Zhandry:
Secure Signatures and Chosen Ciphertext Security in a Post-Quantum World. IACR Cryptol. ePrint Arch. 2013: 88 (2013) - [i8]Dan Boneh, Mark Zhandry:
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2013: 642 (2013) - [i7]Prabhanjan Ananth, Dan Boneh, Sanjam Garg, Amit Sahai, Mark Zhandry:
Differing-Inputs Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2013: 689 (2013) - 2012
- [c3]Mark Zhandry:
Secure Identity-Based Encryption in the Quantum Random Oracle Model. CRYPTO 2012: 758-775 - [c2]Mark Zhandry:
How to Construct Quantum Random Functions. FOCS 2012: 679-687 - [i6]Dan Boneh, Mark Zhandry:
Quantum-Secure Message Authentication Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i5]Mark Zhandry:
How to Construct Quantum Random Functions. Electron. Colloquium Comput. Complex. TR12 (2012) - [i4]Mark Zhandry:
Identity-based Encryption is Secure in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2012: 76 (2012) - [i3]Mark Zhandry:
How to Construct Quantum Random Functions. IACR Cryptol. ePrint Arch. 2012: 182 (2012) - [i2]Dan Boneh, Mark Zhandry:
Quantum-Secure Message Authentication Codes. IACR Cryptol. ePrint Arch. 2012: 606 (2012) - 2011
- [c1]Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry:
Random Oracles in a Quantum World. ASIACRYPT 2011: 41-69 - 2010
- [i1]Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry:
Random Oracles in a Quantum World. IACR Cryptol. ePrint Arch. 2010: 428 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
