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

Benjamin Bencina

dblp:360/1485 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · none

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

Security and privacy · 4 · 3 first-author · 4 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
3 papers
Cryptographic primitives and cryptanalysis · 60% Cryptographic protocols and secure computation · 40%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
hybrid key exchange
0.912025
Post-Quantum Cryptographic Analysis of SSH · SP 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography
key encapsulation mechanism
0.912025
Post-Quantum Cryptographic Analysis of SSH · SP 2025
Cryptographic protocols and secure computation
key exchange
0.912025
Post-Quantum Cryptographic Analysis of SSH · SP 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.912025
Hollow LWE: A New Spin - Unbounded Updatable Encryption from LWE and PCE · EUROCRYPT (8) 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
learning with errors
0.912025
Hollow LWE: A New Spin - Unbounded Updatable Encryption from LWE and PCE · EUROCRYPT (8) 2025
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.912025
Post-Quantum Cryptographic Analysis of SSH · SP 2025
Cryptographic protocols and secure computation › security protocol analysis
protocol security models
0.912025
Post-Quantum Cryptographic Analysis of SSH · SP 2025
Cryptographic protocols and secure computation › secure channel
secure channel establishment
0.912025
Post-Quantum Cryptographic Analysis of SSH · SP 2025
Cryptographic primitives and cryptanalysis › encryption
updatable encryption
0.912025
Hollow LWE: A New Spin - Unbounded Updatable Encryption from LWE and PCE · EUROCRYPT (8) 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography
isogeny-based cryptography
0.812024
Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves · CRYPTO (5) 2024

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

quantum random oracle model · 0.9plaintext checkable encryption · 0.9IND-CPA security · 0.9
YearPublicationVenuePosition
2025 Hollow LWE: A New Spin - Unbounded Updatable Encryption from LWE and PCE
Martin R. Albrecht, Benjamin Bencina, Russell W. F. Lai
EUROCRYPT (8)2
2025 Post-Quantum Cryptographic Analysis of SSH
abstract
The Secure Shell (SSH) protocol is one of the first security protocols on the Internet to upgrade itself to resist attacks against future quantum computers, with the default adoption of the “quantum (otherwise, classically)” secure hybrid key exchange in OpenSSH from April 2022. However, there is a lack of a comprehensive security analysis of this quantum-resistant version of SSH in the literature: related works either focus on the hybrid key exchange in isolation and do not consider security of the overall protocol, or analyze the protocol in security models which are not appropriate for SSH, especially in the “post-quantum” setting. In this paper, we remedy the state of affairs by providing a thorough post-quantum cryptographic analysis of SSH. We follow a “top-down” approach wherein we first prove security of SSH in a more appropriate model, namely, our post-quantum extension of the so-called authenticated and confidential channel establishment (ACCE) protocol security model; our extension which captures “harvest now, decrypt later” attacks could be of independent interest. Then we establish the cryptographic properties of SSH's underlying primitives, as concretely instantiated in practice, based on our protocol-level ACCE security analysis: for example, we prove relevant cryptographic properties of “Streamlined NTRU Prime”, a key encapsulation mechanism (KEM) which is used in recent versions of OpenSSH and TinySSH, in the quantum random oracle model, and address open problems related to its analysis in the literature. Notably, our ACCE security analysis of post-quantum SSH relies on the weaker notion of IND-CPA security of the ephemeral KEMs used in the hybrid key exchange. This is in contrast to prior works which rely on the stronger assumption of IND-CCA secure ephemeral KEMs. Hence we conclude the paper with a discussion on potentially replacing IND-CCA secure KEMs in current post-quantum implementations of SSH with simpler and faster IND-CPA secure counterparts, and also provide the corresponding benchmarks.
Benjamin Bencina, Benjamin Dowling, Varun Maram, Keita Xagawa
SP1
2024 Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves
Benjamin Bencina, Péter Kutas, Simon-Philipp Merz, Christophe Petit 0001, Miha Stopar, Charlotte Weitkämper
CRYPTO (5)1
2024 Properties of Lattice Isomorphism as a Cryptographic Group Action
Benjamin Bencina, Alessandro Budroni, Jesús-Javier Chi-Domínguez, Mukul Kulkarni
PQCrypto (1)1