Matt Franklin

from Wikipedia, the free encyclopedia

Matthew Keith "Matt" Franklin (* around 1960 ) is an American cryptographer and computer scientist .

Franklin received his bachelor's degree in mathematics from Pomona College in 1983 and his master's degree from the University of California, Berkeley with Elwyn Berlekamp and Gilles Brassard (Mathematical Investigations of the Data Encryption Standard) in 1985 . He received his doctorate in 1994 from Columbia University under Zvi Galil (* 1947) and Moti Yung (Efficiency and security of distributed protocols). From 1994 to 1998 he was at Bell Laboratories and from 1998 to 2000 at Xerox PARC . From 2000 he was a professor at the University of California, Davis , with a full professorship from 2004.

Among other things, he dealt with protocols for e-commerce , secure distributed computing, electronic voting and cryptanalysis. He is known for the Boneh-Franklin method of generating public key keys with Weil pairing of elliptic curves (with Dan Boneh 2001).

From 2009 to 2014 he is editor of the Journal of Cryptology.

In 2001 he received an NSF Career Award and became a Packard Fellow.

In 2013 he received the Gödel Prize with Dan Boneh.

Fonts

  • with Michael K. Reiter: The Design and Implementation of a Secure Auction Service, IEEE Transactions on Software Engineering, Volume 22, 1996, pp. 302-312
  • with Ronald Cramer, Berry Schoenmakers, Moti Yung: Multi-authority secret-ballot elections with linear work, Advances in cryptology — EUROCRYPT '96: International Conference on the Theory and Application of Cryptographic Techniques Saragossa, Spain, May 12–16, 1996, Proceedings, Lecture Notes in Computer Science 1070, Springer 1996
  • with Michael K. Reiter: Fair exchange with a semi-trusted third party, Proceedings of the 4th ACM Conference on Computer and Communications Security (CCS '97), 1997, pp. 1–5
  • with Dan Boneh: An efficient public key traitor tracing scheme Advances in Cryptology - CRYPTO '99: 19th Annual International Cryptology Conference Santa Barbara, California, USA, August 15-19, 1999, Proceedings, Lecture Notes in Computer Science 1666, Springer, 1999 , Pp. 338-353
  • with Dan Boneh: Efficient generation of shared RSA keys, Journal of the ACM, Volume 48, 2001, pp. 702-722
  • with Dan Boneh: Identity-based encryption from the Weil pairing, SIAM Journal on Computing, Volume 32, 2003, pp. 586–615,

Web links

Individual evidence

  1. Matt Franklin in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used