Nigel Smart is a professor in the Department of Computer Science at the University of Bristol and a current 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.

Education and Academic Positions[edit]

Smart received a BSc degree in mathematics from the University of Kent at Canterbury in 1989. He then obtained his PhD degree form the University of Kent at Canterbury in 1992; his thesis was titled The Computer Solutions of Diophantine Equations. He proceeded to work as a research fellow at the University of Kent, the Erasmus University Rotterdam, and Cardiff University until 1995. From 1995 to 1997 he was a lecturer in mathematics at the University of Kent, and then spent three years in industry at HP from 1997 to 2000. Since 2000 he has been at the University of Bristol, and he heads the cryptology research group there.

Smart won the 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).

Research[edit]

Smart is best known for his work in Elliptic curve cryptography, especially work on the ECDLP.^[1][2][3] He has also worked on Pairing-based cryptography contributing a number of algorithms such as the SK-KEM^[4] and the Ate-pairing^[5]

Smart carries out research on a wide variety of topics in cryptography. Recently, he has been instrumental in the effort to make secure multiparty computation practical. A few of his works in this direction include ^[6][7][8]

Industry Experience[edit]

In addition to his three years at HP labs, 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 [1].

Books[edit]

• Nigel P. Smart (1998). The Algorithmic Resolution of Diophantine Equations. Cambridge University Press. ISBN 0-521-64633-2. 
• Ian F. Blake, Gadiel Seroussi and Nigel P. Smart (1999). Elliptic Curves in Cryptography. Cambridge University Press. ISBN 0-521-65374-6. 
• Nigel P. Smart (2002). Cryptography An Introduction. McGraw Hill. ISBN 0-07-709987-7. 
• I.F. Blake, G. Seroussi, and Nigel P. Smart (2004). Advances in Elliptic Curve Cryptography. Cambridge University Press. ISBN 0-521-60415-X. 
• Nigel P. Smart (editor) (2005). Cryptography and Coding. Springer-Verlag, LNCS 3796. ISBN 3-540-30276-X. 
• Nigel P. Smart (editor) (2008). Advances in Cryptology - Eurocrypt 2008. Springer-Verlag, LNCS 4965. ISBN 978-3-540-78966-6. 

References[edit]

1. ^ S.D. Galbraith and N.P. Smart, A cryptographic application of the Weil descent, Cryptography and Coding, 1999.
2. ^ P. Gaudry, F. Hess, and N.P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, Hewlett Packard Laboratories Technical Report, 2000.
3. ^ N. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, Volume 12, 1999.
4. ^ Barbosa et. al, SK-KEM: An Identity-Based KEM
5. ^ F. Hess, N. Smart, F. Vercauteren. The Eta-pairing revisited. In IEEE Transactions on Information Theory, Vol. 52(10), p. 4595-4602, 2006.
6. ^ B. Pinkas, T. Schneider, N.P. Smart and S.C. Williams. Secure two-party computation is practical, ASIACRYPT 2009
7. ^ I. Damgard, V. Pastro, N.P. Smart, and S. Zakarias. Multiparty computation from somewhat homomorphic encryption, CRYPTO 2012.
8. ^ I. Damgard, M. Keller, E. Larraia, C. Miles and N.P. Smart. Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol, SCN 2012.

External links[edit]

• Home page
• DBLP Publication list
• Google scholar profile

We're sorry, but there's no news about "Nigel Smart (cryptographer)" right now.