OOIR: Observatory of International Research

Papers

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

Article	Citations
Algebraically Structured LWE, Revisited	207
Cryptographic Primitives with Hinting Property	52
Masking the GLP Lattice-Based Signature Scheme at Any Order	36
The Price of Active Security in Cryptographic Protocols	21
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery	20
A Bad Day to Die Hard: Correcting the Dieharder Battery	17
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm	15
A Formal Analysis of Prefetching in Profiled Cache-Timing Attacks on Block Ciphers	15
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage	14
New Representations of the AES Key Schedule	14
Compact NIZKs from Standard Assumptions on Bilinear Maps	14
Minicrypt Primitives with Algebraic Structure and Applications	14
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró	13
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol	12
Rinocchio: SNARKs for Ring Arithmetic	11
On Abelian and Homomorphic Secret Sharing Schemes	11
Two Generalizations of Almost Perfect Nonlinearity	11
Non-malleable Vector Commitments via Local Equivocability	10
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires	9
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.3	9
Multiparty Generation of an RSA Modulus	9
Ascon v1.2: Lightweight Authenticated Encryption and Hashing	9
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance	8
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness	8
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party	8

Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices	8
Modeling for Three-Subset Division Property without Unknown Subset	7
No-Signaling Linear PCPs	7
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange	7
The Retracing Boomerang Attack, with Application to Reduced-Round AES	7
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer	6
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation	6
Cover Attacks for Elliptic Curves over Cubic Extension Fields	6
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	6
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting	5
Fine-Grained Cryptography Revisited	5
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic	5
Topical Collection on Computing on Encrypted Data	5
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates	5
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	4
Rotational Differential-Linear Cryptanalysis Revisited	4
Is There an Oblivious RAM Lower Bound for Online Reads?	4
The Design and Evolution of OCB	4
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments	4
Parameter Optimization and Larger Precision for (T)FHE	4
Analysis of Multivariate Encryption Schemes: Application to Dob and $${C}^{*}$$	4
Lattice-Based Programmable Hash Functions and Applications	4
Efficient Perfectly Secure Computation with Optimal Resilience	4
Topology-Hiding Communication from Minimal Assumptions	4
Signed (Group) Diffie–Hellman Key Exchange with Tight Security	4