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

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

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

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious	2
MPClan: Protocol Suite for Privacy-Conscious Computations	2
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption	2
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness	2
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
Universally Composable Almost-Everywhere Secure Computation	2