OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Cryptology is 7. 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
Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions	11
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
The Retracing Boomerang Attack, with Application to Reduced-Round AES	10
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party	10
No-Signaling Linear PCPs	9

Cover Attacks for Elliptic Curves over Cubic Extension Fields	9
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	9
Four Attacks and a Proof for Telegram	8
Topical Collection on Computing on Encrypted Data	8
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
Efficient Perfectly Secure Computation with Optimal Resilience	7
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	7
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