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-04-01 to 2024-04-01.)

Article	Citations
Ascon v1.2: Lightweight Authenticated Encryption and Hashing	73
A Formal Security Analysis of the Signal Messaging Protocol	48
A Cryptographic Analysis of the TLS 1.3 Handshake Protocol	33
On the Tight Security of TLS 1.3: Theoretically Sound Cryptographic Parameters for Real-World Deployments	27
Efficient Verifiable Delay Functions	26
Reusable Fuzzy Extractors for Low-Entropy Distributions	25
Bootstrapping for HElib	20
Match Me if You Can: Matchmaking Encryption and Its Applications	16
The IITM Model: A Simple and Expressive Model for Universal Composability	15
On the Local Leakage Resilience of Linear Secret Sharing Schemes	14
Tight Tradeoffs in Searchable Symmetric Encryption	13
Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions	13
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange	13
Efficient and Scalable Universal Circuits	12
Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT	11
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices	10
The Deoxys AEAD Family	10
Selfie: reflections on TLS 1.3 with PSK	10
Tightly Secure Hierarchical Identity-Based Encryption	9
On Subversion-Resistant SNARKs	9
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer	8
The Number of Almost Perfect Nonlinear Functions Grows Exponentially	8
Improved Differential-Linear Attacks with Applications to ARX Ciphers	8
Actively Secure Setup for SPDZ	7
Parameter Optimization and Larger Precision for (T)FHE	7

Semi-quantum Money	7
On the Hardness of Module Learning with Errors with Short Distributions	7
Modeling for Three-Subset Division Property without Unknown Subset	7
Fine-Grained Cryptography Revisited	6
Foundations of Fully Dynamic Group Signatures	6
Round-Optimal Secure Multi-party Computation	6
Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUIC	6
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption	6
Fast Secure Two-Party ECDSA Signing	5
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE	5
Multiparty Generation of an RSA Modulus	5
Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality	4
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols	4
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model	4
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	4
From Fairness to Full Security in Multiparty Computation	3
TinyKeys: A New Approach to Efficient Multi-Party Computation	3
Bootstrapping for BGV and BFV Revisited	3
$${\varvec{1/p}}$$-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds	3
Is There an Oblivious RAM Lower Bound for Online Reads?	3
The Design and Evolution of OCB	3
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró	3
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?	3
Internal Symmetries and Linear Properties: Full-permutation Distinguishers and Improved Collisions on Gimli	3
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe	3
A Formal Analysis of Prefetching in Profiled Cache-Timing Attacks on Block Ciphers	3
Everlasting UC Commitments from Fully Malicious PUFs	3
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange	3
Candidate iO from Homomorphic Encryption Schemes	2
Non-Malleable Functions and their Applications	2
Continuously Non-malleable Codes in the Split-State Model	2
The Inverse of $$\chi $$ and Its Applications to Rasta-Like Ciphers	2
Succinct Non-Interactive Arguments via Linear Interactive Proofs	2
On the Round Complexity of Randomized Byzantine Agreement	2
Learn from Your Faults: Leakage Assessment in Fault Attacks Using Deep Learning	2
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience	2
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer	2
Simple and Generic Constructions of Succinct Functional Encryption	2
Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation	2
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions	2
Rinocchio: SNARKs for Ring Arithmetic	2
Non-commutative Ring Learning with Errors from Cyclic Algebras	2
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable	2
ZK-PCPs from Leakage-Resilient Secret Sharing	1
Obfuscating Circuits Via Composite-Order Graded Encoding	1
Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions	1
CCA Security and Trapdoor Functions via Key-Dependent-Message Security	1
On the Exact Round Complexity of Secure Three-Party Computation	1
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model	1
PCPs and the Hardness of Generating Synthetic Data	1

Efficient Perfectly Secure Computation with Optimal Resilience	1
Adaptively Secure Distributed PRFs from $$\textsf {LWE}$$	1
On Abelian and Homomorphic Secret Sharing Schemes	1
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings	1
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm	1
A Bad Day to Die Hard: Correcting the Dieharder Battery	1
Rotational Differential-Linear Cryptanalysis Revisited	1
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors	1
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors	1
(Inner-Product) Functional Encryption with Updatable Ciphertexts	1
Non-malleable Encryption: Simpler, Shorter, Stronger	1
Decentralized Multi-authority ABE for $$\textsf{NC}^1$$ from BDH	1
Translating the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves with $$(\ell ,\ell ,\ell )$$-Isogenies	1
Oblivious RAM with Worst-Case Logarithmic Overhead	1
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries	1
Learning Strikes Again: The Case of the DRS Signature Scheme	1
On the (in)Security of ROS	1
Introduction to the Special Issue on TLS 1.3	1
Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended Version	1
Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries	1
Oblivious Sampling with Applications to Two-Party k-Means Clustering	1