Dan Boneh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Dan Boneh has a total of 116 co-authors. Here are the top co-authors by number of shared publications:
- Aditi Partap
Stanford University
5 shared publications Amit Sahai
UCLA
4 shared publications- Lior Rotem
Stanford University
4 shared publications - Binyi Chen
Stanford University
3 shared publications David J. Wu
Department of Computer Science, University of Virginia
3 shared publications- Florian Tramèr
Google research
3 shared publications
Latest Publications
- Open Access
- 2 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 309-310
Poster: Mapping Post-Quantum Migration Across the EVM Stack
- 2 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 309-310
Open AccessPoster: Mapping Post-Quantum Migration Across the EVM Stack
- Top Cited PapersOpen Access
- 21 August 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (3) , 031001
Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
The expected emergence of cryptographically relevant quantum computers (CRQCs) will represent a singular discontinuity in the history of digital security, with wide ranging impacts. This Perspective seeks to elucidate specific implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and potential mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem over the secp256k1 curve, the core of modern blockchain cryptography. We demonstrate that Shor’s algorithm for this problem can execute with either ≤ 1200 logical qubits and ≤ 90 million Toffoli gates or ≤ 1450 logical qubits and ≤ 70 million Toffoli gates. In the interest of responsible disclosure, we use a zero-knowledge proof to validate these results without disclosing attack vectors. On superconducting architectures with 10 − 3 physical error rates and planar connectivity, those circuits can execute in minutes using fewer than half a million physical qubits. We introduce a critical distinction between “fast-clock” (such as superconducting and photonic) and “slow-clock” (such as neutral atom and ion trap) architectures. Our analysis reveals that the first fast-clock CRQCs would enable “on-spend” attacks on public mempool transactions of some cryptocurrencies. We survey major cryptocurrency vulnerabilities through this lens, identifying systemic risks associated with advanced features in some blockchains such as smart contracts, proof-of-stake consensus, and data availability sampling mechanism, as well as the enduring concern of “abandoned” assets. We argue that technical solutions would benefit from accompanying public policy and discuss various frameworks of “digital salvage” to regulate the recovery or destruction of dormant assets while preventing adversarial seizure. We also discuss implications for other digital assets and tokenization as well as challenges and successful examples of the ongoing transition to post-quantum cryptography (PQC). Finally, we urge all vulnerable cryptocurrency communities to join the migration to PQC without delay.
- 21 August 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (3) , 031001
Top Cited PapersOpen AccessSecuring Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
The expected emergence of cryptographically relevant quantum computers (CRQCs) will represent a singular discontinuity in the history of digital security, with wide ranging impacts. This Perspective seeks to elucidate specific implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and potential mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem over the secp256k1 curve, the core of modern blockchain cryptography. We demonstrate that Shor’s algorithm for this problem can execute with either ≤ 1200 logical qubits and ≤ 90 million Toffoli gates or ≤ 1450 logical qubits and ≤ 70 million Toffoli gates. In the interest of responsible disclosure, we use a zero-knowledge proof to validate these results without disclosing attack vectors. On superconducting architectures with 10 − 3 physical error rates and planar connectivity, those circuits can execute in minutes using fewer than half a million physical qubits. We introduce a critical distinction between “fast-clock” (such as superconducting and photonic) and “slow-clock” (such as neutral atom and ion trap) architectures. Our analysis reveals that the first fast-clock CRQCs would enable “on-spend” attacks on public mempool transactions of some cryptocurrencies. We survey major cryptocurrency vulnerabilities through this lens, identifying systemic risks associated with advanced features in some blockchains such as smart contracts, proof-of-stake consensus, and data availability sampling mechanism, as well as the enduring concern of “abandoned” assets. We argue that technical solutions would benefit from accompanying public policy and discuss various frameworks of “digital salvage” to regulate the recovery or destruction of dormant assets while preventing adversarial seizure. We also discuss implications for other digital assets and tokenization as well as challenges and successful examples of the ongoing transition to post-quantum cryptography (PQC). Finally, we urge all vulnerable cryptocurrency communities to join the migration to PQC without delay.
- 11 August 2026
- Published by Springer Nature
- p. 36-67
Efficient Batch Threshold Encryption Using Partial Fraction Techniques
- 11 August 2026
- Published by Springer Nature
- p. 36-67
Efficient Batch Threshold Encryption Using Partial Fraction Techniques
- 8 December 2025
- Published by Springer Nature
- p. 330-362
LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems
- 8 December 2025
- Published by Springer Nature
- p. 330-362
LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 338-370
Homomorphic Encryption for Large Integers from Nested Residue Number Systems
- 17 August 2025
- Published by Springer Nature
- p. 338-370
Open AccessHomomorphic Encryption for Large Integers from Nested Residue Number Systems
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 327-361
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
- 17 August 2025
- Published by Springer Nature
- p. 327-361
Open AccessLatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 203-234
Traceable Verifiable Random Functions
- 17 August 2025
- Published by Springer Nature
- p. 203-234
Open AccessTraceable Verifiable Random Functions
- 10 May 2025
- Published by Springer Nature
- p. 285-287
BLS Short Digital Signatures
- 10 May 2025
- Published by Springer Nature
- p. 664-665
Digital Signature Standard
- 10 May 2025
- Published by Springer Nature
- p. 2545
Strong RSA Assumption