Journal of Cryptology

Papers
(The median citation count of Journal of Cryptology is 2. 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 2022-01-01 to 2026-01-01.)
ArticleCitations
The Price of Active Security in Cryptographic Protocols37
Algebraically Structured LWE, Revisited34
Cryptographic Primitives with Hinting Property31
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery25
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem22
Masking the GLP Lattice-Based Signature Scheme at Any Order22
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage21
New Representations of the AES Key Schedule19
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions18
Compact NIZKs from Standard Assumptions on Bilinear Maps17
Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK16
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm15
Minicrypt Primitives with Algebraic Structure and Applications15
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol13
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ó12
Non-malleable Vector Commitments via Local Equivocability11
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires10
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.39
Multiparty Generation of an RSA Modulus9
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party9
Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions9
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves8
The Retracing Boomerang Attack, with Application to Reduced-Round AES8
Cover Attacks for Elliptic Curves over Cubic Extension Fields8
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance8
No-Signaling Linear PCPs8
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices8
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic7
Topical Collection on Computing on Encrypted Data7
Four Attacks and a Proof for Telegram7
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation7
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates6
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them6
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting6
A New Linear Distinguisher for Four-Round AES5
Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms5
Efficient Perfectly Secure Computation with Optimal Resilience5
Signed (Group) Diffie–Hellman Key Exchange with Tight Security5
Lattice-Based Programmable Hash Functions and Applications5
Rotational Differential-Linear Cryptanalysis Revisited5
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments5
Topology-Hiding Communication from Minimal Assumptions4
Achievable CCA2 Relaxation for Homomorphic Encryption4
Parameter Optimization and Larger Precision for (T)FHE4
Speeding Up Multi-scalar Multiplications for Pairing-Based zkSNARKs4
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable4
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation4
Analysis of Multivariate Encryption Schemes: Application to Dob and $${C}^{*}$$4
A Note on Perfect Correctness by Derandomization3
Non-commutative Ring Learning with Errors from Cyclic Algebras3
Accurate Score Prediction for Dual-Sieve Attacks3
High-Throughput Secure Three-Party Computation with an Honest Majority3
Correction: Locally Computable UOWHF with Linear Shrinkage3
Everlasting UC Commitments from Fully Malicious PUFs3
Quantum CCA-Secure PKE, Revisited3
Compact Structure-Preserving Signatures with Almost Tight Security3
The COLM Authenticated Encryption Scheme3
SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic Curves3
Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs3
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness2
MPClan: Protocol Suite for Privacy-Conscious Computations2
A Guide to the Design of Digital Signatures based on Cryptographic Group Actions2
Cryptographic Competitions2
Two-Round Threshold Signature from Algebraic One-More Learning with Errors2
Semi-quantum Money2
Adaptively Secure MPC with Sublinear Communication Complexity2
On the Round Complexity of Randomized Byzantine Agreement2
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model2
On the Complexity of Compressing Obfuscation2
BLEACH: Cleaning Errors in Discrete Computations Over CKKS2
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness2
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption2
Time-Space Lower Bounds for Finding Collisions in Merkle–Damgård Hash Functions2
Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended Version2
Succinct Non-Interactive Arguments via Linear Interactive Proofs2
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $$\varvec{\Sigma }$$-Protocols2
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption2
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious2
0.038420915603638