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

Eric Crockett 0001

dblp:172/4081 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2026
—ORCID · none

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

Security and privacy · 3 · 3 first-author · 1 since 2021

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
2 papers
Cryptographic primitives and cryptanalysis · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Compilers and program optimization · 50%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.312018
ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY · CCS 2018
Programming languages and type systems
domain-specific languages
0.312018
ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY · CCS 2018
Compilers and program optimization › domain-specific compilation
FHE compiler
0.312018
ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY · CCS 2018
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.212016
Λολ: Functional Lattice Cryptography · CCS 2016
Cryptographic primitives and cryptanalysis › cryptographic implementation
parameter selection
0.112018
ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY · CCS 2018

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

static analysis · 0.7noise rate inference · 0.7
YearPublicationVenuePosition
2026 Efficient Bootstrapping in Fully Homomorphic Encryption for Matrix Arithmetic
Eric Crockett 0001, Craig Gentry, Hyojun Kim, Yeongmin Lee
CRYPTO (2)1
2018 ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY
abstract
Fully Homomorphic Encryption (FHE) is a cryptographic "holy grail" that allows a worker to perform arbitrary computations on client-encrypted data, without learning anything about the data itself. Since the first plausible construction in 2009, a variety of FHE implementations have been given and used for particular applications of interest. Unfortunately, using FHE is currently very complicated, and a great deal of expertise is required to properly implement nontrivial homomorphic computations. This work introduces ALCHEMY, a modular and extensible system that simplifies and accelerates the use of FHE. ALCHEMY compiles "in-the-clear" computations on plaintexts, written in a modular domain-specific language~(DSL), into corresponding homomorphic computations on ciphertexts---with no special knowledge of FHE required of the programmer. The compiler automatically chooses (most of the) parameters by statically inferring ciphertext noise rates, generates keys and "key-switching hints," schedules appropriate ciphertext "maintenance" operations, and more. In addition, its components can be combined modularly to provide other useful functionality, such logging the empirical noise rates of ciphertexts throughout a computation, without requiring any changes to the original DSL code. As a testbed application, we demonstrate fast homomorphic evaluation of a pseudorandom function~(PRF) based on Ring-LWR, whose entire implementation is only a few dozen lines of simple DSL code. For a single (non-batched) evaluation, our unoptimized implementation takes only about 10 seconds on a commodity PC, which is more than an order of magnitude faster than state-of-the-art homomorphic evaluations of other PRFs, including some specifically designed for amenability to homomorphic evaluation.
Eric Crockett 0001, Chris Peikert, Chad Sharp
CCS1
2016 Λολ: Functional Lattice Cryptography
abstract
This work describes the design, implementation, and evaluation of Λολ, a general-purpose software framework for lattice-based cryptography. The Λολ framework has several novel properties that distinguish it from prior implementations of lattice cryptosystems, including the following.
Eric Crockett 0001, Chris Peikert
CCS1