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

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

Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	8
The Retracing Boomerang Attack, with Application to Reduced-Round AES	8
Cover Attacks for Elliptic Curves over Cubic Extension Fields	8
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance	8
Four Attacks and a Proof for Telegram	7
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation	7
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic	7
Topical Collection on Computing on Encrypted Data	7
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting	6
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates	6
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	6
Rotational Differential-Linear Cryptanalysis Revisited	5
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments	5
A New Linear Distinguisher for Four-Round AES	5
Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms	5
Efficient Perfectly Secure Computation with Optimal Resilience	5
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	5
Lattice-Based Programmable Hash Functions and Applications	5