Nigel Smart  

Born  United Kingdom 
22 October 1967
Residence  United Kingdom 
Fields  Cryptography 
Institutions  University of Bristol 
Alma mater 

Doctoral advisor  John Merriman 
Known for  ECC Work on the ECDLP problem Pairingbased cryptography Efficient Secure multiparty computation Fully Homomorphic Encryption 
Website www 
Nigel Smart is a professor in the Department of Computer Science at the University of Bristol and a past holder of the Royal Society Wolfson Research Merit Award. He is a cryptographer with expertise in the theory of cryptography and its application in practice.^{[1]}^{[2]}
Education[edit]
Smart received a BSc degree in mathematics from the University of Reading in 1989.^{[citation needed]} He then obtained his PhD degree^{[citation needed]} from the University of Kent at Canterbury in 1992; his thesis was titled The Computer Solutions of Diophantine Equations.
Career[edit]
Smart proceeded to work as a research fellow at the University of Kent, the Erasmus University Rotterdam, and Cardiff University until 1995.^{[citation needed]} From 1995 to 1997, he was a lecturer in mathematics at the University of Kent, and then spent three years in industry at HewlettPackard from 1997 to 2000. Since 2000 he has been at the University of Bristol, and he heads the cryptology research group there.
Smart held a Royal Society Wolfson Merit Award (2008–2013), and an ERC Advanced Grant (2011–2016). He is a director of the International Association of Cryptologic Research (2012–2014), and has been elected Vice President for the period 20142017.^{[3]} In 2016 he was named as a Fellow of the IACR.^{[4]}
Research[edit]
Prof. Smart is best known for his work in elliptic curve cryptography, especially work on the ECDLP.^{[5]}^{[6]}^{[7]} He has also worked on pairingbased cryptography contributing a number of algorithms such as the SKKEM^{[8]} and the Atepairing^{[9]}
Smart carries out research on a wide variety of topics in cryptography. Recently,^{[when?]} he has been instrumental in the effort to make secure multiparty computation practical. A few of his works in this direction include.^{[10]}^{[11]}^{[12]}
His work with Gentry and Halevi on performing the first large calculation using Fully Homomomorphic Encryption^{[13]} won the IBM Pat Goldberg Best Paper Award for 2012.^{[14]}
In addition to his three years at HP Laboratories, Smart was a founder of the startup Identum specialising in pairing based cryptography and identity based encryption. This was bought by Trend Micro in 2008.^{[15]} In 2013 he formed, with Yehuda Lindell, Dyadic Security, a company focusing on deploying distributed cryptographic solutions based on multiparty computations.
Publications[edit]
 Nigel P. Smart (1998). The Algorithmic Resolution of Diophantine Equations. Cambridge University Press. ISBN 0521646332.
 Ian F. Blake, Gadiel Seroussi and Nigel P. Smart (1999). Elliptic Curves in Cryptography. Cambridge University Press. ISBN 0521653746.
 Nigel P. Smart (2002). Cryptography An Introduction. McGraw Hill. ISBN 0077099877.
 I.F. Blake; G. Seroussi & Nigel P. Smart (2004). Advances in Elliptic Curve Cryptography. Cambridge University Press. ISBN 052160415X.
 Nigel P. Smart (editor) (2005). Cryptography and Coding. SpringerVerlag, LNCS 3796. ISBN 354030276X.
 Nigel P. Smart (editor) (2008). Advances in Cryptology  Eurocrypt 2008. SpringerVerlag, LNCS 4965. ISBN 9783540789666.
 Daniel Page & Nigel P. Smart (2014). What Is Computer Science? An Information Security Perspective. SpringerVerlag. ISBN 9783319040417.
References[edit]
 ^ Nigel Smart at DBLP Bibliography Server
 ^ Nigel Smart's publications indexed by Google Scholar, a service provided by Google
 ^ "IACR Election 2013  List of Candidates and Propositions". Iacr.org. Retrieved 20150814.
 ^ "IACR Fellows 2016".
 ^ S. D. Galbraith and N. P. Smart, A cryptographic application of the Weil descent, Cryptography and Coding, 1999.
 ^ P. Gaudry, F. Hess, and N. P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, Hewlett Packard Laboratories Technical Report, 2000.
 ^ N. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, Volume 12, 1999.
 ^ Barbosa et. al, SKKEM: An IdentityBased KEM
 ^ F. Hess, N. Smart, F. Vercauteren. The Etapairing revisited. In IEEE Transactions on Information Theory, Vol. 52(10), p. 45954602, 2006.
 ^ B. Pinkas, T. Schneider, N. P. Smart and S. C. Williams. Secure twoparty computation is practical, ASIACRYPT 2009
 ^ I. Damgard, V. Pastro, N. P. Smart, and S. Zakarias. Multiparty computation from somewhat homomorphic encryption, CRYPTO 2012.
 ^ I. Damgard, M. Keller, E. Larraia, C. Miles and N. P. Smart. Implementing AES via an Actively/Covertly Secure DishonestMajority MPC Protocol, SCN 2012.
 ^ C. Gentry, S. Halevi and N. P. Smart. Homomorphic Evaluation of the AES Circuit CRYPTO 2012.
 ^ "Pat Goldberg Memorial 2012 Best Papers in CS, EE and Math  IBM". Researcher.watson.ibm.com. 20150323. Retrieved 20150814.
 ^ "Trend Micro buys into encryption with Identum purchase  News". Geek.com. 20080227. Retrieved 20150814.
This page uses Creative Commons Licensed content from Wikipedia. A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.