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 2021-11-01 to 2025-11-01.)

Article	Citations
The Price of Active Security in Cryptographic Protocols	31
Algebraically Structured LWE, Revisited	27
Masking the GLP Lattice-Based Signature Scheme at Any Order	26
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery	20
Cryptographic Primitives with Hinting Property	20
A Bad Day to Die Hard: Correcting the Dieharder Battery	20
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem	18
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage	17
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm	16
Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK	15
Compact NIZKs from Standard Assumptions on Bilinear Maps	15
New Representations of the AES Key Schedule	13
Minicrypt Primitives with Algebraic Structure and Applications	12
Two Generalizations of Almost Perfect Nonlinearity	11
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol	11
Rinocchio: SNARKs for Ring Arithmetic	11
Non-malleable Vector Commitments via Local Equivocability	11
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró	11
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
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices	8
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance	8
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party	8
No-Signaling Linear PCPs	8

Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions	8
The Retracing Boomerang Attack, with Application to Reduced-Round AES	8
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves	7
Topical Collection on Computing on Encrypted Data	7
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation	7
Cover Attacks for Elliptic Curves over Cubic Extension Fields	7
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic	7
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates	6
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting	6
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them	6
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
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments	5