Joppe W. Bos

Joppe W. Bos

Auto-generated profile, based on publicly available information

Joppe W. Bos

NXP Semiconductors

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2013
Verified
Book Chapter
Closed access
PDF file
JBJoppe W. Bos
Joppe W. Bos
KLKristin Lauter
Kristin Lauter
JLJake Loftus
Jake Loftus
MNMichael Naehrig
Michael Naehrig

24 October 2016
Verified
Conference Paper
Open access
JBJoppe Bos
Joppe Bos
CCCraig Costello
Craig Costello
LDLeo Ducas
Leo Ducas
IMIlya Mironov
Ilya Mironov
MNMichael Naehrig
Michael Naehrig
DSDouglas Stebila
Douglas Stebila
Lattice-based cryptography offers some of the most attractive primitives believed to be resistant to quantum computers. Following increasing interest from both companies and government agencies in building quantum computers, a number of works have proposed instantiations of practical post-quantum key exchange protocols based on hard problems in ideal lattices, mainly based on the Ring Learning With Errors (R-LWE) problem. While ideal lattices facilitate major efficiency and storage benefits over their non-ideal counterparts, the additional ring structure that enables these advantages also raises concerns about the assumed difficulty of the underlying problems. Thus, a question of significant interest to cryptographers, and especially to those currently placing bets on primitives that will withstand quantum adversaries, is how much of an advantage the additional ring structure actually gives in practice. Despite conventional wisdom that generic lattices might be too slow and unwieldy, we demonstrate that LWE-based key exchange is quite practical: our constant time implementation requires around 1.3ms computation time for each party; compared to the recent NewHope R-LWE scheme, communication sizes increase by a factor of 4.7x, but remain under 12 KiB in each direction. Our protocol is competitive when used for serving web pages over TLS; when partnered with ECDSA signatures, latencies increase by less than a factor of 1.6x, and (even under heavy load) server throughput only decreases by factors of 1.5x and 1.2x when serving typical 1 KiB and 100 KiB pages, respectively. To achieve these practical results, our protocol takes advantage of several innovations. These include techniques to optimize communication bandwidth, dynamic generation of public parameters (which also offers additional security against backdoors), carefully chosen error distributions, and tight security parameters.

1 August 2014 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
JBJoppe W. Bos
Joppe W. Bos
KLKristin Lauter
Kristin Lauter
MNMichael Naehrig
Michael Naehrig

1 January 2010
Verified
Book Chapter
Closed access
PDF file
TKThorsten Kleinjung
Thorsten Kleinjung
KAKazumaro Aoki
Kazumaro Aoki
JFJens Franke
Jens Franke
ALArjen K. Lenstra
Arjen K. Lenstra
ETEmmanuel Thomé
Emmanuel Thomé
PZPaul Zimmermann
Paul Zimmermann

1 May 2015
Verified
Conference Paper
Closed access
JBJoppe W. Bos
Joppe W. Bos
CCCraig Costello
Craig Costello
MNMichael Naehrig
Michael Naehrig
DSDouglas Stebila
Douglas Stebila
Lattice-based cryptographic primitives are believed to offer resilience against attacks by quantum computers. We demonstrate the practicality of post-quantum key exchange by constructing cipher suites for the Transport Layer Security (TLS) protocol that provide key exchange based on the ring learning with errors (R-LWE) problem, we accompany these cipher suites with a rigorous proof of security. Our approach ties lattice-based key exchange together with traditional authentication using RSA or elliptic curve digital signatures: the post-quantum key exchange provides forward secrecy against future quantum attackers, while authentication can be provided using RSA keys that are issued by today's commercial certificate authorities, smoothing the path to adoption. Our cryptographically secure implementation, aimed at the 128-bit security level, reveals that the performance price when switching from non-quantum-safe key exchange is not too high. With our R-LWE cipher suites integrated into the Open SSL library and using the Apache web server on a 2-core desktop computer, we could serve 506 RLWE-ECDSA-AES128-GCM-SHA256 HTTPS connections per second for a 10 KiB payload. Compared to elliptic curve Diffie-Hellman, this means an 8 KiB increased handshake size and a reduction in throughput of only 21%. This demonstrates that provably secure post-quantum key-exchange can already be considered practical.

9 November 2014
Verified
Book Chapter
Closed access
PDF file
JBJoppe W. Bos
Joppe W. Bos
JHJ. Alex Halderman
J. Alex Halderman
NHNadia Heninger
Nadia Heninger
JMJonathan Moore
Jonathan Moore
MNMichael Naehrig
Michael Naehrig
EWEric Wustrow
Eric Wustrow