OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Cryptology is 5. 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-05-01 to 2026-05-01.)

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

Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	8
Topical Collection on Computing on Encrypted Data	8
Cover Attacks for Elliptic Curves over Cubic Extension Fields	8
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation	8
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates	7
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting	7
Four Attacks and a Proof for Telegram	7
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic	7
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	7
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments	6
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	6
Lattice-Based Programmable Hash Functions and Applications	6
Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms	6
Efficient Perfectly Secure Computation with Optimal Resilience	6
Rotational Differential-Linear Cryptanalysis Revisited	5
Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs	5
A New Linear Distinguisher for Four-Round AES	5
Space-Efficient and Noise-Robust Quantum Factoring	5
Topology-Hiding Communication from Minimal Assumptions	5
Analysis of Multivariate Encryption Schemes: Application to Dob and $${C}^{*}$$	5
Parameter Optimization and Larger Precision for (T)FHE	5