Matthew K. Franklin

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

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

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

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

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

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

Writings

  • Michael K. Reiter: The Design and Implementation of a Secure Auction Service, IEEE Transactions on Software Engineering, Volume 22, 1996, pp. 302-312
  • 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
  • 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
  • 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
  • Dan Boneh: Efficient generation of shared RSA keys, Journal of the ACM, Volume 48, 2001, pp. 702-722
  • Pairing identity - based encryption from the Weil, SIAM Journal on Computing, Volume 32, 2003, pp. 586-615, : with Dan Boneh
Mathematics Genealogy Project
556778
de