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-09-01 to 2025-09-01.)
ArticleCitations
The Price of Active Security in Cryptographic Protocols26
Algebraically Structured LWE, Revisited26
Cryptographic Primitives with Hinting Property23
Masking the GLP Lattice-Based Signature Scheme at Any Order19
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery19
A Bad Day to Die Hard: Correcting the Dieharder Battery19
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem16
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage15
Compact NIZKs from Standard Assumptions on Bilinear Maps14
New Representations of the AES Key Schedule13
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm13
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol12
Minicrypt Primitives with Algebraic Structure and Applications12
Two Generalizations of Almost Perfect Nonlinearity11
Rinocchio: SNARKs for Ring Arithmetic10
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró10
On Abelian and Homomorphic Secret Sharing Schemes10
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires9
Multiparty Generation of an RSA Modulus9
Non-malleable Vector Commitments via Local Equivocability9
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party8
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.38
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices8
Cover Attacks for Elliptic Curves over Cubic Extension Fields7
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance7
No-Signaling Linear PCPs7
Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions7
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange7
The Retracing Boomerang Attack, with Application to Reduced-Round AES7
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting6
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation6
Topical Collection on Computing on Encrypted Data6
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves6
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic6
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments5
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them5
Efficient Perfectly Secure Computation with Optimal Resilience5
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates5
Signed (Group) Diffie–Hellman Key Exchange with Tight Security5
0.053096055984497