OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Cryptology is 2. 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 2022-08-01 to 2026-08-01.)

Article	Citations
Cryptographic Primitives with Hinting Property	50
Masking the GLP Lattice-Based Signature Scheme at Any Order	38
The Price of Active Security in Cryptographic Protocols	35
Algebraically Structured LWE, Revisited	33
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery	30
Fast Homomorphic Linear Algebra with BLAS	26
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem	25
New Representations of the AES Key Schedule	22
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions	21
Compact NIZKs from Standard Assumptions on Bilinear Maps	20
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm	19
Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK	18
Minicrypt Primitives with Algebraic Structure and Applications	17
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol	16
Rinocchio: SNARKs for Ring Arithmetic	15
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró	14
Generic Constructions of Compact and Tightly Selective-Opening Secure Public-Key Encryption Schemes	14
Two Generalizations of Almost Perfect Nonlinearity	13
Non-malleable Vector Commitments via Local Equivocability	12
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires	11
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.3	11
Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions	11
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party	10
The Retracing Boomerang Attack, with Application to Reduced-Round AES	10
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	9

No-Signaling Linear PCPs	9
Cover Attacks for Elliptic Curves over Cubic Extension Fields	9
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting	8
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation	8
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic	8
Four Attacks and a Proof for Telegram	8
Topical Collection on Computing on Encrypted Data	8
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	7
Lattice-Based Programmable Hash Functions and Applications	7
Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms	7
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates	7
New Records in Collision Attacks on SHA-2	7
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments	7
Efficient Perfectly Secure Computation with Optimal Resilience	7
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	7
Parameter Optimization and Larger Precision for (T)FHE	6
Rotational Differential-Linear Cryptanalysis Revisited	6
Analysis of Multivariate Encryption Schemes: Application to Dob and $${C}^{*}$$	6
A New Linear Distinguisher for Four-Round AES	6
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation	5
Topology-Hiding Communication from Minimal Assumptions	5
Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs	5
Space-Efficient and Noise-Robust Quantum Factoring	5
New Attacks on Feistel Structures with Improved Memory Complexities	5
Achievable CCA2 Relaxation for Homomorphic Encryption	4
Speeding Up Multi-scalar Multiplications for Pairing-Based zkSNARKs	4
Link Between the Differential Cryptanalysis and Linear Approximations over Finite Abelian Groups And Its Applications	4
The Fiat—Shamir Transformation of $$(\varGamma _1,\dots ,\varGamma _\mu )$$-Special-Sound Interactive Proofs	4
SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic Curves	4
Correction: Locally Computable UOWHF with Linear Shrinkage	4
The COLM Authenticated Encryption Scheme	3
Accurate Score Prediction for Dual-Sieve Attacks	3
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness	3
MPClan: Protocol Suite for Privacy-Conscious Computations	3
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model	3
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption	3
Quantum CCA-Secure PKE, Revisited	3
Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs	3
Adaptively Secure MPC with Sublinear Communication Complexity	3
Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended Version	3
Instance-Hiding Interactive Proofs	3
Universally Composable Almost-Everywhere Secure Computation	3
Study of Arithmetization Methods for STARKs	3
High-Throughput Secure Three-Party Computation with an Honest Majority	3
Compact Structure-Preserving Signatures with Almost Tight Security	3
A Guide to the Design of Digital Signatures based on Cryptographic Group Actions	3
Time-Space Lower Bounds for Finding Collisions in Merkle–Damgård Hash Functions	3
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors	2
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption	2
Two-Round Threshold Signature from Algebraic One-More Learning with Errors	2

Unbounded Predicate Inner Product Functional Encryption from Pairings	2
Improving Linear Key Recovery Attacks using Walsh Spectrum Puncturing	2
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness	2
Cryptographic Competitions	2
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious	2
NIZK from SNARGs	2
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency	2
BLEACH: Cleaning Errors in Discrete Computations Over CKKS	2
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $$\varvec{\Sigma }$$-Protocols	2
The Combinatorial Structure and Value Distributions of Plateaued Functions	2
On the (in)Security of ROS	2
Candidate iO from Homomorphic Encryption Schemes	2