
Fully KeyHomomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits.
by
D. Boneh,
C. Gentry,
S. Gorbunov,
S. Halevi,
V. Nikolaenko,
G. Segev,
V. Vaikuntanathan, and
D. Vinayagamurthy

Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBE.
by
S. Agrawal,
D. Boneh, and
X. Boyen
In proceedings of Crypto 2010, LNCS 6223, pp. 98115, 2010
[BIBTEX]
@inproceedings{ABB10b,
author = {Shweta Agrawal and Dan Boneh and Xavier Boyen},
title = {Lattice Basis Delegation in Fixed Dimension and
Shorter Ciphertext Hierarchical IBE},
year = 2010,
booktitle = {Proc. of Crypto'10},
pages = {98115},
series = {LNCS},
volume = 6223
}

Efficient lattice (H)IBE in the standard model.
by
S. Agrawal,
D. Boneh, and
X. Boyen
In proceedings of Eurocrypt 2010, LNCS 6110, pp. 553572, 2010.
[BIBTEX]
Full paper:
pdf, proceedings version:
pdf
@inproceedings{ABB10a,
author = {Shweta Agrawal and Dan Boneh and Xavier Boyen},
title = {Efficient Lattice {(H)IBE} in the Standard Model},
year = 2010,
booktitle = {Proc. of Eurocrypt'10},
series = {LNCS},
volume = 6110,
pages = {553572}
}

Hardness of computing the most significant bits of
secret keys in DiffieHellman and related schemes.
by
D. Boneh and
R. Venkatesan
In Proceedings Crypto '96,
Lecture Notes in Computer Science, Vol. 1109, SpringerVerlag,
pp. 129142, 1996

Key Homomorphic PRFs and Their Applications.
by
D. Boneh,
K. Lewi,
H. Montgomery, and
A. Raghunathan
@inproceedings{BLMR13,
author = {Dan Boneh and
Kevin Lewi and
Hart William Montgomery and
Ananth Raghunathan},
title = {Key Homomorphic PRFs and Their Applications},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {410428}
}

Random Oracles in a Quantum World.
by
D. Boneh,
Ö. Dagdelen,
M. Fischlin,
A. Lehmann,
C. Schaffner, and
M. Zhandry
In proceedings of Asiacrypt 2011, LNCS 7073, pp. 4169, 2011.
[BIBTEX]
@inproceedings{BDFLSZ11,
author = {D. Boneh and {\"O}zg{\"u}r Dagdelen and Marc Fischlin and
Anja Lehmann and Christian Schaffner and Mark Zhandry},
title = {Random Oracles in a Quantum World},
booktitle = {Proc. of Asiacrypt 2011},
series = {{LNCS}},
pages = {4169},
number = {7073},
year = {2011}
}

Homomorphic Signatures for Polynomial Functions.
by
D. Boneh and
D. Freeman
In proceedings of Eurocrypt 2011, LNCS 6632, pp. 149168, 2011.
[BIBTEX]
@misc{BF11ec,
author = {Dan Boneh and David Freeman},
title = {Homomorphic Signatures for Polynomial Functions},
booktitle = {Proc. of Eurocrypt'11},
year = {2011},
series = {{LNCS}},
pages = {149168}
}

Linearly homomorphic signatures over binary fields and new tools for latticebased signatures.
by
D. Boneh and
D. Freeman
In proceedings of PKC'11, LNCS 6571, pp. 116.

Factoring N=p^{r}q for large r.
by
D. Boneh,
G. Durfee, and
N. HowgraveGraham
In Proceedings Crypto '99, Lecture Notes in Computer Science, Vol. 1666, SpringerVerlag, pp. 326337, 1999

Cryptanalysis of RSA with private key d less
than N^{0.292}.
by
D. Boneh and
G. Durfee
IEEE Transactions on Information Theory, Vol 46, No. 4, pp. 13391349,
July 2000
Extended abstract in proceedings of Eurocrypt 1998

The Modular Inversion Hidden Number Problem.
by
D. Boneh,
S. Halevi, and
N. HowgraveGraham
In proceedings of Asiacrypt '01, LNCS Vol. 2248,
SpringerVerlag, pp. 3651, 2001

Rounding in lattices and its cryptographic applications.
by
D. Boneh and
R. Venkatesan
In Proceedings of SODA 1997, pp. 675681

Efficient Selective IdentityBased Encryption Without Random Oracles.
by
D. Boneh and
X. Boyen
Journal of Cryptology (JOC), 24 (4):659693, 2011.
Extended abstract in proceedings of Eurocrypt 2004, LNCS 3027, pp. 223238, 2004
[BIBTEX]
@article{BF04,
author = {Dan Boneh and Xavier Boyen},
title = {Efficient Selective IdentityBased Encryption Without Random Oracles},
journal = {Journal of Cryptology (JoC)},
volume = 24,
number = 4,
pages = {659693},
year = 2011,
note = {early version in Eurocrypt 2004}
}

Short Signatures Without Random Oracles.
by
D. Boneh and
X. Boyen
Journal of Cryptology, 21(2), pp. 149177, 2008.
Extended abstract in proceedings of Eurocrypt 2004, LNCS 3027, pp. 5673, 2004

Identity based encryption from the Weil pairing.
by
D. Boneh and
M. Franklin
SIAM J. of Computing, Vol. 32, No. 3, pp. 586615, 2003
Extended abstract in Crypto 2001, LNCS 2139, pp. 213229, 2001.
[BIBTEX]
@article{BFibe,
author = {Dan Boneh and Matt Franklin},
title = {IdentityBased Encryption from the {Weil} Pairing},
journal = {SIAM J. of Computing},
year = 2003,
volume = 32,
number = 3,
pages = {586615},
note = {extended abstract in Crypto'01}
}

A Survey of Two Signature Aggregation Techniques.
by
D. Boneh,
C. Gentry,
B. Lynn, and
H. Shacham

Constrained Pseudorandom Functions and Their Applications.
by
D. Boneh and
B. Waters

FunctionPrivate SubspaceMembership Encryption and Its Applications.
by
D. Boneh,
A. Raghunathan, and
G. Segev

FunctionPrivate IdentityBased Encryption: Hiding the Function in Functional Encryption.
by
D. Boneh,
A. Raghunathan, and
G. Segev
@inproceedings{BRS13,
author = {Dan Boneh and
Ananth Raghunathan and
Gil Segev},
title = {FunctionPrivate IdentityBased Encryption: Hiding the Function
in Functional Encryption},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {461478},
}

MessageLocked Encryption for LockDependent Messages.
by
M. Abadi,
D. Boneh,
I. Mironov,
A. Raghunathan, and
G. Segev
@inproceedings{ABMRS13,
author = {Mart\'{\i}n Abadi and
Dan Boneh and
Ilya Mironov and
Ananth Raghunathan and
Gil Segev},
title = {MessageLocked Encryption for LockDependent Messages},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {374391}
}

Functional encryption: definitions and challenges.
by
D. Boneh,
A. Sahai, and
B. Waters
In proceedings of TCC'11, LNCS 6597, pp. 253273.

Algebraic pseudorandom functions with improved efficiency from
the augmented cascade.
by
D. Boneh,
H. Montgomery, and
A. Raghunathan
In proceedings of the 17'th ACM conference on Computer and
Communications Security (
CCS),
2010.
[BIBTEX]
@inproceedings{BMR10,
author = {Dan Boneh and Hart Montogomery and Ananth Raghunathan},
title = {Algebraic Pseudorandom Functions with Improved Efficiency
from the Augmented Cascade},
year = 2010,
booktitle = {Proc. of ACM CCS'10}
}

Finding composite order ordinary elliptic curves using the CocksPinch method.
by
D. Boneh,
K. Rubin, and
A. Silverberg
Journal of Number Theory, Vol. 131 (5), 2011, pp. 832841.
[BIBTEX]
@article{BRS11,
author = {Dan Boneh and Karl Rubin and Alice Silverberg},
title = {Finding composite order ordinary elliptic curves using the CocksPinch method},
journal = {Journal of Number Theory},
volume = 131,
number = 5,
year = 2011,
pages = {832841},
note = {Cryptology ePrint Archive, Report 2009/533}
}

Signing a Linear Subspace: Signature Schemes for Network Coding.
by
D. Boneh,
D. Freeman,
J. Katz, and
B. Waters
In proceedings of PKC 2009, LNCS 5443, pp. 6887.

Generalized Identity Based and Broadcast Encryption Schemes.
by
D. Boneh and
M. Hamburg
In proceedings of Asiacrypt 2008, LNCS 5350, pp. 455470

Cryptographic Methods for Storing Ballots on a Voting Machine.
by
J. Bethencourt,
D. Boneh, and
B. Waters
In proceedings of the 14th Annual Network & Distributed System Security
Conference (NDSS 2007)

Conjunctive, subset, and range queries on encrypted data.
by
D. Boneh and
B. Waters
In proceedings of TCC'07, LNCS 4392, pp. 535554, 2007

A collusion resistant broadcast, trace and revoke system.
by
D. Boneh and
B. Waters
In proceedings of ACM CCS '06, pp. 211220, 2006

Fully Collusion Resistant Traitor Tracing With Short Ciphertexts and Private Keys.
by
D. Boneh,
A. Sahai, and
B. Waters
In proceedings of Eurocrypt '06, LNCS 4004, 2006, pp. 573592

Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles.
by
D. Boneh,
X. Boyen, and
S. Halevi
In proceedings of RSACT '06, LNCS 3860, pp. 226243, 2006

Collusion Resistant Broadcast Encryption With Short Ciphertexts
and Private Keys.
by
D. Boneh,
C. Gentry, and
B. Waters
In proceedings of Crypto '05, LNCS 3621, pp. 258275, 2005

Hierarchical Identity Based Encryption with Constant Size Ciphertext.
by
D. Boneh,
E. Goh, and
X. Boyen
In proceedings of Eurocrypt '05, LNCS 3493, pp. 440456

Evaluating 2DNF Formulas on Ciphertexts.
by
D. Boneh,
E. Goh, and
K. Nissim
In proceedings of Theory of Cryptography (TCC) '05, LNCS 3378,
pp. 325341, 2005

Group Signatures with VerifierLocal Revocation.
by
D. Boneh and
H. Shacham
In proceedings of the 11'th ACM conference on Computer and Communications Security (CCS), pp. 168177, 2004

Short Group Signatures.
by
D. Boneh,
X. Boyen, and
H. Shacham
In proceedings of Crypto '04, LNCS 3152, pp. 4155, 2004

Secure Identity Based Encryption Without Random Oracles.
by
D. Boneh and
X. Boyen
In proceedings of Crypto '04, LNCS 3152, 2004

Public key encryption with keyword search.
by
D. Boneh,
G. Di Crescenzo,
R. Ostrovsky, and
G. Persiano
In proceedings of Eurocrypt 2004, LNCS 3027, pp. 506522, 2004

A Secure Signature Scheme from Bilinear Maps.
by
D. Boneh,
I. Mironov, and
Victor Shoup
In proceedings of RSACT '03, LNCS 2612, pp. 98110

Oblivious SignatureBased Envelope.
by
Ninghui Li,
W. Du, and
D. Boneh
Distributed Computing 17(4), pp. 293302, May 2005
Extended abstract in proceedings of the 22nd ACM Symposium on Principles
of Distributed Computing (PODC), pp. 182189, 2003

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps.
by
D. Boneh,
C. Gentry,
H. Shacham, and
B. Lynn
In proceedings of Eurocrypt 2003, LNCS 2656, pp. 416432, 2003

Applications of Multilinear Forms to Cryptography.
by
D. Boneh and
A. Silverberg
Contemporary Mathematics Vol. 324, American Mathematical Society,
pp. 7190, 2003

Short signatures from the Weil pairing.
by
D. Boneh,
H. Shacham, and
B. Lynn
J. of Cryptology, Vol. 17, No. 4, pp. 297319, 2004
Extended abstract in Asiacrypt 2001

Cryptanalysis of RSA with private key d less
than N^{0.292}.
by
D. Boneh and
G. Durfee
IEEE Transactions on Information Theory, Vol 46, No. 4, pp. 13391349,
July 2000
Extended abstract in proceedings of Eurocrypt 1998

Efficient generation of shared RSA keys.
by
D. Boneh and
M. Franklin
Journal of the ACM (JACM), Vol. 48, Issue 4, pp. 702722, July 2001
Extended abstract in proceedings of Crypto '97

Twenty years of attacks on the RSA cryptosystem.
by
D. Boneh
Notices of the
American Mathematical Society (AMS), Vol. 46, No. 2, pp. 203213, 1999

Bivariate Polynomials Modulo Composites and Their Applications.
by
D. Boneh and
H. CorriganGibbs
In proceedings of Asiacrypt 2014, LNCS 8873, pp. 4262

Ensuring highquality randomness in cryptographic key generation.
by
H. CorriganGibbs,
W. Mu,
D. Boneh, and
B. Ford
@inproceedings{CMBF13,
author = {Henry CorriganGibbs and
Wendy Mu and
Dan Boneh and
Bryan Ford},
title = {Ensuring highquality randomness in cryptographic key generation},
booktitle = {ACM Conference on Computer and Communications Security},
year = {2013},
pages = {685696}
}

Random Oracles in a Quantum World.
by
D. Boneh,
Ö. Dagdelen,
M. Fischlin,
A. Lehmann,
C. Schaffner, and
M. Zhandry
In proceedings of Asiacrypt 2011, LNCS 7073, pp. 4169, 2011.
[BIBTEX]
@inproceedings{BDFLSZ11,
author = {D. Boneh and {\"O}zg{\"u}r Dagdelen and Marc Fischlin and
Anja Lehmann and Christian Schaffner and Mark Zhandry},
title = {Random Oracles in a Quantum World},
booktitle = {Proc. of Asiacrypt 2011},
series = {{LNCS}},
pages = {4169},
number = {7073},
year = {2011}
}

Evaluating 2DNF Formulas on Ciphertexts.
by
D. Boneh,
E. Goh, and
K. Nissim
In proceedings of Theory of Cryptography (TCC) '05, LNCS 3378,
pp. 325341, 2005

Fast variants of RSA.
by
D. Boneh and
H. Shacham
CryptoBytes, Vol. 5, No. 1, pp. 19, 2002

A Method for Fast Revocation of Public Key Certificates and
Security Capabilities.
by
D. Boneh,
X. Ding,
G. Tsudik, and
M. Wong
In proceedings of the 10th USENIX Security Symposium, pp. 297308

Why Textbook ElGamal and RSA Encryption are Insecure.
by
D. Boneh,
A. Joux, and
P. Nguyen
In Proceedings AsiaCrypt '00, Lecture Notes in Computer Science, Vol. 1976, SpringerVerlag, pp. 3044, 2000

Generating RSA Keys on a Handheld Using an Untrusted Server.
by
N. Modadugu,
D. Boneh, and
M. Kim
In proceedings of Indocrypt 2000, LNCS 1977, pp. 271282, 2000

Factoring N=p^{r}q for large r.
by
D. Boneh,
G. Durfee, and
N. HowgraveGraham
In Proceedings Crypto '99, Lecture Notes in Computer Science, Vol. 1666, SpringerVerlag, pp. 326337, 1999

Experimenting with Shared Generation of RSA keys.
by
M. Malkin,
T. Wu, and
D. Boneh
In proceedings of the Internet Society's 1999 Symposium on Network and Distributed System Security (NDSS), pp. 4356

An attack on RSA given a small fraction of the private key bits.
by
D. Boneh,
G. Durfee, and
Y. Frankel
In proceedings AsiaCrypt '98,
Lecture Notes in Computer Science, Vol. 1514, SpringerVerlag,
pp. 2534, 1998

Generating a Product of Three Primes With an Unknown Factorization.
by
D. Boneh and
J. Horwitz
In Proceedings of the third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, SpringerVerlag, pp. 237251, 1998

Breaking RSA may not be equivalent to factoring.
by
D. Boneh and
R. Venkatesan
In Proceedings Eurocrypt '98, Lecture Notes in Computer Science,
Vol. 1233, SpringerVerlag, pp. 5971, 1998

On the importance of checking cryptographic protocols for faults.
by
D. Boneh,
R. DeMillo, and
R. Lipton
Journal of Cryptology, SpringerVerlag, Vol. 14, No. 2, pp. 101119, 2001
Extended abstract in proceedings of Eurocrypt '97

Simplified OAEP for the RSA and Rabin functions.
by
D. Boneh
In proceedings of Crypto '2001, Lecture Notes in Computer Science, Vol. 2139, SpringerVerlag, pp. 275291, 2001

Timed Commitments.
by
D. Boneh and
M. Naor
In proceedings of Crypto '2000, Santa Barbara, LNCS 1880, Springer Verlag, pp. 236254, 2000

Hardness of computing the most significant bits of
secret keys in DiffieHellman and related schemes.
by
D. Boneh and
R. Venkatesan
In Proceedings Crypto '96,
Lecture Notes in Computer Science, Vol. 1109, SpringerVerlag,
pp. 129142, 1996

The decision DiffieHellman problem.
by
D. Boneh
In Proceedings of the Third Algorithmic Number Theory Symposium,
Lecture Notes in Computer Science, Vol. 1423, SpringerVerlag, pp. 4863, 1998

Algebraic pseudorandom functions with improved efficiency from
the augmented cascade.
by
D. Boneh,
H. Montgomery, and
A. Raghunathan
In proceedings of the 17'th ACM conference on Computer and
Communications Security (
CCS),
2010.
[BIBTEX]
@inproceedings{BMR10,
author = {Dan Boneh and Hart Montogomery and Ananth Raghunathan},
title = {Algebraic Pseudorandom Functions with Improved Efficiency
from the Augmented Cascade},
year = 2010,
booktitle = {Proc. of ACM CCS'10}
}

CircularSecure Encryption from Decision DiffieHellman.
by
D. Boneh,
S. Halevi,
M. Hamburg, and
R. Ostrovsky
In proceedings of Crypto 2008, LNCS 5157, pp. 108125.

Why Textbook ElGamal and RSA Encryption are Insecure.
by
D. Boneh,
A. Joux, and
P. Nguyen
In Proceedings AsiaCrypt '00, Lecture Notes in Computer Science, Vol. 1976, SpringerVerlag, pp. 3044, 2000

Breaking generalized DiffieHellman modulo a composite is no easier
than factoring.
by
E. Biham,
D. Boneh, and
O. Reingold
In Information Processing Letters (IPL), Vol. 70, 1999, pp. 8387

Algorithms for black box fields and their application to cryptography.
by
D. Boneh and
R. Lipton
In Proceedings Crypto '96, Lecture Notes in Computer Science,
Vol. 1109, SpringerVerlag, pp. 283297, 1996

Quantum cryptanalysis of hidden linear forms.
by
D. Boneh and
R. Lipton
In Proceedings of Crypto '95, Lecture Notes in Computer Science, Vol. 963, SpringerVerlag, pp. 424437, 1995

On the Unpredictability of Bits of the Elliptic Curve DiffieHellman Scheme.
by
D. Boneh and
I. Shparlinski
In proceedings of Crypto '2001, Lecture Notes in Computer Science, Vol. 2139, SpringerVerlag, pp. 201212, 2001

SpaceEfficient Identity Based Encryption Without Pairings.
by
D. Boneh,
C. Gentry, and
M. Hamburg
In proceedings of FOCS 2007, pp. 647657, 2007

Efficient Selective IdentityBased Encryption Without Random Oracles.
by
D. Boneh and
X. Boyen
Journal of Cryptology (JOC), 24 (4):659693, 2011.
Extended abstract in proceedings of Eurocrypt 2004, LNCS 3027, pp. 223238, 2004
[BIBTEX]
@article{BF04,
author = {Dan Boneh and Xavier Boyen},
title = {Efficient Selective IdentityBased Encryption Without Random Oracles},
journal = {Journal of Cryptology (JoC)},
volume = 24,
number = 4,
pages = {659693},
year = 2011,
note = {early version in Eurocrypt 2004}
}

Identity based encryption from the Weil pairing.
by
D. Boneh and
M. Franklin
SIAM J. of Computing, Vol. 32, No. 3, pp. 586615, 2003
Extended abstract in Crypto 2001, LNCS 2139, pp. 213229, 2001.
[BIBTEX]
@article{BFibe,
author = {Dan Boneh and Matt Franklin},
title = {IdentityBased Encryption from the {Weil} Pairing},
journal = {SIAM J. of Computing},
year = 2003,
volume = 32,
number = 3,
pages = {586615},
note = {extended abstract in Crypto'01}
}

Fully KeyHomomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits.
by
D. Boneh,
C. Gentry,
S. Gorbunov,
S. Halevi,
V. Nikolaenko,
G. Segev,
V. Vaikuntanathan, and
D. Vinayagamurthy

FunctionPrivate SubspaceMembership Encryption and Its Applications.
by
D. Boneh,
A. Raghunathan, and
G. Segev

FunctionPrivate IdentityBased Encryption: Hiding the Function in Functional Encryption.
by
D. Boneh,
A. Raghunathan, and
G. Segev
@inproceedings{BRS13,
author = {Dan Boneh and
Ananth Raghunathan and
Gil Segev},
title = {FunctionPrivate IdentityBased Encryption: Hiding the Function
in Functional Encryption},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {461478},
}

Functional encryption: definitions and challenges.
by
D. Boneh,
A. Sahai, and
B. Waters
In proceedings of TCC'11, LNCS 6597, pp. 253273.

Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBE.
by
S. Agrawal,
D. Boneh, and
X. Boyen
In proceedings of Crypto 2010, LNCS 6223, pp. 98115, 2010
[BIBTEX]
@inproceedings{ABB10b,
author = {Shweta Agrawal and Dan Boneh and Xavier Boyen},
title = {Lattice Basis Delegation in Fixed Dimension and
Shorter Ciphertext Hierarchical IBE},
year = 2010,
booktitle = {Proc. of Crypto'10},
pages = {98115},
series = {LNCS},
volume = 6223
}

Efficient lattice (H)IBE in the standard model.
by
S. Agrawal,
D. Boneh, and
X. Boyen
In proceedings of Eurocrypt 2010, LNCS 6110, pp. 553572, 2010.
[BIBTEX]
Full paper:
pdf, proceedings version:
pdf
@inproceedings{ABB10a,
author = {Shweta Agrawal and Dan Boneh and Xavier Boyen},
title = {Efficient Lattice {(H)IBE} in the Standard Model},
year = 2010,
booktitle = {Proc. of Eurocrypt'10},
series = {LNCS},
volume = 6110,
pages = {553572}
}

On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.
by
D. Boneh,
A. Papakonstantinou,
C. Rackoff,
Y. Vahlis, and
B. Waters
In proceedings of FOCS 2008, pp. 283292

Generalized Identity Based and Broadcast Encryption Schemes.
by
D. Boneh and
M. Hamburg
In proceedings of Asiacrypt 2008, LNCS 5350, pp. 455470

Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles.
by
D. Boneh,
X. Boyen, and
S. Halevi
In proceedings of RSACT '06, LNCS 3860, pp. 226243, 2006

ChosenCiphertext Security from IdentityBased Encryption.
by
D. Boneh,
R. Canetti,
S. Halevi, and
J. Katz
SIAM J. of Computing (SICOMP), Volume 36, Issue 5, pp. 915942, 2006

Hierarchical Identity Based Encryption with Constant Size Ciphertext.
by
D. Boneh,
E. Goh, and
X. Boyen
In proceedings of Eurocrypt '05, LNCS 3493, pp. 440456

Improved Efficiency for CCASecure Cryptosystems Built Using
Identity Based Encryption.
by
D. Boneh and
J. Katz
In proceedings of RSACT '05, LNCS 3376, pp. 87103, 2005

Secure Identity Based Encryption Without Random Oracles.
by
D. Boneh and
X. Boyen
In proceedings of Crypto '04, LNCS 3152, 2004

Short Signatures Without Random Oracles.
by
D. Boneh and
X. Boyen
Journal of Cryptology, 21(2), pp. 149177, 2008.
Extended abstract in proceedings of Eurocrypt 2004, LNCS 3027, pp. 5673, 2004

A Survey of Two Signature Aggregation Techniques.
by
D. Boneh,
C. Gentry,
B. Lynn, and
H. Shacham

Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World.
by
D. Boneh and
M. Zhandry
@inproceedings{BZ13b,
author = {Dan Boneh and
Mark Zhandry},
title = {Secure Signatures and Chosen Ciphertext Security in a Quantum
Computing World},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {361379}
}

Homomorphic Signatures for Polynomial Functions.
by
D. Boneh and
D. Freeman
In proceedings of Eurocrypt 2011, LNCS 6632, pp. 149168, 2011.
[BIBTEX]
@misc{BF11ec,
author = {Dan Boneh and David Freeman},
title = {Homomorphic Signatures for Polynomial Functions},
booktitle = {Proc. of Eurocrypt'11},
year = {2011},
series = {{LNCS}},
pages = {149168}
}

Computing on Authenticated Data.
by
J.H. Ahn,
D. Boneh,
J. Camenisch,
S. Hohenberger,
A. Shelat, and
B. Waters
In proceedings of
TCC'12,
LNCS 7194, pp. 120, 2012
J. Cryptology 28(2): 351395 (2015)
[BIBTEX]
@inproceedings{quoting,
author = {Jae Hyun Ahn and Dan Boneh and Jan Camenisch and
Susan Hohenberger and Abhi Shelat and Brent Waters},
title = {Computing on Authenticated Data},
booktitle = {Proc. of {TCC}},
series = {{LNCS}},
number = 7194,
year = {2012},
note = {\url{http://eprint.iacr.org/2011/096}},
}

Linearly homomorphic signatures over binary fields and new tools for latticebased signatures.
by
D. Boneh and
D. Freeman
In proceedings of PKC'11, LNCS 6571, pp. 116.

Preventing pollution attacks in multisource network coding.
by
S. Agrawal,
D. Boneh,
X. Boyen, and
D. Freeman
In proceedings of PKC 2010.

Signing a Linear Subspace: Signature Schemes for Network Coding.
by
D. Boneh,
D. Freeman,
J. Katz, and
B. Waters
In proceedings of PKC 2009, LNCS 5443, pp. 6887.

Strongly Unforgeable Signatures Based on Computational DiffieHellman.
by
D. Boneh,
E. Shen, and
B. Waters
In proceedings of PKC '06, LNCS 3958, pp. 229240, 2006

Group Signatures with VerifierLocal Revocation.
by
D. Boneh and
H. Shacham
In proceedings of the 11'th ACM conference on Computer and Communications Security (CCS), pp. 168177, 2004

Short Group Signatures.
by
D. Boneh,
X. Boyen, and
H. Shacham
In proceedings of Crypto '04, LNCS 3152, pp. 4155, 2004

A Secure Signature Scheme from Bilinear Maps.
by
D. Boneh,
I. Mironov, and
Victor Shoup
In proceedings of RSACT '03, LNCS 2612, pp. 98110

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps.
by
D. Boneh,
C. Gentry,
H. Shacham, and
B. Lynn
In proceedings of Eurocrypt 2003, LNCS 2656, pp. 416432, 2003

Short signatures from the Weil pairing.
by
D. Boneh,
H. Shacham, and
B. Lynn
J. of Cryptology, Vol. 17, No. 4, pp. 297319, 2004
Extended abstract in Asiacrypt 2001

Constrained Pseudorandom Functions and Their Applications.
by
D. Boneh and
B. Waters

Key Homomorphic PRFs and Their Applications.
by
D. Boneh,
K. Lewi,
H. Montgomery, and
A. Raghunathan
@inproceedings{BLMR13,
author = {Dan Boneh and
Kevin Lewi and
Hart William Montgomery and
Ananth Raghunathan},
title = {Key Homomorphic PRFs and Their Applications},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {410428}
}

QuantumSecure Message Authentication Codes.
by
D. Boneh and
M. Zhandry
@inproceedings{BZ13,
author = {Dan Boneh and
Mark Zhandry},
title = {QuantumSecure Message Authentication Codes},
booktitle = {Proc. of Eurocrypt},
year = {2013},
pages = {592608},
series = {{LNCS}},
volume = 7881
}

Algebraic pseudorandom functions with improved efficiency from
the augmented cascade.
by
D. Boneh,
H. Montgomery, and
A. Raghunathan
In proceedings of the 17'th ACM conference on Computer and
Communications Security (
CCS),
2010.
[BIBTEX]
@inproceedings{BMR10,
author = {Dan Boneh and Hart Montogomery and Ananth Raghunathan},
title = {Algebraic Pseudorandom Functions with Improved Efficiency
from the Augmented Cascade},
year = 2010,
booktitle = {Proc. of ACM CCS'10}
}

Homomorphic MACs: MACBased Integrity for Network Coding.
by
S. Agrawal and
D. Boneh
In proceedings of ACNS 2009, LNCS 5536, pp. 292305

On the impossibility of efficiently combining collision resistant
hash functions.
by
D. Boneh and
X. Boyen
In proceedings of Crypto '06, LNCS 4117, pp. 570583, 2006

Lower Bounds for Multicast Message Authentication.
by
D. Boneh,
G. Durfee, and
M. Franklin
In proceedings of Eurocrypt '2001, Lecture Notes in Computer Science, Vol. 2045, SpringerVerlag, pp. 437452, 2001

Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World.
by
D. Boneh and
M. Zhandry
@inproceedings{BZ13b,
author = {Dan Boneh and
Mark Zhandry},
title = {Secure Signatures and Chosen Ciphertext Security in a Quantum
Computing World},
booktitle = {Proc. of Crypto},
series = {{LNCS}},
volume = 8043
year = {2013},
pages = {361379}
}

QuantumSecure Message Authentication Codes.
by
D. Boneh and
M. Zhandry
@inproceedings{BZ13,
author = {Dan Boneh and
Mark Zhandry},
title = {QuantumSecure Message Authentication Codes},
booktitle = {Proc. of Eurocrypt},
year = {2013},
pages = {592608},
series = {{LNCS}},
volume = 7881
}

Random Oracles in a Quantum World.
by
D. Boneh,
Ö. Dagdelen,
M. Fischlin,
A. Lehmann,
C. Schaffner, and
M. Zhandry
In proceedings of Asiacrypt 2011, LNCS 7073, pp. 4169, 2011.
[BIBTEX]
@inproceedings{BDFLSZ11,
author = {D. Boneh and {\"O}zg{\"u}r Dagdelen and Marc Fischlin and
Anja Lehmann and Christian Schaffner and Mark Zhandry},
title = {Random Oracles in a Quantum World},
booktitle = {Proc. of Asiacrypt 2011},
series = {{LNCS}},
pages = {4169},
number = {7073},
year = {2011}
}

Quantum cryptanalysis of hidden linear forms.
by
D. Boneh and
R. Lipton
In Proceedings of Crypto '95, Lecture Notes in Computer Science, Vol. 963, SpringerVerlag, pp. 424437, 1995