Journal of Cryptology

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-06-01 to 2025-06-01.)
ArticleCitations
Algebraically Structured LWE, Revisited216
Cryptographic Primitives with Hinting Property54
The Price of Active Security in Cryptographic Protocols37
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery23
Masking the GLP Lattice-Based Signature Scheme at Any Order21
A Bad Day to Die Hard: Correcting the Dieharder Battery20
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage16
New Representations of the AES Key Schedule15
Compact NIZKs from Standard Assumptions on Bilinear Maps15
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm15
Minicrypt Primitives with Algebraic Structure and Applications14
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol14
Two Generalizations of Almost Perfect Nonlinearity12
Rinocchio: SNARKs for Ring Arithmetic12
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró11
On Abelian and Homomorphic Secret Sharing Schemes10
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires9
Non-malleable Vector Commitments via Local Equivocability9
Multiparty Generation of an RSA Modulus8
Ascon v1.2: Lightweight Authenticated Encryption and Hashing8
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices8
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.38
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party8
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance7
The Retracing Boomerang Attack, with Application to Reduced-Round AES7
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness7
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer6
No-Signaling Linear PCPs6
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation6
Cover Attacks for Elliptic Curves over Cubic Extension Fields6
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves6
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange6
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates5
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic5
The Design and Evolution of OCB5
Topical Collection on Computing on Encrypted Data5
Lattice-Based Programmable Hash Functions and Applications5
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting5
0.048636913299561