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

Erdem Alkim

dblp:128/2280 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
2since 2021 · last 2022
0000-0003-4638-2422ORCID · verified

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

Systems, architecture and hardware · 3 · 2 since 2021Security and privacy · 3 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 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 · 57% Hardware security and side channels · 26% Cryptographic protocols and secure computation · 17%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.822022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Post-quantum Key Exchange - A New Hope · USENIX Security Symposium 2016
Cryptographic primitives and cryptanalysis › cryptographic implementation
constant-time implementation
0.612022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
gaussian sampling
0.612022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.612022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Hardware security and side channels
side-channel attack
0.612022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Hardware security and side channels › side-channel attack
timing side channel
0.612022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.612022
Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography · IEEE Trans. Computers 2022
Cryptographic protocols and secure computation
key exchange
0.212016
Post-quantum Key Exchange - A New Hope · USENIX Security Symposium 2016
Cryptographic protocols and secure computation › key exchange
lattice-based key exchange
0.212016
Post-quantum Key Exchange - A New Hope · USENIX Security Symposium 2016
Cryptographic protocols and secure computation › key exchange
post-quantum key exchange
0.212016
Post-quantum Key Exchange - A New Hope · USENIX Security Symposium 2016

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

gaussian convolution · 1.1fusion tree search · 1.1cumulative distribution table · 1.1
YearPublicationVenuePosition
2022 RevEAL: Single-Trace Side-Channel Leakage of the SEAL Homomorphic Encryption Library
abstract
This paper demonstrates the first side-channel attack on homomorphic encryption (HE), which allows computing on encrypted data. We reveal a power-based side-channel leakage of Microsoft SEAL prior to v3.6 that implements the Brakerski/Fan-Vercauteren (BFV) protocol. Our proposed attack targets the Gaussian sampling in the SEAL's encryption phase and can extract the entire message with a single power measurement. Our attack works by (1) identifying each coefficient index being sampled, (2) extracting the sign value of the coefficients from control-flow variations, (3) recovering the coefficients with a high probability from data-flow variations, and (4) using a Blockwise Korkine-Zolotarev (BKZ) algorithm to efficiently explore and estimate the remaining search space. Using real power measurements, the results on a RISC-V FPGA implementation of the SEAL (v3.2) show that the proposed attack can reduce the plaintext encryption security level from 2128to 24.4. Therefore, as HE gears toward real-world applications, such attacks and related defenses should be considered.
Furkan Aydin, Emre Karabulut, Seetal Potluri, Erdem Alkim, Aydin Aysu
DATE4
2022 Efficient, Flexible, and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography
abstract
This paper proposes a discrete Gaussian sampling hardware design that can flexibly support different sampling parameters,that is more efficient (in area-delay product) compared to the majority of earlier proposals,and that has constant execution time. The proposed design implements a Cumulative Distribution Table (CDT) approach,reduces the table size with Gaussian convolutions,and adopts an innovative fusion tree search algorithm to achieve a compact and fast sampling technique---to our best knowledge,this is the first hardware implementation of fusion tree search algorithm. The proposed hardware can support all the discrete Gaussian distributions used in post-quantum algorithms (FALCON,qTESLA,and FrodoKEM),the homomorphic encryption library of SEAL,and other algorithms such BLISS digital signature and LP public-key encryption. Our proposed hardware can be configured at design-time to optimize a single configuration or at run-time to support multiple Gaussian distribution parameters. Our design,furthermore,has constant-time behavior by design,eliminating timing side-channel attacks---this is achieved by reading all table contents at the same time to also reduce the latency. The results on a Xilinx Virtex-7 FPGA show that our solution can outperform all prior proposals in area-delay product by 1.67--235.88X,only falling short of those designed for the LP encryption scheme.
Emre Karabulut, Erdem Alkim, Aydin Aysu
IEEE Trans. Computers2
2020 The Lattice-Based Digital Signature Scheme qTESLA
Erdem Alkim, Paulo S. L. M. Barreto, Nina Bindel, Juliane Krämer, Patrick Longa, Jefferson E. Ricardini
ACNS (1)1
2017 Revisiting TESLA in the Quantum Random Oracle Model
Erdem Alkim, Nina Bindel, Johannes Buchmann 0001, Özgür Dagdelen, Edward Eaton, Gus Gutoski, Juliane Krämer, Filip Pawlega
PQCrypto1
2016 Post-quantum Key Exchange - A New Hope
Erdem Alkim, Léo Ducas, Thomas Pöppelmann, Peter Schwabe
USENIX Security Symposium1
2016 Sparse polynomial multiplication for lattice-based cryptography with small complexity
Sedat Akleylek, Erdem Alkim, Zaliha Yüce Tok
J. Supercomput.2
2012 A fast and adaptive automated disease diagnosis method with an innovative neural network model
Erdem Alkim, Emre Gürbüz, Erdal Kiliç
Neural Networks1