Joseph H. Silverman

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:85/1480 · DBLP profile ↗

← Back

19ranked-venue papers

6as first author

0since 2021 · last 2017

0000-0003-3887-3248ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 17 · 5 first-authorTheory of computation · 2 · 1 first-author

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 6 papers		Cryptographic primitives and cryptanalysis · 94% Authentication and access control · 6%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Embedded and real-time systems · 100%

Topics — the 15 heaviest of 16, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography lattice-based cryptography	0.1	2	2003	The Impact of Decryption Failures on the Security of NTRU Encryption · CRYPTO 2003 NTRU in Constrained Devices · CHES 2001
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography NTRU	0.1	2	2003	The Impact of Decryption Failures on the Security of NTRU Encryption · CRYPTO 2003 NTRU in Constrained Devices · CHES 2001
Cryptographic primitives and cryptanalysis › public-key cryptography digital signatures	0.0	2	2001	NSS: An NTRU Lattice-Based Signature Scheme · EUROCRYPT 2001 MiniPASS: Authentication and Digital Signatures in a Constrained Environment · CHES 2000
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › post-quantum signatures lattice-based signatures	0.0	1	2001	NSS: An NTRU Lattice-Based Signature Scheme · EUROCRYPT 2001
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › post-quantum signatures NTRU signatures	0.0	1	2001	NSS: An NTRU Lattice-Based Signature Scheme · EUROCRYPT 2001
Cryptographic primitives and cryptanalysis post-quantum cryptography	0.0	1	2001	NSS: An NTRU Lattice-Based Signature Scheme · EUROCRYPT 2001
Cryptographic primitives and cryptanalysis public-key cryptography	0.0	1	2001	NTRU in Constrained Devices · CHES 2001
Authentication and access control password authentication	0.0	1	2000	MiniPASS: Authentication and Digital Signatures in a Constrained Environment · CHES 2000
Cryptographic primitives and cryptanalysis › finite field arithmetic binary field multiplication	0.0	1	1999	Fast Multiplication in Finite Fields GF(2N) · CHES 1999
Cryptographic primitives and cryptanalysis finite field arithmetic	0.0	1	1999	Fast Multiplication in Finite Fields GF(2N) · CHES 1999
Cryptographic primitives and cryptanalysis discrete logarithm	0.0	1	1998	Elliptic Curve Discrete Logarithms and the Index Calculus · ASIACRYPT 1998
Cryptographic primitives and cryptanalysis › discrete logarithm elliptic curve discrete logarithm	0.0	1	1998	Elliptic Curve Discrete Logarithms and the Index Calculus · ASIACRYPT 1998
Cryptographic primitives and cryptanalysis index calculus	0.0	1	1998	Elliptic Curve Discrete Logarithms and the Index Calculus · ASIACRYPT 1998
Embedded and real-time systems › resource-constrained systems resource-constrained devices	0.0	1	2001	NTRU in Constrained Devices · CHES 2001
Coding theory › finite fields finite field arithmetic	0.0	1	1999	Fast Multiplication in Finite Fields GF(2N) · CHES 1999

Methods — techniques the papers use, named apart from their topics

NTRU lattices · 0.0index calculus · 0.0

Year	Publication	Venue	Position
2017	Choosing Parameters for NTRUEncrypt Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, William Whyte, Zhenfei Zhang	CT-RSA	4
2015	PASS-Encrypt: a public key cryptosystem based on partial evaluation of polynomials Jeffrey Hoffstein, Joseph H. Silverman	Des. Codes Cryptogr.	2
2014	Practical Signatures from the Partial Fourier Recovery Problem Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, William Whyte	ACNS	4
2014	Transcript Secure Signatures Based on Modular Lattices Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, William Whyte	PQCrypto	4
2010	A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties Joseph H. Silverman	Pairing	1
2007	Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls Joseph H. Silverman, William Whyte	CT-RSA	1
2005	Choosing Parameter Sets forwithand Nick Howgrave-Graham, Joseph H. Silverman, William Whyte	CT-RSA	2
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	5
2003	NTRUSIGN: Digital Signatures Using the NTRU Lattice Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte	CT-RSA	4
2003	Random small Hamming weight products with applications to cryptography Jeffrey Hoffstein, Joseph H. Silverman	Discret. Appl. Math.	2
2001	NTRU in Constrained Devices Daniel V. Bailey, Daniel Coffin, Adam J. Elbirt, Joseph H. Silverman, Adam D. Woodbury	CHES	4
2001	NSS: An NTRU Lattice-Based Signature Scheme Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman	EUROCRYPT	3
2001	On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves Igor E. Shparlinski, Joseph H. Silverman	Des. Codes Cryptogr.	2
2000	MiniPASS: Authentication and Digital Signatures in a Constrained Environment abstract We describe an implementation of the PASS polynomial authentication and signature scheme [ 5 ],[ 6 ] that is suitable for use in highly constrained environments such as smart cards and wireless applications. The algorithm underlying the PASS scheme, as described in [ 5 ],[ 6 ], already features high speed and a small footprint, and these are further enhanced by transferring computational overhead to the server to the extent possible. We also describe timing and footprint results from a prototype implementation. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves. Jeffrey Hoffstein, Joseph H. Silverman	CHES	2
2000	Analysis of the Xedni Calculus Attack Michael J. Jacobson Jr., Neal Koblitz, Joseph H. Silverman, Andreas Stein, Edlyn Teske	Des. Codes Cryptogr.	3
2000	The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem Joseph H. Silverman	Des. Codes Cryptogr.	1
2000	On the distribution of integer points on curves of genus zero Joseph H. Silverman	Theor. Comput. Sci.	1
1999	Fast Multiplication in Finite Fields GF(2N) Joseph H. Silverman	CHES	1
1998	Elliptic Curve Discrete Logarithms and the Index Calculus Joseph H. Silverman, Joe Suzuki	ASIACRYPT	1