OOIR: Observatory of International Research

Papers

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

Article	Citations
Simple and Generic Constructions of Succinct Functional Encryption	191
The Retracing Boomerang Attack, with Application to Reduced-Round AES	48
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors	35
The Price of Active Security in Cryptographic Protocols	30
Collision Resistance from Multi-collision Resistance	20
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness	17
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance	15
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable	14
Topology-Hiding Communication from Minimal Assumptions	14
Succinct Non-Interactive Arguments via Linear Interactive Proofs	14
Introduction to the Special Issue on TLS 1.3	13
Masking the GLP Lattice-Based Signature Scheme at Any Order	13
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption	11
Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version)	11
Memory-Efficient Attacks on Small LWE Keys	10
Is There an Oblivious RAM Lower Bound for Online Reads?	9
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model	9
Cryptographic Primitives with Hinting Property	9
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery	8
Algebraically Structured LWE, Revisited	8
(Inner-Product) Functional Encryption with Updatable Ciphertexts	8
Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT	7
Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience	7
Editorial	7
Match Me if You Can: Matchmaking Encryption and Its Applications	7

Cover Attacks for Elliptic Curves over Cubic Extension Fields	6
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes	6
Actively Secure Half-Gates with Minimum Overhead under Duplex Networks	5
Internal Symmetries and Linear Properties: Full-permutation Distinguishers and Improved Collisions on Gimli	5
The Inverse of $$\chi $$ and Its Applications to Rasta-Like Ciphers	5
No-Signaling Linear PCPs	5
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation	5
On the Exact Round Complexity of Secure Three-Party Computation	5
A Bad Day to Die Hard: Correcting the Dieharder Battery	4
Achievable CCA2 Relaxation for Homomorphic Encryption	4
Semi-quantum Money	4
Selfie: reflections on TLS 1.3 with PSK	4
Bandwidth-Hard Functions: Reductions and Lower Bounds	4
On Subversion-Resistant SNARKs	4
The Deoxys AEAD Family	3
Modeling for Three-Subset Division Property without Unknown Subset	3
A Complete Analysis of the BKZ Lattice Reduction Algorithm	3
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer	3
Compact NIZKs from Standard Assumptions on Bilinear Maps	3
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious	3
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience	3
Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting	3
Guaranteed Output in $$O(\sqrt{n})$$ Rounds for Round-Robin Sampling Protocols	3
On the Complexity of Compressing Obfuscation	3
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings	3
Bootstrapping for BGV and BFV Revisited	3
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange	3
Improved Universal Thresholdizer from Iterative Shamir Secret Sharing	3
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries	3
Non-commutative Ring Learning with Errors from Cyclic Algebras	3