OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Cryptology is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-09-01 to 2024-09-01.)

Article	Citations
Ascon v1.2: Lightweight Authenticated Encryption and Hashing	127
A Formal Security Analysis of the Signal Messaging Protocol	56
A Cryptographic Analysis of the TLS 1.3 Handshake Protocol	36
Bootstrapping for HElib	31
Reusable Fuzzy Extractors for Low-Entropy Distributions	31
On the Tight Security of TLS 1.3: Theoretically Sound Cryptographic Parameters for Real-World Deployments	30
Efficient Verifiable Delay Functions	29
Match Me if You Can: Matchmaking Encryption and Its Applications	24
On the Local Leakage Resilience of Linear Secret Sharing Schemes	20
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices	17
Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions	16
The Deoxys AEAD Family	14
Tight Tradeoffs in Searchable Symmetric Encryption	13
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange	13
Improved Differential-Linear Attacks with Applications to ARX Ciphers	13
Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT	12
On the Hardness of Module Learning with Errors with Short Distributions	11
On Subversion-Resistant SNARKs	11
Tightly Secure Hierarchical Identity-Based Encryption	11
Selfie: reflections on TLS 1.3 with PSK	11
Parameter Optimization and Larger Precision for (T)FHE	10
Fine-Grained Cryptography Revisited	10
The Number of Almost Perfect Nonlinear Functions Grows Exponentially	9
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	8
Semi-quantum Money	8

Actively Secure Setup for SPDZ	8
Modeling for Three-Subset Division Property without Unknown Subset	8
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption	8
Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUIC	7
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange	7
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model	7
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE	6
Rinocchio: SNARKs for Ring Arithmetic	6
Round-Optimal Secure Multi-party Computation	6
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró	5
Multiparty Generation of an RSA Modulus	5
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience	5
From Fairness to Full Security in Multiparty Computation	5
Fast Secure Two-Party ECDSA Signing	5
Bootstrapping for BGV and BFV Revisited	5
On the (in)Security of ROS	5
TinyKeys: A New Approach to Efficient Multi-Party Computation	4
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable	4
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols	4
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer	4
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe	4
The Inverse of $$\chi $$ and Its Applications to Rasta-Like Ciphers	4
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions	3
CCA Security and Trapdoor Functions via Key-Dependent-Message Security	3
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?	3
Is There an Oblivious RAM Lower Bound for Online Reads?	3
(Inner-Product) Functional Encryption with Updatable Ciphertexts	3
ZK-PCPs from Leakage-Resilient Secret Sharing	3
Cryptographic Competitions	3
Everlasting UC Commitments from Fully Malicious PUFs	3
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors	3
Candidate iO from Homomorphic Encryption Schemes	3
The Design and Evolution of OCB	3
A Formal Analysis of Prefetching in Profiled Cache-Timing Attacks on Block Ciphers	3
Internal Symmetries and Linear Properties: Full-permutation Distinguishers and Improved Collisions on Gimli	3
Succinct Non-Interactive Arguments via Linear Interactive Proofs	3
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm	2
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings	2
Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version)	2
Unbounded Predicate Inner Product Functional Encryption from Pairings	2
Non-Malleable Functions and their Applications	2
Oblivious RAM with Worst-Case Logarithmic Overhead	2
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries	2
Simple and Generic Constructions of Succinct Functional Encryption	2
On the Round Complexity of Randomized Byzantine Agreement	2
Efficient Perfectly Secure Computation with Optimal Resilience	2
Learn from Your Faults: Leakage Assessment in Fault Attacks Using Deep Learning	2
Non-commutative Ring Learning with Errors from Cyclic Algebras	2
Learning Strikes Again: The Case of the DRS Signature Scheme	2
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups	2

Translating the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves with $$(\ell ,\ell ,\ell )$$-Isogenies	2
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party	1
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.3	1
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors	1
Lattice-Based Programmable Hash Functions and Applications	1
On Abelian and Homomorphic Secret Sharing Schemes	1
BLEACH: Cleaning Errors in Discrete Computations Over CKKS	1
Cover Attacks for Elliptic Curves over Cubic Extension Fields	1
Introduction to the Special Issue on TLS 1.3	1
Fine-Grained Secure Attribute-Based Encryption	1
MPClan: Protocol Suite for Privacy-Conscious Computations	1
Adaptively Secure Distributed PRFs from $$\textsf {LWE}$$	1
Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries	1
Bitcoin as a Transaction Ledger: A Composable Treatment	1
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires	1
A Bad Day to Die Hard: Correcting the Dieharder Battery	1
Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience	1
Rotational Differential-Linear Cryptanalysis Revisited	1
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model	1
Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended Version	1
Unconditionally Secure Computation Against Low-Complexity Leakage	1
Decentralized Multi-authority ABE for $$\textsf{NC}^1$$ from BDH	1
Obfuscating Circuits Via Composite-Order Graded Encoding	1
On the Exact Round Complexity of Secure Three-Party Computation	1
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model	1