• Publications
  • Influence
Elliptic curves in cryptography
This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems, to help engineers and computer scientists wishing (or needing) to actually implement such systems.
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to $$n-1$$ of the n players. The protocol may be used to compute securely arithmetic circuits
Homomorphic Evaluation of the AES Circuit
A working implementation of leveled homomorphic encryption without bootstrapping that can evaluate the AES-128 circuit in three different ways, and develops both AES-specific optimizations as well as several "generic" tools for FHE evaluation.
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
This work presents a fully homomorphic encryption scheme which has both relatively small key and ciphertext size and allows efficient fully homomorphism over any field of characteristic two.
The Eta Pairing Revisited
By swapping the arguments of the Eta pairing, one obtains a very efficient algorithm resulting in a speed-up of a factor of around six over the usual Tate pairing, in the case of curves that have large security parameters, complex multiplication by an order of Qopf (radic-3), and when the trace of Frobenius is chosen to be suitably small.
Secure Two-Party Computation is Practical
An implementation of the two-party case, using Yao's garbled circuits, is described, and various algorithmic protocol improvements are presented, which are analysed both theoretically and empirically.
Decentralized Privacy-Preserving Proximity Tracing
This system, referred to as DP3T, provides a technological foundation to help slow the spread of SARS-CoV-2 by simplifying and accelerating the process of notifying people who might have been exposed to the virus so that they can take appropriate measures to break its transmission chain.
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits
A covertly secure key generation protocol for obtaining a BGV public key and a shared associated secret key and both a covertly and actively secure preprocessing phase are constructed, both of which compare favourably with previous work in terms of efficiency and provable security.
An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing
  • N. Smart
  • Computer Science
    IACR Cryptol. ePrint Arch.
  • 20 June 2002
An ID-based authenticated two pass key agreement protocol which makes use of the Weil pairing is presented and its properties are discussed, including the ability to add key confirmation.
Pairings for Cryptographers