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-08-01 to 2026-08-01.)
ArticleCitations
Cryptographic Primitives with Hinting Property50
Masking the GLP Lattice-Based Signature Scheme at Any Order38
The Price of Active Security in Cryptographic Protocols35
Algebraically Structured LWE, Revisited33
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery30
Fast Homomorphic Linear Algebra with BLAS26
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem25
New Representations of the AES Key Schedule22
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions21
Compact NIZKs from Standard Assumptions on Bilinear Maps20
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm19
Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK18
Minicrypt Primitives with Algebraic Structure and Applications17
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol16
Rinocchio: SNARKs for Ring Arithmetic15
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró14
Generic Constructions of Compact and Tightly Selective-Opening Secure Public-Key Encryption Schemes14
Two Generalizations of Almost Perfect Nonlinearity13
Non-malleable Vector Commitments via Local Equivocability12
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.311
Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions11
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires11
The Retracing Boomerang Attack, with Application to Reduced-Round AES10
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party10
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves9
No-Signaling Linear PCPs9
Cover Attacks for Elliptic Curves over Cubic Extension Fields9
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting8
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation8
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic8
Four Attacks and a Proof for Telegram8
Topical Collection on Computing on Encrypted Data8
Signed (Group) Diffie–Hellman Key Exchange with Tight Security7
Lattice-Based Programmable Hash Functions and Applications7
Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms7
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates7
New Records in Collision Attacks on SHA-27
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments7
Efficient Perfectly Secure Computation with Optimal Resilience7
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them7
Parameter Optimization and Larger Precision for (T)FHE6
Rotational Differential-Linear Cryptanalysis Revisited6
Analysis of Multivariate Encryption Schemes: Application to Dob and $${C}^{*}$$6
A New Linear Distinguisher for Four-Round AES6
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation5
Topology-Hiding Communication from Minimal Assumptions5
Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs5
Space-Efficient and Noise-Robust Quantum Factoring5
New Attacks on Feistel Structures with Improved Memory Complexities5
Link Between the Differential Cryptanalysis and Linear Approximations over Finite Abelian Groups And Its Applications4
The Fiat—Shamir Transformation of $$(\varGamma _1,\dots ,\varGamma _\mu )$$-Special-Sound Interactive Proofs4
SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic Curves4
Correction: Locally Computable UOWHF with Linear Shrinkage4
Achievable CCA2 Relaxation for Homomorphic Encryption4
Speeding Up Multi-scalar Multiplications for Pairing-Based zkSNARKs4
The COLM Authenticated Encryption Scheme3
Accurate Score Prediction for Dual-Sieve Attacks3
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness3
MPClan: Protocol Suite for Privacy-Conscious Computations3
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model3
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption3
Quantum CCA-Secure PKE, Revisited3
Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs3
Adaptively Secure MPC with Sublinear Communication Complexity3
Breaking the Decisional Diffie–Hellman Problem for Class Group Actions Using Genus Theory: Extended Version3
Instance-Hiding Interactive Proofs3
Universally Composable Almost-Everywhere Secure Computation3
Study of Arithmetization Methods for STARKs3
High-Throughput Secure Three-Party Computation with an Honest Majority3
Compact Structure-Preserving Signatures with Almost Tight Security3
A Guide to the Design of Digital Signatures based on Cryptographic Group Actions3
Time-Space Lower Bounds for Finding Collisions in Merkle–Damgård Hash Functions3
Two-Round Threshold Signature from Algebraic One-More Learning with Errors2
Unbounded Predicate Inner Product Functional Encryption from Pairings2
Improving Linear Key Recovery Attacks using Walsh Spectrum Puncturing2
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness2
Cryptographic Competitions2
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious2
NIZK from SNARGs2
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency2
BLEACH: Cleaning Errors in Discrete Computations Over CKKS2
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $$\varvec{\Sigma }$$-Protocols2
The Combinatorial Structure and Value Distributions of Plateaued Functions2
On the (in)Security of ROS2
Candidate iO from Homomorphic Encryption Schemes2
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors2
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption2
0.2061140537262