Nigel Smart (cryptographer)

From Wikipedia, the free encyclopedia

Template:Short description Template:DMCA Template:DMCA Script error: No such module "Template wrapper".Script error: No such module "Check for conflicting parameters". Nigel Smart is a professor at COSIC at the Katholieke Universiteit Leuven and Chief Academic Officer at Zama.[1] He is a cryptographer with interests in the theory of cryptography and its application in practice.[2][3]

Education

Smart received a BSc degree in mathematics from the University of Reading in 1989.[4]

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

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 Hewlett-Packard from 1997 to 2000. From 2000 to 2017 he was at the University of Bristol, where he founded the cryptology research group. From 2018 he has been based in the COSIC group at the Katholieke Universiteit Leuven, where he is now a part-time professor.

Smart held a Royal Society Wolfson Merit Award (2008–2013), and two ERC Advanced Grant (2011–2016 and 2016-2021). He was a director of the International Association for Cryptologic Research (2012–2014), and was elected vice president for the period 2014-2016.[5] In 2016 he was named as a Fellow of the IACR.[6] In 2026 we was awarded the RSA Award for Excellence in Mathematics.

Research

Prof. Smart is best known for his work in elliptic curve cryptography, especially work on the ECDLP.[7][8][9] He has also worked on pairing-based cryptography contributing a number of algorithms such as the SK-KEM[10] and the Ate-pairing[11]

Smart carries out research on a wide variety of topics in cryptography. He has been instrumental in the effort to make secure multiparty computation practical. A few of his works in this direction include.[12][13][14]

His work with Gentry and Halevi on performing the first large calculation using Fully Homomorphic Encryption[15] won the IBM Pat Goldberg Best Paper Award for 2012.[16]

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.[17] In 2013 he formed, with Yehuda Lindell, Unbound Security (formally called Dyadic Security), a company focusing on deploying distributed cryptographic solutions based on multi-party computations. Unbound Security was bought by Coinbase in 2021.[18] He is also the co-founder, along with Kenny Paterson, of the Real World Crypto conference series.[19]

Publications

References

Page Template:Reflist/styles.css has no content.

  1. ^ Page Module:Citation/CS1/styles.css has no content."Nigel Smart is joining Zama".
  2. ^ {{DBLP}} template missing ID and not present in Wikidata.
  3. ^ Template:Google Scholar id
  4. ^ Page Module:Citation/CS1/styles.css has no content.Trust in Digital Life. "Nigel Smart". Trust in Digital Life. Retrieved 19 November 2025.
  5. ^ Page Module:Citation/CS1/styles.css has no content."IACR Election 2013 - List of Candidates and Propositions". Iacr.org. Retrieved 14 August 2015.
  6. ^ Page Module:Citation/CS1/styles.css has no content."IACR Fellows 2016".
  7. ^ S. D. Galbraith and N. P. Smart, A cryptographic application of the Weil descent, Cryptography and Coding, 1999.
  8. ^ P. Gaudry, F. Hess, and N. P. Smart, Constructive and destructive facets of Weil descent on elliptic curves Script error: No such module "webarchive"., Hewlett Packard Laboratories Technical Report, 2000.
  9. ^ N. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, Volume 12, 1999.
  10. ^ Barbosa et al., SK-KEM: An Identity-Based KEM Script error: No such module "webarchive".
  11. ^ F. Hess, N. Smart, F. Vercauteren. The Eta-pairing revisited. In IEEE Transactions on Information Theory, Vol. 52(10), p. 4595-4602, 2006.
  12. ^ B. Pinkas, T. Schneider, N. P. Smart and S. C. Williams. Secure two-party computation is practical, ASIACRYPT 2009
  13. ^ I. Damgard, V. Pastro, N. P. Smart, and S. Zakarias. Multiparty computation from somewhat homomorphic encryption, CRYPTO 2012.
  14. ^ Page Module:Citation/CS1/styles.css has no content.Damgård, Ivan; Keller, Marcel; Larraia, Enrique; Miles, Christian; Smart, Nigel P. (2012). Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol (PDF). Security and Cryptography for Networks. doi:10.1007/978-3-642-32928-9_14. ISBN 978-3-642-32928-9.
  15. ^ C. Gentry, S. Halevi and N. P. Smart. Homomorphic Evaluation of the AES Circuit CRYPTO 2012.
  16. ^ Page Module:Citation/CS1/styles.css has no content."Pat Goldberg Memorial 2012 Best Papers in CS, EE and Math - IBM". Researcher.watson.ibm.com. 23 March 2015. Retrieved 14 August 2015.
  17. ^ Page Module:Citation/CS1/styles.css has no content."Trend Micro buys into encryption with Identum purchase | News". Geek.com. 27 February 2008. Archived from the original on 31 October 2013. Retrieved 14 August 2015.
  18. ^ Page Module:Citation/CS1/styles.css has no content."Crypto giant Coinbase acquiring Israel's Unbound Security". 30 November 2012. Retrieved 1 December 2021.
  19. ^ Page Module:Citation/CS1/styles.css has no content."Real World Crypto Symposium". 1 January 2018. Retrieved 18 January 2018.

Lua error in package.lua at line 80: module 'Module:Authority control/config' not found.