David Mandell Freeman

David Freeman

Stanford University

	2012
32		David Mandell Freeman: Improved Security for Linearly Homomorphic Signatures: A Generic Framework. Public Key Cryptography 2012: 697-714
31		David Mandell Freeman: Improved Security for Linearly Homomorphic Signatures: A Generic Framework. IACR Cryptology ePrint Archive 2012: 60 (2012)
	2011
30		Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan: Functional Encryption for Inner Product Predicates from Learning with Errors. ASIACRYPT 2011: 21-40
29		Dan Boneh, David Mandell Freeman: Homomorphic Signatures for Polynomial Functions. EUROCRYPT 2011: 149-168
28		Markus Dürmuth, David Mandell Freeman: Deniable Encryption with Negligible Detection Probability: An Interactive Construction. EUROCRYPT 2011: 610-626
27		Dan Boneh, David Mandell Freeman: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures. Public Key Cryptography 2011: 1-16
26		Dan Boneh, David Mandell Freeman: Homomorphic Signatures for Polynomial Functions. IACR Cryptology ePrint Archive 2011: 18 (2011)
25		Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan: Functional Encryption for Inner Product Predicates from Learning with Errors. IACR Cryptology ePrint Archive 2011: 410 (2011)
24		Markus Dürmuth, David Mandell Freeman: Deniable Encryption with Negligible Detection Probability: An Interactive Construction. IACR Cryptology ePrint Archive 2011: 66 (2011)
	2010
23		Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman: Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures. ASIACRYPT 2010: 519-538
22		David Mandell Freeman: Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. EUROCRYPT 2010: 44-61
21		Shweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman: Preventing Pollution Attacks in Multi-source Network Coding. Public Key Cryptography 2010: 161-176
20		David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. Public Key Cryptography 2010: 279-295
19		Shweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman: Preventing Pollution Attacks in Multi-Source Network Coding. IACR Cryptology ePrint Archive 2010: 183 (2010)
18		Dan Boneh, David Mandell Freeman: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures. IACR Cryptology ePrint Archive 2010: 453 (2010)
17		Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman: Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures. IACR Cryptology ePrint Archive 2010: 474 (2010)
16		David Freeman, Michael Scott, Edlyn Teske: A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptology 23(2): 224-280 (2010)
	2009
15		Naomi Benger, Manuel Charlemagne, David Mandell Freeman: On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields. Pairing 2009: 52-65
14		Dan Boneh, David Mandell Freeman, Jonathan Katz, Brent Waters: Signing a Linear Subspace: Signature Schemes for Network Coding. Public Key Cryptography 2009: 68-87
13		David Mandell Freeman, Takakazu Satoh: Constructing pairing-friendly hyperelliptic curves using Weil restriction. IACR Cryptology ePrint Archive 2009: 103 (2009)
12		David Mandell Freeman: Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. IACR Cryptology ePrint Archive 2009: 540 (2009)
11		David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. IACR Cryptology ePrint Archive 2009: 590 (2009)
	2008
10		David Freeman, Peter Stevenhagen, Marco Streng: Abelian Varieties with Prescribed Embedding Degree. ANTS 2008: 60-73
9		David Freeman: A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties. Pairing 2008: 146-163
8		Dan Boneh, David Mandell Freeman, Jonathan Katz, Brent Waters: Signing a Linear Subspace: Signature Schemes for Network Coding. IACR Cryptology ePrint Archive 2008: 316 (2008)
7		Naomi Benger, Manuel Charlemagne, David Mandell Freeman: On the security of pairing-friendly Abelian varieties over non-prime fields. IACR Cryptology ePrint Archive 2008: 417 (2008)
6		David Mandell Freeman, Peter Stevenhagen, Marco Streng: Abelian varieties with prescribed embedding degree. IACR Cryptology ePrint Archive 2008: 61 (2008)
	2007
5		David Freeman: Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians. Pairing 2007: 152-176
	2006
4		David Freeman: Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10. ANTS 2006: 452-465
3		David Freeman: Constructing pairing-friendly elliptic curves with embedding degree 10 CoRR abs/math/0601487: (2006)
2		David Freeman, Michael Scott, Edlyn Teske: A taxonomy of pairing-friendly elliptic curves. IACR Cryptology ePrint Archive 2006: 372 (2006)
	2005
1		David Freeman: Pairing-based identification schemes CoRR abs/cs/0509056: (2005)

Coauthor Index

1	Shweta Agrawal	[19] [21] [25] [30]
2	Naomi Benger	[7] [15]
3	Dan Boneh	[8] [14] [18] [19] [21] [26] [27] [29]
4	Xavier Boyen	[19] [21]
5	Manuel Charlemagne	[7] [15]
6	Markus Dürmuth	[24] [28]
7	Oded Goldreich	[11] [20]
8	Jonathan Katz	[8] [14]
9	Eike Kiltz	[11] [20]
10	Sarah Meiklejohn	[17] [23]
11	Alon Rosen	[11] [20]
12	Takakazu Satoh	[13]
13	Michael Scott	[2] [16]
14	Gil Segev	[11] [20]
15	Hovav Shacham	[17] [23]
16	Peter Stevenhagen	[6] [10]
17	Marco Streng	[6] [10]
18	Edlyn Teske	[2] [16]
19	Vinod Vaikuntanathan (V. Vinod)	[25] [30]
20	Brent Waters (Brent R. Waters)	[8] [14]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page