Demo Data from EDBT 2026 / reviewers in the wild / expert
William Whyte
dblp:41/1057
· DBLP profile ↗
14ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-6067-1952ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 12Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
3 papers |
Cryptographic primitives and cryptanalysis · 48% Cryptographic protocols and secure computation · 41% Hardware security and side channels · 11% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › post-quantum zero-knowledge
lattice-based zero-knowledge proofs |
0.4 | 1 | 2019 | Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications · CRYPTO (1) 2019 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.4 | 1 | 2019 | Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications · CRYPTO (1) 2019 |
Cryptographic primitives and cryptanalysis › cryptographic implementation
parameter selection |
0.3 | 1 | 2018 | Optimizing Polynomial Convolution for NTRUEncrypt · IEEE Trans. Computers 2018 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.3 | 1 | 2018 | Optimizing Polynomial Convolution for NTRUEncrypt · IEEE Trans. Computers 2018 |
Cryptographic primitives and cryptanalysis › cryptographic implementation
constant-time implementation |
0.1 | 1 | 2018 | Optimizing Polynomial Convolution for NTRUEncrypt · IEEE Trans. Computers 2018 |
Hardware security and side channels
side-channel attack |
0.1 | 1 | 2018 | Optimizing Polynomial Convolution for NTRUEncrypt · IEEE Trans. Computers 2018 |
Hardware security and side channels › side-channel attack
timing side channel |
0.1 | 1 | 2018 | Optimizing Polynomial Convolution for NTRUEncrypt · IEEE Trans. Computers 2018 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.0 | 1 | 2003 | The Impact of Decryption Failures on the Security of NTRU Encryption · CRYPTO 2003 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
NTRU |
0.0 | 1 | 2003 | The Impact of Decryption Failures on the Security of NTRU Encryption · CRYPTO 2003 |
Methods — techniques the papers use, named apart from their topics
multiplication algorithm hierarchy · 0.3AVX2 · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Modular lattice signatures, revisited
Dipayan Das 0001, Jeffrey Hoffstein, Jill Pipher, William Whyte, Zhenfei Zhang |
Des. Codes Cryptogr. | 4 |
| 2019 | Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, William Whyte |
CRYPTO (1) | 6 |
| 2018 | Optimizing Polynomial Convolution for NTRUEncryptabstract$\sf{ NTRUEncrypt}$is one of the most promising candidates for quantum-safe cryptography. In this paper, we focus on the$\sf{ NTRU743}$parameter set. We give a report on all known attacks against this parameter set and show that it delivers 256 bits of security against classical attackers and 128 bits of security against quantum attackers. We then present a parameter-dependent optimization using a tailored hierarchy of multiplication algorithms as well as the Intel AVX2 instructions, and show that this optimization is constant-time. Our implementation is two to three times faster than the reference implementation of$\sf{ NTRUEncrypt}$. Wei Dai 0007, William Whyte, Zhenfei Zhang |
IEEE Trans. Computers | 2 |
| 2018 | A Security Credential Management System for V2X CommunicationsabstractThe U.S. Department of Transportation (USDOT) issued a proposed rule on January 12, 2017 to mandate vehicle-to-vehicle safety communications in light vehicles in the U.S. Cybersecurity and privacy are major challenges for such a deployment. We present a Security Credential Management System (SCMS) for vehicle-to-everything (V2X) communications in this paper, which has been developed by the Crash Avoidance Metrics Partners LLC under a cooperative agreement with the USDOT. This system design is currently transitioning from research to proof-of-concept and is a leading candidate to support the establishment of a nationwide Public Key Infrastructure for V2X security. It issues digital certificates to participating vehicles and infrastructure devices for trustworthy communications among them, which is necessary for safety and mobility applications that are based on V2X communications. The SCMS supports four main use cases, namely, bootstrapping, certificate provisioning, misbehavior reporting, and revocation. The main design goal is to provide both security and privacy to the largest extent reasonable and possible. To achieve a reasonable level of privacy in this context, vehicles are issued pseudonym certificates, and the generation and provisioning of those certificates are divided among multiple organizations. Given the large number of pseudonym certificates per vehicle, one of the main challenges is to facilitate efficient revocation of misbehaving or malfunctioning vehicles, while preserving privacy against attacks from insiders. The proposed SCMS supports all identified V2X use-cases and certificate types necessary for V2X communication security. This paper is based upon work supported by the USDOT. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors (“we”) and do not necessarily reflect the view of the USDOT. Benedikt Brecht, Dean Therriault, André Weimerskirch, William Whyte, Thorsten Hehn, Roy Goudy |
IEEE Trans. Intell. Transp. Syst. | 4 |
| 2017 | Choosing Parameters for NTRUEncrypt
Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, William Whyte, Zhenfei Zhang |
CT-RSA | 5 |
| 2017 | Binary hash tree based certificate access management for connected vehiclesabstractWe present a certificate access management system to support the USDOT's proposed rule on Vehicle-to-Vehicle (V2V) communications, Federal Motor Vehicle Safety Standard (FMVSS) No. 150. Our proposal, which we call Binary Hash Tree based Certificate Access Management (BCAM) eliminates the need for vehicles to have bidirectional connectivity with the Security Credential Management System (SCMS) for certificate update. BCAM significantly improves the ability of the SCMS to manage large-scale software and/or hardware compromise events. Vehicles are provisioned at the start of their lifetime with all the certificates they will need. However, certificates and corresponding private key reconstruction values are provided to the vehicle encrypted, and the keys to decrypt them are only made available to the vehicles shortly before the start of the validity periods of those certificates. Vehicles that are compromised can be effectively removed from the V2V system by preventing them from decrypting the certificates. We demonstrate that the system is feasible with a broadcast channel for decryption keys and other revocation information, even if that channel has a relatively low capacity. Jonathan Petit, William Whyte |
WISEC | 3 |
| 2016 | Circuit-extension handshakes for Tor achieving forward secrecy in a quantum worldabstractAbstract We propose a circuit extension handshake for Tor that is forward secure against adversaries who gain quantum computing capabilities after session negotiation. In doing so, we refine the notion of an authenticated and confidential channel establishment (ACCE) protocol and define pre-quantum, transitional, and post-quantum ACCE security. These new definitions reflect the types of adversaries that a protocol might be designed to resist. We prove that, with some small modifications, the currently deployed Tor circuit extension handshake, ntor, provides pre-quantum ACCE security. We then prove that our new protocol, when instantiated with a post-quantum key encapsulation mechanism, achieves the stronger notion of transitional ACCE security. Finally, we instantiate our protocol with NTRU-Encrypt and provide a performance comparison between ntor, our proposal, and the recent design of Ghosh and Kate. John M. Schanck, William Whyte, Zhenfei Zhang |
Proc. Priv. Enhancing Technol. | 2 |
| 2014 | Practical Signatures from the Partial Fourier Recovery Problem
Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, William Whyte |
ACNS | 5 |
| 2014 | Transcript Secure Signatures Based on Modular Lattices
Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, William Whyte |
PQCrypto | 5 |
| 2009 | Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
Philip S. Hirschhorn, Jeffrey Hoffstein, Nick Howgrave-Graham, William Whyte |
ACNS | 4 |
| 2007 | Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls
Joseph H. Silverman, William Whyte |
CT-RSA | 2 |
| 2005 | Choosing Parameter Sets forwithand
Nick Howgrave-Graham, Joseph H. Silverman, William Whyte |
CT-RSA | 3 |
| 2003 | The Impact of Decryption Failures on the Security of NTRU Encryption
Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte |
CRYPTO | 7 |
| 2003 | NTRUSIGN: Digital Signatures Using the NTRU Lattice
Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte |
CT-RSA | 5 |