Nigel P. Smart spends much of his time researching Theoretical computer science, Cryptography, Computer security, Encryption and Homomorphic encryption. His Theoretical computer science research is multidisciplinary, incorporating elements of Mathematical proof, Computation and Key, Advanced Encryption Standard. His Cryptography research includes elements of Black box, Context, Elliptic curve and Simple.
His research in Elliptic curve intersects with topics in Multiplication and Arithmetic. His work on Financial cryptography as part of general Computer security research is frequently linked to Weil pairing, bridging the gap between disciplines. His Homomorphic encryption study combines topics from a wide range of disciplines, such as Ciphertext, Homomorphic secret sharing, Security parameter and Public-key cryptography.
The scientist’s investigation covers issues in Cryptography, Theoretical computer science, Computer security, Encryption and Elliptic curve. His research on Cryptography frequently connects to adjacent areas such as Arithmetic. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Homomorphic encryption, Mathematical proof, Random oracle, Hash function and Computation.
His Computation study incorporates themes from Protocol and Secret sharing. His Encryption research focuses on Scheme and how it relates to Signature. In his research, Supersingular elliptic curve is intimately related to Discrete mathematics, which falls under the overarching field of Elliptic curve.
Nigel P. Smart mostly deals with Computation, Theoretical computer science, Computer security, Cryptography and Encryption. His Computation research includes themes of Set, Software, Protocol and Multiplication. As part of the same scientific family, Nigel P. Smart usually focuses on Theoretical computer science, concentrating on Hash function and intersecting with Standard algorithms and Elliptic curve.
As a member of one scientific family, Nigel P. Smart mostly works in the field of Cryptography, focusing on Key and, on occasion, Signature. The study incorporates disciplines such as Ring and Function in addition to Encryption. As a part of the same scientific study, Nigel P. Smart usually deals with the Homomorphic encryption, concentrating on Discrete mathematics and frequently concerns with Oblivious transfer.
His primary areas of investigation include Computation, Theoretical computer science, Computer security, Protocol and Support vector machine. His Computation research is multidisciplinary, relying on both Software, Multiplication, Chip and Abort. He has included themes like Symmetric-key algorithm, Cryptography and Benchmark in his Theoretical computer science study.
In his work, Public-key cryptography is strongly intertwined with Information security, which is a subfield of Cryptography. His biological study spans a wide range of topics, including Tracing and Upload. He has researched Protocol in several fields, including Distributed computing, Electronic circuit and Secret sharing, Access structure.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Elliptic Curves in Cryptography
Ian F. Blake;G. Seroussi;N. P. Smart.
(1999)
Multiparty Computation from Somewhat Homomorphic Encryption
Ivan Damgård;Valerio Pastro;Nigel Smart;Sarah Zakarias.
international cryptology conference (2012)
Fully homomorphic encryption with relatively small key and ciphertext sizes
N. P. Smart;F. Vercauteren.
public key cryptography (2010)
Homomorphic Evaluation of the AES Circuit
Craig Gentry;Shai Halevi;Nigel P. Smart.
international cryptology conference (2012)
Pairings for cryptographers
Steven D. Galbraith;Kenneth G. Paterson;Nigel P. Smart.
Discrete Applied Mathematics (2008)
Advances in Elliptic Curve Cryptography
Ian F. Blake;Gadiel Seroussi;Nigel P. Smart.
(2005)
Advances in Cryptology - EUROCRYPT 2008
Nigel Smart.
(2008)
Identity-based authenticated key agreement protocol based on Weil pairing
Nigel P Smart.
Electronics Letters (2002)
Fully homomorphic SIMD operations
N. P. Smart;F. Vercauteren.
Designs, Codes and Cryptography (2014)
Secure Two-Party Computation Is Practical
Benny Pinkas;Thomas Schneider;Nigel P. Smart;Stephen C. Williams.
international conference on the theory and application of cryptology and information security (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
KU Leuven
University of Bristol
University of Surrey
Algorand Foundation
TripleBlind
University of Bristol
ETH Zurich
DFINITY
University of the Republic
Bar-Ilan University
The University of Texas at Arlington
Tellu IoT AS
Gazi University
Deakin University
University of Pennsylvania
Université du Maine
Spanish National Research Council
Washington University in St. Louis
University of Washington
University of Copenhagen
New York University
Harvard University
University of Alabama at Birmingham
Stanford University
Sorbonne University
George Washington University