List of works - Dan Boneh

Adversarial Training and Robustness for Multiple Perturbations ⬇️

An Efficient Public Key Traitor Tracing Scheme

article

An Experimental Study of TLS Forward Secrecy Deployments

scientific article published in November 2014

Breaking RSA may not be equivalent to factoring

Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring

scientific article (publication date: April 1999)

Bulletproofs: Short Proofs for Confidential Transactions and More

scientific article published in 2018

Deriving genomic diagnoses without revealing patient genomes

scientific article published in August 2017

Do Users Write More Insecure Code with AI Assistants?

scientific article published on 21 November 2023

Efficient Lattice (H)IBE in the Standard Model

article

Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles

Efficient generation of shared RSA keys

Finding composite order ordinary elliptic curves using the Cocks–Pinch method

scientific article published in May 2011

Identity-Based Encryption from the Weil Pairing

Incentive compatibility of bitcoin mining pool reward functions

conference paper published in 2016

On the computational power of DNA

On the effectiveness of address-space randomization

Provisions: Privacy-preserving proofs of solvency for bitcoin exchanges ⬇️

conference paper published in 2015

Reliable Location-Based Services from Radio Navigation Systems ⬇️

scientific article published on December 13, 2010

Short Signatures Without Random Oracles

scientific paper presented at EUROCRYPT 2004

Short Signatures from the Weil Pairing

The Decision Diffie-Hellman problem

The Space of Transferable Adversarial Examples

scholarly article

Twenty Years of attacks on the RSA Cryptosystem ⬇️

article

List of works by Dan Boneh

Adversarial Training and Robustness for Multiple Perturbations ⬇️

An Efficient Public Key Traitor Tracing Scheme

An Experimental Study of TLS Forward Secrecy Deployments

Breaking RSA may not be equivalent to factoring

Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring

Bulletproofs: Short Proofs for Confidential Transactions and More

Deriving genomic diagnoses without revealing patient genomes

Do Users Write More Insecure Code with AI Assistants?

Efficient Lattice (H)IBE in the Standard Model

Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles

Efficient generation of shared RSA keys

Finding composite order ordinary elliptic curves using the Cocks–Pinch method

Identity-Based Encryption from the Weil Pairing

Incentive compatibility of bitcoin mining pool reward functions

On the computational power of DNA

On the effectiveness of address-space randomization

Provisions: Privacy-preserving proofs of solvency for bitcoin exchanges ⬇️

Reliable Location-Based Services from Radio Navigation Systems ⬇️

Short Signatures Without Random Oracles

Short Signatures from the Weil Pairing

The Decision Diffie-Hellman problem

The Space of Transferable Adversarial Examples

Twenty Years of attacks on the RSA Cryptosystem ⬇️