EUVIMED · CrossrefJournal
Journal of Cryptology
ISSN 0933-2790 · Springer Science and Business Media LLC
Latest articles
Feistel-Like Structures Revisited: Classification and Cryptanalysis
A Tool for Fast and Secure LWE Parameter Selection: The FHE Case
Fine-Grained Non-interactive Key Exchange without Idealized Assumptions, and Lower Bounds
Pseudorandom FE and iO with Applications
New Records in Collision Attacks on SHA-2
Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More
One (Noisy) Bit to Rule Them All: Key Recovery from Randomness Leakage in ML-DSA
PRISM with a Pinch of Salt: Simple, Efficient, and Strongly Unforgeable Signatures from Isogenies
Polynomial-Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Setting
Adaptively Secure Constrained Pseudorandom Functions in the Standard Model
Security Analysis of NIST Key Derivation Using Pseudorandom Functions
Space-Efficient and Noise-Robust Quantum Factoring
Accurate Score Prediction for Dual-Sieve Attacks
Faster Homomorphic Operations and Beyond: Expediting Homomorphic Computation via Boolean Circuit Optimization
A Guide to the Design of Digital Signatures based on Cryptographic Group Actions
Threshold Computation in the Head: Improved Framework for Post-Quantum Signatures and Zero-Knowledge Arguments
Ceno: Non-uniform, Segment and Parallel Zero-Knowledge Virtual Machine
Two Generalizations of Almost Perfect Nonlinearity
New Representations of the AES Key Schedule
A Complete Analysis of the BKZ Lattice Reduction Algorithm
An Efficient ZK Compiler from SIMD Circuits to General Circuits
Compact Proofs of Partial Knowledge for Overlapping CNF Formulae
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them
Improved Universal Thresholdizer from Iterative Shamir Secret Sharing
Randomness Recoverable Secret Sharing Schemes
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors
Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $$\varvec{\Sigma }$$-Protocols
Algebraically Structured LWE, Revisited
Volumes
2027 · 52026 · 252025 · 362024 · 392023 · 412022 · 292021 · 452020 · 462019 · 362018 · 322017 · 332016 · 262015 · 282014 · 242013 · 242012 · 232011 · 262010 · 202009 · 202008 · 202007 · 212006 · 172005 · 182004 · 152003 · 122002 · 162001 · 162000 · 221999 · 161998 · 171997 · 161996 · 301995 · 131994 · 121993 · 151992 · 141991 · 221990 · 141989 · 71988 · 9
EUVIMED