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 2021-06-01 to 2025-06-01.)

Article	Citations
Algebraically Structured LWE, Revisited	216
Cryptographic Primitives with Hinting Property	54
The Price of Active Security in Cryptographic Protocols	37
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery	23
Masking the GLP Lattice-Based Signature Scheme at Any Order	21
A Bad Day to Die Hard: Correcting the Dieharder Battery	20
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage	16
Compact NIZKs from Standard Assumptions on Bilinear Maps	15
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm	15
New Representations of the AES Key Schedule	15
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol	14
Minicrypt Primitives with Algebraic Structure and Applications	14
Two Generalizations of Almost Perfect Nonlinearity	12
Rinocchio: SNARKs for Ring Arithmetic	12
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró	11
On Abelian and Homomorphic Secret Sharing Schemes	10
Non-malleable Vector Commitments via Local Equivocability	9
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires	9
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.3	8
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party	8
Multiparty Generation of an RSA Modulus	8
Ascon v1.2: Lightweight Authenticated Encryption and Hashing	8
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices	8
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness	7
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance	7

The Retracing Boomerang Attack, with Application to Reduced-Round AES	7
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	6
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange	6
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer	6
No-Signaling Linear PCPs	6
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation	6
Cover Attacks for Elliptic Curves over Cubic Extension Fields	6
Topical Collection on Computing on Encrypted Data	5
Lattice-Based Programmable Hash Functions and Applications	5
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting	5
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates	5
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic	5
The Design and Evolution of OCB	5
Efficient Perfectly Secure Computation with Optimal Resilience	4
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	4
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	4
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments	4
Rotational Differential-Linear Cryptanalysis Revisited	3
Speeding Up Multi-scalar Multiplications for Pairing-Based zkSNARKs	3
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable	3
Parameter Optimization and Larger Precision for (T)FHE	3
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation	3
Analysis of Multivariate Encryption Schemes: Application to Dob and $${C}^{*}$$	3
Topology-Hiding Communication from Minimal Assumptions	3
Achievable CCA2 Relaxation for Homomorphic Encryption	3
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage	2
Everlasting UC Commitments from Fully Malicious PUFs	2
Non-commutative Ring Learning with Errors from Cyclic Algebras	2
Time-Space Lower Bounds for Finding Collisions in Merkle–Damgård Hash Functions	2
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness	2
The COLM Authenticated Encryption Scheme	2
Correction: Locally Computable UOWHF with Linear Shrinkage	2
A Note on Perfect Correctness by Derandomization	2
Compact Structure-Preserving Signatures with Almost Tight Security	2
High-Throughput Secure Three-Party Computation with an Honest Majority	2
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings	2
Correction to: Editorial	2
SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic Curves	2
Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs	2
Translating the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves with $$(\ell ,\ell ,\ell )$$-Isogenies	2
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?	1
MPClan: Protocol Suite for Privacy-Conscious Computations	1
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model	1
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness	1
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption	1
On the Complexity of Compressing Obfuscation	1
Adaptively Secure MPC with Sublinear Communication Complexity	1
On the Round Complexity of Randomized Byzantine Agreement	1
Succinct Non-Interactive Arguments via Linear Interactive Proofs	1
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious	1

BLEACH: Cleaning Errors in Discrete Computations Over CKKS	1
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $$\varvec{\Sigma }$$-Protocols	1
Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended Version	1
From Fairness to Full Security in Multiparty Computation	1
Semi-quantum Money	1
The Deoxys AEAD Family	1
Cryptographic Competitions	1
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors	1
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption	1