Tag - #paper

(2026-04) Which Privacy Blanket is Optimal in the Shuffle Model 1970-01-01

(2026-04) Verification Facade; Masquerading Insecure Cryptographic Implementations as Verified Code 1970-01-01

(2026-04) Verifiable Divide-and-Conquer 1970-01-01

(2026-04) VeriRAG; Efficient Zero-Knowledge Proofs for Verifiable Retrieval-Augmented Generation 1970-01-01

(2026-04) Toward Provable Security in Anamorphic Extension; New Constructions and Analysis 1970-01-01

(2026-04) Tighter Bounds for the Oblivious Bit-Fixing Inner Product Extractor on Biased Seeds 1970-01-01

(2026-04) THED; Threshold Dilithium from FHE 1970-01-01

(2026-04) Synchronous BFT with Provability and Fast Path for the Age of Blockchains 1970-01-01

(2026-04) SoK; The Weakest-Link Principle in Public Key Infrastructures and Modern Mitigation Strategies 1970-01-01

(2026-04) SoK; DeFi Lending and Yield Aggregation Protocol Taxonomy, Empirical Measurements, and Security Challenges 1970-01-01

(2026-04) Signature Placement in Post-Quantum TLS Certificate Hierarchies; An Experimental Study of ML-DSA and SLH-DSA in TLS 1.3 Authentication 1970-01-01

(2026-04) SSLE-DAG; A High-Throughput Proof-of-Stake Consensus Protocol Combining an Adaptive DAG with a Single Secret Leader Election 1970-01-01

(2026-04) Robot; Robust Threshold BBS+ in Two Rounds 1970-01-01

(2026-04) Reformulating the SNOVA Signature Scheme 1970-01-01

(2026-04) Random Robust Secret Sharing with Perfect Privacy and its Applications 1970-01-01

(2026-04) Pseudorandomness of UFLM; A Characterization via Its Linear Layer 1970-01-01

(2026-04) Progressive Sieving-Style Information-Set Decoding Algorithm 1970-01-01

(2026-04) PlasmaBlind; A Private Layer 2 With Instant Client-Side Proving 1970-01-01

(2026-04) Perils of Parallelism; Transaction Fee Mechanisms under Execution Uncertainty 1970-01-01

(2026-04) Ordered Multi-Signatures from the DL Assumption 1970-01-01

(2026-04) On Optimal Information-Theoretic Security in Symmetric Encryption under Low-Entropy Keys 1970-01-01

(2026-04) MIKE (Module Isogeny Key Exchange); An ἰχθύς introduction 1970-01-01

(2026-04) Improved Codes and Decoders for HQC 1970-01-01

(2026-04) HyperVerITAS; Verifying Image Transformations at Scale on Boolean Hypercubes 1970-01-01

(2026-04) Game Theory Does Not Always Help; The Case of Statistical Multi-Party Coin Tossing 1970-01-01

(2026-04) From LFSRs to LFGs; Periodicity and Structural Transformations in Stream Ciphers 1970-01-01

(2026-04) Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation 1970-01-01

(2026-04) FOVA; Fast One-Shot Verifiable Aggregation for Federated Learning 1970-01-01

(2026-04) FLOSS; Fast Linear Online Secret-Shared Shuffling 1970-01-01

(2026-04) Expanders Meet Reed--Muller; Easy Instances of Noisy k-XOR 1970-01-01

(2026-04) Efficient Merkle-Tree Consistent Accumulator 1970-01-01

(2026-04) Efficient Batch Threshold Encryption Using Partial Fraction Techniques 1970-01-01

(2026-04) Cryptographic Implications of Worst-Case Hardness of Time-Bounded Kolmogorov Complexity 1970-01-01

(2026-04) Counting and recovering the quadratic relations of a vectorial function 1970-01-01

(2026-04) Braess Paradox in Layer-2 Blockchain Payment Networks 1970-01-01

(2026-04) Batch Verification of Modified ECDSA Signatures 1970-01-01

(2026-04) Applications of Bruhat-Chevalley-Renner Decomposition to Metric-Aware Code-Based Cryptography 1970-01-01

(2026-04) A tight security analysis of the FIPS-205 standard (SLH-DSA) 1970-01-01

(2026-04) A note on the Unsuitability of LIGA for Linkable Ring Signatures; The perils of non-commutativity 1970-01-01

(2026-03) {{-mathsf{SMA}^2-mathsf{RT}}} ; Secret-Metadata Attribute-based Anonymous Rate-limited Tokens 1970-01-01

(2026-03) zkBSA; Auditable Blockchain Stealth Address 1970-01-01

(2026-03) vkproof; Succinct verification of indexed verifying keys using modular compilation and polynomial fingerprinting 1970-01-01

(2026-03) iToken; One-Time-Use Anonymous Token with Issuance Hiding 1970-01-01

(2026-03) Zeeperio; Verifying Governmental Elections with Ethereum 1970-01-01

(2026-03) Updatable Private Set Intersection from Symmetric-Key Techniques 1970-01-01

(2026-03) UniMSM; An Efficient and Flexible Hardware Accelerator for Multi-Scalar Multiplication 1970-01-01

(2026-03) Two-Party BBS+ Signature in Two Passes 1970-01-01

(2026-03) Two Decades of Identity-Based Identification Schemes- A Survey on Challenges and Advances 1970-01-01

(2026-03) Tweed; Adaptively Secure Lattice-Based Two-Round Threshold Signatures 1970-01-01

(2026-03) Triangulating Meet-in-the-Middle Attack 1970-01-01

(2026-03) Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference 1970-01-01

(2026-03) Towards Formal Security Proofs of MQOM 1970-01-01

(2026-03) Towards Compact UOV-Based MQ Signatures; Rectangular and Lifted Whipping Structures 1970-01-01

(2026-03) Tighter Proofs for PKE-to-KEM Transformations under Average-Case Decryption Error and without -gamma-Spread 1970-01-01

(2026-03) Ticket to Hide; Private, Practical Proofs of Provenance for TLS 1970-01-01

(2026-03) Threshold Traitor Tracing Revisited; Insider Attacks and Multi-Traitor Tracing 1970-01-01

(2026-03) Three-Move Blind Signatures in Pairing-Free Groups 1970-01-01

(2026-03) The principal ideal problem for endomorphism rings of superspecial abelian varieties 1970-01-01

(2026-03) The OCH Authenticated Encryption Scheme 1970-01-01

(2026-03) The Art of Linearization; From a KZG’s Trick to a General Commitment Framework 1970-01-01

(2026-03) Tailored Limb Counts, Faster Arithmetic; Improved TMVP Decompositions for Curve5453 and Curve6071 1970-01-01

(2026-03) TAPAS; Efficient Two-Server Asymmetric Private Aggregation Beyond Prio(+) 1970-01-01

(2026-03) SynCirc; Efficient Synthesis of Depth-Optimized Circuits from High-Level Languages (Extended Version) 1970-01-01

(2026-03) Survey of isogeny-based signature schemes resistant to Castryck–Decru attack 1970-01-01

(2026-03) Succinct Verification of Lattice-Based Compressed -Sigma-Protocols via Delegated Proofs of Correct Folding of Cryptographically Generated Public Parameters 1970-01-01

(2026-03) Strong Efficiency Lower Bounds for Byzantine Agreement 1970-01-01

(2026-03) StarHunters— Secure Hybrid Post-Quantum KEMs From IND-CCA2 PKEs 1970-01-01

(2026-03) Speeding Up Sum-Check Proving (Extended Version) 1970-01-01

(2026-03) SoK; Updatable Public-Key Encryption 1970-01-01

(2026-03) Signal Lost (Integrity); The Signal App is More than the Sum of its Protocols 1970-01-01

(2026-03) Short Signatures from DDH without Pairings or Random Oracles 1970-01-01

(2026-03) Semigroup Action Problems and Their Uses in Post-Quantum Cryptography 1970-01-01

(2026-03) Secure Matrix Invertibility Testing over Fields of Small Order or Characteristics 1970-01-01

(2026-03) Secret-Shared Shuffle from Authenticated Correlations 1970-01-01

(2026-03) Schnorr Blind Signatures and Signed ElGamal KEM in Algebraic Group Action Model 1970-01-01

(2026-03) Scaling Fully Secure MPC via Robust Recursive Search and Gap Amplification 1970-01-01

(2026-03) Scalable Compliant Privacy on Starknet 1970-01-01

(2026-03) SCALE-FL; Scalable Cryptography-based Aggregation with Lightweight Enclaves for Federated Learning 1970-01-01

(2026-03) S-two Whitepaper 1970-01-01

(2026-03) Round-Optimal Threshold Blind Signatures without Random Oracles 1970-01-01

(2026-03) RoKoko; Lattice-based Succinct Arguments, a Committed Refinement 1970-01-01

(2026-03) Revisiting the Security of Sparkle 1970-01-01

(2026-03) Rethinking r-PKP; a New Formulation for the Relaxed Permuted Kernel Problem 1970-01-01

(2026-03) Refined Approx-SVP Rank Reduction Conditions and Adaptive Lattice Reduction for MSIS Security Estimation 1970-01-01

(2026-03) Radical 3-isogenies for the ideal class group actions on (2, -varepsilon)-structures 1970-01-01

(2026-03) Proving modern code-based dual attacks with second-order techniques 1970-01-01

(2026-03) Proof-Carrying Data via Holography Accumulation 1970-01-01

(2026-03) Privacy at your Fingertips; Enabling Rapid Client-Side Operations in Fully Homomorphic Encryption 1970-01-01

(2026-03) PrivaLean; Low-Latency and High-Accuracy System for Secure 2PC Inference 1970-01-01

(2026-03) PrivaDE; Privacy-preserving Data Evaluation for Blockchain-based Data Marketplaces 1970-01-01

(2026-03) Practically Efficient Linear-Time Protocols for Server-Aided Private Set Union and Third Party Private Set Operations 1970-01-01

(2026-03) Post-Quantum Security of Keyed Sum of Permutations and Its Siblings 1970-01-01

(2026-03) Post-Quantum Cryptography from Quantum Stabilizer Decoding 1970-01-01

(2026-03) Post-Quantum Blockchains with Agility in Mind 1970-01-01

(2026-03) Post-Quantum Anonymous Signatures from the Lattice Isomorphism Group Action 1970-01-01

(2026-03) Playing Tag with Okamoto-Schnorr; Three-Move Pairing-Free Blind Signatures from DDH 1970-01-01

(2026-03) PUFF; Maximally Proactive Security for Free in Perfectly Secure MPC with Guaranteed Output Delivery 1970-01-01

(2026-03) PRIVADA; Private user-centric Data Aggregation 1970-01-01

(2026-03) PRISM with a pinch of salt; Simple, Efficient and Strongly Unforgeable Signatures from Isogenies 1970-01-01

(2026-03) PIKE; Faster Isogeny-Based Public Key Encryption with Pairing-Assisted Decryption 1970-01-01

(2026-03) Orca And Dolphin; Efficient Bivariate And Multilinear Polynomial Commitment Schemes Under Standard Assumptions 1970-01-01

(2026-03) Optimizing FROST for Message Capacity 1970-01-01

(2026-03) On the properties of arithmetic crosscorrelation for sequences with coprime periods 1970-01-01

(2026-03) On the Security of MPC-in-the-Head Signatures with Correlated GGM Trees 1970-01-01

(2026-03) On the Security of Constraint-Friendly Map-to-Curve Relations 1970-01-01

(2026-03) On the CCA security properties of a class of group-based linearly homomorphic encryption schemes 1970-01-01

(2026-03) On quadratic equations of q-regular tree and their applications in Graph Theory and Cryptography 1970-01-01

(2026-03) On Post-Quantum Signature with Message Recovery from Hash-and-Sign in QROM 1970-01-01

(2026-03) Oblivious Single Access Machines are Concretely Efficient 1970-01-01

(2026-03) New Approaches to Zero-Knowledge SNARG Constructions 1970-01-01

(2026-03) Naor-Yung Transform for IND-CCA Probing Security with Lattice Instantiations 1970-01-01

(2026-03) NI-DKG; Non-Interactive Distributed Key Generation Using Blockchain and Zero-Knowledge Proofs 1970-01-01

(2026-03) Multi-Instance Security Degradation of Code-Based KEMs 1970-01-01

(2026-03) More Brisés in Ballet; Extending Differential and Linear Cryptanalysis 1970-01-01

(2026-03) Model Extraction of Convolutional Neural Networks with Max-Pooling 1970-01-01

(2026-03) Low-Depth Construction of Grover Oracles from Fully Functional Quantum Circuits 1970-01-01

(2026-03) Lookup Arguments over Rings and Applications to Batch-Verification of RAM Programs 1970-01-01

(2026-03) Linear Code Equivalence via Plücker Coordinates 1970-01-01

(2026-03) Libra; Pattern-Scheduling Co-Optimization for Cross-Scheme FHE Code Generation over GPGPU 1970-01-01

(2026-03) Interactive Proofs for Batch Polynomial Evaluation 1970-01-01

(2026-03) Information-Theoretic Strong Traceable Secret Sharing Schemes 1970-01-01

(2026-03) Improving ML Attacks on LWE with Data Repetition and Stepwise Regression 1970-01-01

(2026-03) Improved Issuer Hiding for BBS-based Anonymous Credentials 1970-01-01

(2026-03) Implementation of a post-quantum hybrid group key exchange protocol 1970-01-01

(2026-03) Icefish; Practical zk-SNARKs for Verifiable Genomics 1970-01-01

(2026-03) Hybrid KEM Constructions from Classical PKEs and Post-Quantum KEMs 1970-01-01

(2026-03) How Much Verifier's Dilemma and Staking Pools Adversely Affect Decentralization of Ethereum PoS under Realistic Operational Costs (Extended Version) 1970-01-01

(2026-03) High-Order Galois Automorphisms for TNFS Linear Algebra 1970-01-01

(2026-03) Hermine; An Efficient Lattice-based FROST-like Threshold Signature 1970-01-01

(2026-03) Hashing in Generic Groups; Completing the AGM-to-GGM Transfer 1970-01-01

(2026-03) Haechi; Simple Commitment-based Keyless In-person Verifiable Elections 1970-01-01

(2026-03) Gryphes; Hybrid Proofs for Modular SNARKs with Applications to zkRollups 1970-01-01

(2026-03) Graph-based Asynchrony with Quasilinear Complexity for Any Linear Verifiable Secret Sharing Scheme 1970-01-01

(2026-03) Fuzzy Private Set Intersection for Real-World Datasets 1970-01-01

(2026-03) FrozenTRU; Cold Boot Attacks on NTRU-Based Hash-and-Sign Signatures 1970-01-01

(2026-03) Format-Preserving Compression-Tolerating Authenticated Encryption for Images 1970-01-01

(2026-03) Finite Field Arithmetic for ML-KEM Using Zech's Logarithm 1970-01-01

(2026-03) Fast and Compact Lattice-Based Registration-Based Encryption 1970-01-01

(2026-03) FROSTLASS; Flexible Ring-Oriented Schnorr-like Thresholdized Linkably Anonymous Signature Scheme 1970-01-01

(2026-03) FALCON with message recovery, a specification 1970-01-01

(2026-03) Exploiting noisy single-bit leakage in ML-DSA 1970-01-01

(2026-03) Expander properties of superspecial isogeny digraphs with level structure 1970-01-01

(2026-03) Efficient and Parallel Implementation of Isogeny-based Deterministic Group Actions 1970-01-01

(2026-03) Efficient Single-Server Stateful PIR Using Format-Preserving Encryption 1970-01-01

(2026-03) Efficient RLWE based Chosen-Ciphertext Secure Dual-Receiver Encryption and Sender-Binding KEM in the Standard Model 1970-01-01

(2026-03) Efficient Private Range Queries on Public Data 1970-01-01

(2026-03) Efficient Compilers for Verifiable Dynamic Searchable Symmetric Encryption 1970-01-01

(2026-03) Earpicks; Tightly Secure Two-Round Multi- and Threshold Signatures 1970-01-01

(2026-03) Duty-Free Bits; Projectivizing Garbling Schemes 1970-01-01

(2026-03) Dialga; A Family of Low-Latency Tweakable Block Ciphers using Multiple Linear Layers (Full Version) 1970-01-01

(2026-03) Descent into Broken Trust; Uncovering ML-DSA Subkeys with Scarce Leakage and Local Optimization 1970-01-01

(2026-03) Debt-Aware Bonding Curves; Non-Decreasing Floor Prices and Non-Liquidatable Borrowing 1970-01-01

(2026-03) Cryptanalysis of the Lightweight Stream Cipher RRSC 1970-01-01

(2026-03) Cryptanalysis of Two Alternating Moduli Weak PRFs 1970-01-01

(2026-03) Cryptanalysis of Polynomial Learning With Errors (PLWE); A Survey 1970-01-01

(2026-03) Coppersmith's Method for Solving Modular Inversion Hidden Number Problem via Determinant-Based Elimination 1970-01-01

(2026-03) Concrete Estimation of Correctness and IND-CPA-D Security for FHE via Rare Event Simulation 1970-01-01

(2026-03) Compression And Decompression Under FHE Using Error-Correcting Codes and Copy-And-Recurse 1970-01-01

(2026-03) Compact HQC with new (un)balance 1970-01-01

(2026-03) Committing Security of BBB Secure MACs 1970-01-01

(2026-03) Cheap Digit Decomposition and Large Plaintext Spaces in FHEW using Phase Splitting 1970-01-01

(2026-03) CatCrypt; From Rust to Cryptographic Security in Lean 1970-01-01

(2026-03) Can Adaptive Communication Graphs Lower the Bottleneck Complexity of (Secure) Multiparty Computation 1970-01-01

(2026-03) CHOPIN; Optimal Pairing-Based Multilinear Polynomial Commitments from Bivariate KZG 1970-01-01

(2026-03) Byzantine Consensus in the Partially Authenticated Setting 1970-01-01

(2026-03) Bulletproofs; Verifier-Efficient Arithmetic Circuit Proofs via Folding 1970-01-01

(2026-03) Bridging Programmability, Efficiency, and Bounded Trust; A Hybrid Privacy-Preserving Smart Contract Framework 1970-01-01

(2026-03) Attacks on Sparse LWE and Sparse LPN with new Sample-Time tradeoffs 1970-01-01

(2026-03) Asynchronous MPC with Abort 1970-01-01

(2026-03) Asymptotic Analysis of Ternary Sparse LWE 1970-01-01

(2026-03) Analyzing the WebRTC Ecosystem and Breaking Authentication in DTLS-SRTP 1970-01-01

(2026-03) An attack on the CFS scheme and on TII McEliece challenges 1970-01-01

(2026-03) An Ultra-Robust Privacy Preserving Scheme for Federated Learning using Distributed Homomorphic Encryption 1970-01-01

(2026-03) Aggregator-Based Voting using proof of Partition 1970-01-01

(2026-03) Advanced cryptography from lattice isomorphism—new constructions of IBE and FHE 1970-01-01

(2026-03) Adaptively Secure, Universally Composable Distributed Generation of Discrete-Logarithm Based Keys 1970-01-01

(2026-03) Accurate Parameter Estimates for Punctured Key Recovery Linear Attacks 1970-01-01

(2026-03) Accelerating FAEST Signatures on ARM; NEON SIMD AES and Parallel VOLE Optimization 1970-01-01

(2026-03) A flexible and polynomial framework for integer arithmetic in CKKS 1970-01-01

(2026-03) A Universal Blinder; One-round Blind Signatures from FHE 1970-01-01

(2026-03) A Resource-Efficient Hardware Accelerator for Large-Size NTT via Algorithm–Architecture Co-Design 1970-01-01

(2026-03) A Quantum-Safe Private Group System for Signal from Key Re-Randomizable Signatures 1970-01-01

(2026-03) A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes 1970-01-01

(2026-03) A Note on ''Linear-Communication ACSS with Guaranteed Termination and Lower Amortized Bound'' 1970-01-01

(2026-03) A Maliciously-Secure Post-Quantum OPRF from Crypto Dark Matter 1970-01-01

(2026-03) A Generalized Partial Exposure Lattice Attack Against an RSA variant Based on Cubic Pell Curves 1970-01-01

(2026-03) A Comparative Evaluation of DATA and Microwalk for Detecting Constant-Time Violations in Cryptographic Libraries 1970-01-01

(2026-03) -mathsf{GlueLUT}; Generalized Lookup Table Arguments over Residue Rings via Auxiliary Fields 1970-01-01

(2026-02) gcVM; Publicly Auditable MPC via Garbled Circuits with Applications to Private EVM-Compatible Computation 1970-01-01

(2026-02) eVer; Universal and Automated Verification of Side-Channel Security for Additive, Inner Product, Polynomial and General Code-Based Masking 1970-01-01

(2026-02) eDAS; Extending Data Availability Sampling with Privacy and Compliance 1970-01-01

(2026-02) Zero-Knowledge Proof-Carrying Data from Accumulation Schemes 1970-01-01

(2026-02) Zero-Knowledge IOPPs for Constrained Interleaved Codes 1970-01-01

(2026-02) Zebra; Arithmetic Garbled RAM for Large Words from DCR 1970-01-01

(2026-02) ZKBoost; Zero-Knowledge Verifiable Training for XGBoost 1970-01-01

(2026-02) WillowFold; Secure Aggregation with a Lightweight Committee 1970-01-01

(2026-02) When Trying to Catch Cheaters Breaks the MPC (Full Version) 1970-01-01

(2026-02) What a Wonderful World; zkSNARKs in the Algebraic Group Model are Universally Composable 1970-01-01

(2026-02) Weighted Cryptography with Weight-Independent Complexity 1970-01-01

(2026-02) Weak Zero-Knowledge and One-Way Functions 1970-01-01

(2026-02) WOTS-Tree; Merkle-Optimized Winternitz Signatures for Post-Quantum Bitcoin 1970-01-01

(2026-02) VisualDedup; Visual Fuzzy Deduplication for Secure Batch Duplicates Detection without Server Aided 1970-01-01

(2026-02) VROOM; Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number System 1970-01-01

(2026-02) Upper Bound on Information-Theoretic Security of Permutation-Based Pseudorandom Functions 1970-01-01

(2026-02) Understanding Multi-Query Attacks on Key-Then-Hash Functions 1970-01-01

(2026-02) UltraFold; Efficient Distributed BaseFold from Packed Interleaved Merkle Trees 1970-01-01

(2026-02) Ultra short signatures with Dragon HFE_{LL'} 1970-01-01

(2026-02) Two-Factor Authentication Can Harden Servers Against Offline Password Search 1970-01-01

(2026-02) Tripling on Hessian curves via isogeny decomposition 1970-01-01

(2026-02) Towards Practical Registered ABE; More Efficient, Non-monotone, and CCA-secure 1970-01-01

(2026-02) Towards Making Doubly-Efficient PIR Practical 1970-01-01

(2026-02) Towards Accountability for Anonymous Credentials 1970-01-01

(2026-02) Tight Reductions for SIS-with-Hints Assumptions with Applications to Anonymous Credentials 1970-01-01

(2026-02) Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption 1970-01-01

(2026-02) The Verification Theater; When Formal Methods Create False Assurance in Cryptographic Libraries 1970-01-01

(2026-02) The Structured Generic-Group Model 1970-01-01

(2026-02) The HyperFrog Cryptosystem; High-Genus Voxel Topology as a Trapdoor for Post-Quantum KEMs 1970-01-01

(2026-02) Syndrome Decoding with Hints 1970-01-01

(2026-02) Sumcheck-based zkSNARKs are Non-Malleable 1970-01-01

(2026-02) Succinct Arguments for BatchQMA and Friends under 6 Rounds 1970-01-01

(2026-02) Structural Collapse of the Amutha-Perumal Scheme Based on Duo Circulant Matrices 1970-01-01

(2026-02) Statistically Secure Asynchronous MPC with Linear Communication and -mathcal{O}(n^5) Additive Overhead 1970-01-01

(2026-02) Spinel; A Post-Quantum Signature Scheme Based on -mathrm{SL}_n(-mathbb{F}_p) Hashing 1970-01-01

(2026-02) Special Soundness and Binding Properties; A Framework for Tightly Secure zk-SNARKs 1970-01-01

(2026-02) Solving SIS in any norm via Gaussian sampling 1970-01-01

(2026-02) SoK; Anonymous Credentials for Digital Identity Wallets 1970-01-01

(2026-02) Smoothing the degree of regularity for polynomial systems 1970-01-01

(2026-02) Sliced Rényi Pufferfish Privacy; Tractable Privatization Mechanism and Private Learning with Gradient Clipping 1970-01-01

(2026-02) Skipping Class; Algebraic Attacks exploiting weak matrices and operation modes of Poseidon2(b) 1970-01-01

(2026-02) Sharing a Secret Anamorphically; Secret Shares Dressed Up as Signatures 1970-01-01

(2026-02) Shared and leakage free MAYO 1970-01-01

(2026-02) Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable Assumptions 1970-01-01

(2026-02) Security of the Fischlin Transform in Quantum Random Oracle Model 1970-01-01

(2026-02) Scytale; A Compiler Framework for Accelerating TFHE with Circuit Bootstrapping 1970-01-01

(2026-02) Scaling Sparse Matrix Computation for Secure Outsourced Computing 1970-01-01

(2026-02) SQISign on ARM 1970-01-01

(2026-02) SPRINT; New Isogeny Proofs of Knowledge and Isogeny-Based Signatures 1970-01-01

(2026-02) SCA-MQDSA; Side-Channel Analysis of Multivariate Digital Signature Implementations 1970-01-01

(2026-02) Rule Variant Restrictions for the Tamarin Prover 1970-01-01

(2026-02) Round-Optimal Identity-Based Blind Signature from Module Lattice Assumptions 1970-01-01

(2026-02) Round-Optimal Byzantine Agreement without Trusted Setup 1970-01-01

(2026-02) Round-Based Approximation of (Higher-Order) Differential-Linear Correlation 1970-01-01

(2026-02) Relaxed Modular PCS from Arbitrary PCS and Applications to SNARKs for Integers 1970-01-01

(2026-02) Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves 1970-01-01

(2026-02) RISQrypt; Fast, Secure and Agile Hardware-Software Co-Design for Post-Quantum Cryptography 1970-01-01

(2026-02) Putting the OPTI in Round Optimal IA-MPC in the Plain Model 1970-01-01

(2026-02) Proving Knowledge of Syndrome Decoding Problems with Soundness 1970-01-01

(2026-02) Post-Quantum Security of Block Cipher Constructions 1970-01-01

(2026-02) Post-Quantum Adaptor Signatures with Strong Security from Cryptographic Group Actions 1970-01-01

(2026-02) Plonk Without Random Oracles 1970-01-01

(2026-02) PhantomCrypt; Second-Order Deniable Encryption with Post-Quantum Security 1970-01-01

(2026-02) Perfectly Secure Network-Agnostic MPC Comes for Free 1970-01-01

(2026-02) Partially Non-Interactive Two-Round Threshold and Multi-Signatures with Tighter and Adaptive Security 1970-01-01

(2026-02) Pairing-based Functional Commitments for Circuits with Shorter Parameters 1970-01-01

(2026-02) PaCMan - Partition-Code Masking for Combined Security 1970-01-01

(2026-02) PANCAKE; A SNARK with Plonkish Constraints, Almost-Free Additions, No Permutation Check, and a Linear-Time Prover 1970-01-01

(2026-02) PAC-Private Databases 1970-01-01

(2026-02) Orthus; Practical Sublinear Batch-Verification of Lattice Relations from Standard Assumptions 1970-01-01

(2026-02) Orbit; Optimizing Rescale and Bootstrap Placement with Integer Linear Programming Techniques for Secure Inference 1970-01-01

(2026-02) Optimizing Differential Privacy in Federated Analytics under Known Input Distributions 1970-01-01

(2026-02) Optimal Best-of-Both-Worlds Consensus 1970-01-01

(2026-02) OpenAC; Open Design for Transparent and Lightweight Anonymous Credentials 1970-01-01

(2026-02) One Pair to Rule Them All; An Optimal Algorithm for Solving Code Equivalence via Codeword Search 1970-01-01

(2026-02) On the conversion of module representations for higher dimensional supersingular isogenies 1970-01-01

(2026-02) On the Use of Atkin and Weber Modular Polynomials in Isogeny Proofs of Knowledge 1970-01-01

(2026-02) On the Need for (Quantum) Memory with Short Outputs 1970-01-01

(2026-02) On the Equivalence of Forgery and Key Recovery in Key-Then-Hash Functions 1970-01-01

(2026-02) On the Concrete Hardness of LWR with a Power of Two Modulus 1970-01-01

(2026-02) On the Concrete Hardness Gap Between MLWE and LWE 1970-01-01

(2026-02) On the Complexity of Succinct Interactive Arguments 1970-01-01

(2026-02) On the Binding Security of KEMs based on RSA and DH 1970-01-01

(2026-02) On the Active Security of the PEARL-SCALLOP Group Action 1970-01-01

(2026-02) On The Spectral Theory of Isogeny Graphs and Quantum Sampling of Hard Supersingular Elliptic Curves 1970-01-01

(2026-02) On Lifting AGM Security to AGM with Oblivious Sampling 1970-01-01

(2026-02) On Compressing Non-Additive Correlations 1970-01-01

(2026-02) On Best-Possible One-Time Programs 1970-01-01

(2026-02) Oblivious Ciphertext Compression via Linear Codes 1970-01-01

(2026-02) Non-interactive Blind Signatures with Threshold Issuance 1970-01-01

(2026-02) Non-Trivial Zero-Knowledge Implies One-Way Functions 1970-01-01

(2026-02) Non Interactive MPC, (Quantumly) Revisited 1970-01-01

(2026-02) New lower bound of the r-th order nonlinearity via algebraic immunity 1970-01-01

(2026-02) New Techniques for Information-Theoretic Asynchronous MPC with Abort 1970-01-01

(2026-02) NeuralCPA; A Deep Learning Perspective on Chosen-Plaintext Attacks 1970-01-01

(2026-02) Nested MuSig2 1970-01-01

(2026-02) Neo and SuperNeo; Post-quantum folding with pay-per-bit costs over small fields 1970-01-01

(2026-02) Necessary and Sufficient Conditions for the Existence of Ideal Linear Secret Sharing Schemes for Arbitrary Access Structures 1970-01-01

(2026-02) NIROPoK-Based Post-Quantum Sidechain Design on Ethereum 1970-01-01

(2026-02) Multipath PA-PUFs generate all Boolean functions 1970-01-01

(2026-02) Multi-key Security in the Quantum World; Revisiting Tweakable Even-Mansour and FX 1970-01-01

(2026-02) Multi-key Fully Homomorphic Encryption with Non-Interactive Setup in the Plain Model 1970-01-01

(2026-02) Multi-Committee MPC; From Unanimous to Identifiable Abort 1970-01-01

(2026-02) Migrating Bitcoin and Ethereum Addresses to the Quantum Blockchain Era 1970-01-01

(2026-02) Malicious Security Comes Free in SPDZ 1970-01-01

(2026-02) Malicious Private Set Union with Two-Sided Output 1970-01-01

(2026-02) MPSpeed; Implementing and Optimizing MPC-in-the-Head Digital Signatures in Hardware 1970-01-01

(2026-02) Logarithmic-Depth Pseudorandom Functions from Well-Founded Code-Based Assumptions 1970-01-01

(2026-02) Liquid Democracy With Two Opposing Factions 1970-01-01

(2026-02) Lightweight PQ KEM and Hybrid MQTT Protocol for 8-bit AVR Sensor Nodes 1970-01-01

(2026-02) Lightning, Field-Agnostic Super-Efficient Polynomial Commitment Scheme 1970-01-01

(2026-02) Lighthouse; Single-Server Secure Aggregation with O(1) Server-Committee Communication at Scale 1970-01-01

(2026-02) Lie algebras and the security of cryptosystems based on classical varieties in disguise 1970-01-01

(2026-02) LazyArc; Dynamic Out-of-Order Engine for High-Throughput FHE 1970-01-01

(2026-02) Lattice HD Wallets; Post-Quantum BIP32 Hierarchical Deterministic Wallets from Lattice Assumptions 1970-01-01

(2026-02) Knowledge Soundness of Polynomial Commitments in the Algebraic Group Model Does Not Guarantee Extractability 1970-01-01

(2026-02) Key Recovery Attacks on UOV Using p^l-truncated Polynomial Rings 1970-01-01

(2026-02) Key Committing Security of HCTR2, Revisited 1970-01-01

(2026-02) Janus-FHE; A Side Channel Resilient Framework for High-Degree Homomorphic Encryption on GPUs 1970-01-01

(2026-02) Issuer-Hiding for BBS Anonymous Credentials via Randomizable Keys 1970-01-01

(2026-02) Isochronous Fixed-Weight Sampling in Hardware 1970-01-01

(2026-02) Is it Really Broken The Failure of DL-SCA Scoring Metrics under Non-Uniform Priors 1970-01-01

(2026-02) Is PSI Really Faster Than PSU Achieving Efficient PSU with Invertible Bloom Filters 1970-01-01

(2026-02) Investigating the Wedge Map on SNOVA 1970-01-01

(2026-02) Information-Theoretic Network-Agnostic MPC with Polynomial Communication 1970-01-01

(2026-02) Improved preprocessing for the Crossbred algorithm and application to the MQ problem 1970-01-01

(2026-02) Improved Reduction from RLWE to MP-LWE 1970-01-01

(2026-02) Improved Cryptanalysis of HFERP 1970-01-01

(2026-02) Impossibility of CPAD security for a class of FHE schemes 1970-01-01

(2026-02) Implementable Witness Encryption from Arithmetic Affine Determinant Programs 1970-01-01

(2026-02) ITSAKE; an unconditionally secure authenticated key establishment protocol 1970-01-01

(2026-02) Hybridization of Cryptographic Primitives; A Generalized Framework for Adaptive Security 1970-01-01

(2026-02) How to Classically Verify a Quantum Cat without Killing It 1970-01-01

(2026-02) How to Build a Short-Input Random Oracle from Public Random Permutations 1970-01-01

(2026-02) How To Make Delegated Payments on Bitcoin; A Question for the AI Agentic Future 1970-01-01

(2026-02) How (not) to Switch FHE Schemes; Framework and Attacks in the IND-CPA-D Model 1970-01-01

(2026-02) Highly Efficient and Round-Optimal Asymmetric PAKE 1970-01-01

(2026-02) High-Precision Functional Bootstrapping for CKKS from Fourier Extension 1970-01-01

(2026-02) Have Your CKAKE and Eat it, Too; Efficient, Composable KEM-Authenticated Key Exchange 1970-01-01

(2026-02) HCTR^{++} ; A Beyond Birthday Bound Secure HCTR2 Variant 1970-01-01

(2026-02) Group Encryption with Oblivious Traceability 1970-01-01

(2026-02) GG-GSW; Chosen-Ciphertext Secure Leveled FHE From Gadget Trapdoors 1970-01-01

(2026-02) Fuzzy Private Set Intersection from Density-Bounded Assumptions 1970-01-01

(2026-02) From OT to OLE with Almost-Linear Communication 1970-01-01

(2026-02) Forget-IT; Optimal Good-Case Latency For Information-Theoretic BFT 1970-01-01

(2026-02) Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform 1970-01-01

(2026-02) Fast cube roots in Fp2 via the algebraic torus 1970-01-01

(2026-02) FLiPD; Privacy-Preserving Federated Learning via Multi-Party Computation and Differential Privacy 1970-01-01

(2026-02) Exploiting SNOVA’s Structure in the Wedge Product Attack 1970-01-01

(2026-02) Exploiting PDF Obfuscation in LLMs, arXiv, and More 1970-01-01

(2026-02) Endomorphisms via splittings 1970-01-01

(2026-02) Eidolon; A Practical Post-Quantum Signature Scheme Based on k-Colorability in the Age of Graph Neural Networks 1970-01-01

(2026-02) Efficient, UC-secure and Publicly Auditable MPC from OLE & VOLE-in-the-head 1970-01-01

(2026-02) Efficient Polynomial Evaluation on Structured Space over Finite Fields 1970-01-01

(2026-02) Efficient Pairing-Based Batch Arguments for NP with a Constant-Size Proof 1970-01-01

(2026-02) ECHO; Efficient Covertly-Secure Three-party Computation with Applications to Private Machine Learning 1970-01-01

(2026-02) Dual-Syncopation Meet-in-the-Middle Attacks; New Results on SHA-2 and MD5 1970-01-01

(2026-02) Do not Mix Models; Revisiting Generic Transforms for Committing Authenticated Encryption 1970-01-01

(2026-02) Do Androids Dream of a Dead Internet; Interactive Watermarks for Bot Detection 1970-01-01

(2026-02) Distributed Monotone-Policy Encryption with Silent Setup from Lattices 1970-01-01

(2026-02) Distributed Monotone-Policy Encryption for DNFs from Lattices 1970-01-01

(2026-02) Dishonest-Majority Secure Computation via PIR-Authenticated Multiplication Triples 1970-01-01

(2026-02) Differential-Linear Attacks from New Distinguishers; the case of SERPENT and PRESENT 1970-01-01

(2026-02) Determining those Boolean functions whose restrictions to affine spaces are plateaued 1970-01-01

(2026-02) Defining Quantum-Secure Message Authentication 1970-01-01

(2026-02) Cyclo; Lightweight Lattice-based Folding via Partial Range Checks 1970-01-01

(2026-02) Cube and Integral Attacks on ChiLow-32 1970-01-01

(2026-02) Cryptokinetics 1970-01-01

(2026-02) Cryptanalysis of Poseidon-Based Fiat-Shamir Protocols 1970-01-01

(2026-02) Crossing with Confidence; Formal Analysis and Model Checking of Blockchain Bridges 1970-01-01

(2026-02) Conditionally Linkable Attribute-Based Signatures 1970-01-01

(2026-02) Composition Theorems for Zero-Knowledge IOPs 1970-01-01

(2026-02) Compact and Statistical NIZK Proofs of Knowledge for Disjunctions from -Sigma-Protocols 1970-01-01

(2026-02) Collaborative Incrementally Verifiable Computation 1970-01-01

(2026-02) Cavern; Efficient Honest-Majority Maliciously Secure (2+1)-PC for -mathbb{Z}_{2^n} via DPF 1970-01-01

(2026-02) Cavefish; Communication-Optimal Light Client Protocol for UTxO Ledgers 1970-01-01

(2026-02) Catalytic Tree Evaluation From Matching Vectors 1970-01-01

(2026-02) Careful with the Ring; Enhanced Hybrid Decoding Attacks against Module-Ring-LWE 1970-01-01

(2026-02) Bridging Privacy and Utility; A Verifiable Framework for Data Valuation via Zero-Knowledge Proofs 1970-01-01

(2026-02) Breaking digital signatures from tropical matrix semirings 1970-01-01

(2026-02) Bolt; Faster SNARKs from Sketched Codes 1970-01-01

(2026-02) Bittersweet Signatures; Bringing LWR to a Picnic for Hardware-Friendly MPC-in-the-Head 1970-01-01

(2026-02) Bitcoin PIPEs v2 1970-01-01

(2026-02) Beyond the Linear Barrier; Secret Sharing for Evolving (Weighted) Threshold Access Structures with Poly-logarithmic Share Size 1970-01-01

(2026-02) At-Compromise Security; The Case for Alert Blindness 1970-01-01

(2026-02) Anonymity of X-Wing and its Variants 1970-01-01

(2026-02) Anamorphic E-Voting; Coercion-Resistant Through Fake and Real Votes 1970-01-01

(2026-02) Analysis and Vulnerabilities in zkLogin 1970-01-01

(2026-02) Additions, Multiplications, and the Interaction In-Between; Optimizing MPC Protocols via Leveled Linear Secret Sharing 1970-01-01

(2026-02) Adams Bridge Accelerator; Bridging the Post-Quantum Transition 1970-01-01

(2026-02) A note on adversary running times 1970-01-01

(2026-02) A Visit to KAZ Attack; Finding a Minor Flaw and a Simplified Lattice Construction 1970-01-01

(2026-02) A Unified Hardware Architecture for Stateful and Stateless Hash-Based Key-Signature Generations 1970-01-01

(2026-02) A Practical Neighborhood Search Attack on Oracle MLWE 1970-01-01

(2026-02) A Modular Approach to Succinct Arguments for QMA 1970-01-01

(2026-02) A Generalized Attack on RSA and Its Variants 1970-01-01

(2026-02) A Generalized -chi_n-Function 1970-01-01

(2026-02) A Cryptographic Framework for Proof of Personhood 1970-01-01

(2026-02) A Comprehensive Break of the Tropical Matrix-Based Signature Scheme 1970-01-01

(2026-02) -phi(n)-evaluation algorithm; a novel approach for an efficient retrieval of Euler's totient of an RSA Modulus 1970-01-01

(2026-02) -mathsf{TalonG}; Bandwidth-Efficient Two-Round Threshold Signatures from Lattices 1970-01-01

(2026-02) -mathsf{Spectra}; Interval-Agnostic Vector Range Argument for Unstructured Range Assertions 1970-01-01

(2026-02) -mathsf{SoK}; On Cryptography for Multi-Cloud Storage 1970-01-01

(2026-01) qFALL – Rapid Prototyping of Lattice-based Cryptography 1970-01-01

(2026-01) Zero Knowledge (About) Encryption; A Comparative Security Analysis of Three Cloud-based Password Managers 1970-01-01

(2026-01) XM-VRF; Forward Secure, Fast and Key Updatable Hash Based Verifiable Random Function 1970-01-01

(2026-01) Verified non-recursive calculation of Beneš networks applied to Classic McEliece 1970-01-01

(2026-01) Uniform Sharing in Multiple Stages; NullFresh for Arbitrary Functions 1970-01-01

(2026-01) Tropical cryptography IV; Digital signatures and secret sharing with arbitrary access structure 1970-01-01

(2026-01) Timed Commitments and Timed Encryption; Generic Constructions and Instantiations from Isogenies 1970-01-01

(2026-01) The Cokernel Pairing 1970-01-01

(2026-01) The Billion Dollar Merkle Tree 1970-01-01

(2026-01) The Algebraic Isogeny Model; A General Model with Applications to SQIsign and Key Exchanges 1970-01-01

(2026-01) Tag-Friendly Lattice Sampler and Applications 1970-01-01

(2026-01) Structured Module Lattice-based Cryptography 1970-01-01

(2026-01) StarFortress; Hybrid Post-Quantum KEMs From SDH and IND-CCA 1970-01-01

(2026-01) SoK; Outsourced Private Set Intersection 1970-01-01

(2026-01) Secure Computation for Fixed-point and Floating-point Arithmetic 1970-01-01

(2026-01) Secret-Subspace Recovery in MAYO via Linearization of Errors from a Single Fault 1970-01-01

(2026-01) Scalable Distributed Key Generation for Blockchains 1970-01-01

(2026-01) SNARGs for NP and Non-Signaling PCPs, Revisited 1970-01-01

(2026-01) Round-Optimal Pairing-Free Blind Signatures 1970-01-01

(2026-01) Revisiting the Concrete Security of Falcon-type Signatures 1970-01-01

(2026-01) Re2creds; Reusable Anonymous Credentials from Malleable NIZK and Legacy Signatures 1970-01-01

(2026-01) Rank Syndrome Decoding Estimator - An Asymptotic and Concrete Analysis 1970-01-01

(2026-01) Rank Syndrome Decoding Estimator 1970-01-01

(2026-01) Qurrency; a quantum-secure, private, and auditable platform for digital assets 1970-01-01

(2026-01) Practical Subvector Commitments with Optimal Opening Complexity 1970-01-01

(2026-01) Practical SNARGs for Matrix Multiplications over Encrypted Data 1970-01-01

(2026-01) Policy-based Access Tokens; Privacy-Preserving Verification for Digital Identity 1970-01-01

(2026-01) Optimized Implementation of ML-KEM on ARMv9-A with SVE2 and SME 1970-01-01

(2026-01) On those Boolean functions having only one Walsh zero 1970-01-01

(2026-01) On the Impossibility of Round-Optimal Pairing-Free Blind Signatures in the ROM 1970-01-01

(2026-01) New Quantum Circuits for ECDLP; Breaking Prime Elliptic Curve Cryptography in Minutes 1970-01-01

(2026-01) Masked Solving of Linear Equations System and Application to UOV Signatures 1970-01-01

(2026-01) Low-Latency Low-Randomness OPINI Gadgets and Their Formal Verification 1970-01-01

(2026-01) Logarithmic density of rank -geq1 and -geq2 genus-2 Jacobians and applications to hyperelliptic curve cryptography 1970-01-01

(2026-01) Lether; Practical Post-Quantum Account-Based Private Blockchain Payments 1970-01-01

(2026-01) LatORAM; ORAMs from Lateral Stashes and Delayed Shuffling 1970-01-01

(2026-01) L for the Price of One; On the Benefits of Using more than t+1 Parties in Threshold Signing 1970-01-01

(2026-01) Jindo; Practical Lattice-Based Polynomial Commitment for Zero-Knowledge Arguments 1970-01-01

(2026-01) JAGUAR; Efficient and Secure Unbalanced PSI under Malicious Adversaries in the Client-Server Setting 1970-01-01

(2026-01) Integrity from Algebraic Manipulation Detection in Trusted-Repeater QKD Networks 1970-01-01

(2026-01) Incremental Single-Server Private Information Retrieval 1970-01-01

(2026-01) IND-CCA Lattice Threshold KEM under 30 KiB 1970-01-01

(2026-01) How to Steal Oblivious Transfer from Minicrypt 1970-01-01

(2026-01) Heli; Heavy-Light Private Aggregation 1970-01-01

(2026-01) Hardware-Friendly Robust Threshold ECDSA in an Asymmetric Model 1970-01-01

(2026-01) HYPERSHIELD; Protecting the Hypercube MPC-in-the-Head Framework Against Differential Probing Adversaries without Masking 1970-01-01

(2026-01) HIC is all you need; Practical Post-Quantum Password-Authenticated Public Key Encryption 1970-01-01

(2026-01) Generating Falcon Trapdoors via Gibbs Sampler 1970-01-01

(2026-01) Generalization of the Class Elimination Attack to Block Ciphers 1970-01-01

(2026-01) Functional Decomposition of Multivariate Polynomials; Revisit and New Improvements 1970-01-01

(2026-01) Fully Secure DKG Protocols for Discrete Logarithm Revisited 1970-01-01

(2026-01) Fully Dynamic Verifiable Secret Sharing and its Application to DPSS 1970-01-01

(2026-01) From -textsf{TS-SUF-2} to -textsf{TS-SUF-4}; Practical Security Enhancements for -textsf{FROST2} Threshold Signatures 1970-01-01

(2026-01) Formalizing Privacy in Decentralized Identity; A Provably Secure Framework with Minimal Disclosure 1970-01-01

(2026-01) Faster Than Ever; A New Lightweight Private Set Intersection and Its Variants 1970-01-01

(2026-01) Faster Short Pairing-Based NIZK Proofs for Ring LWE Ciphertexts 1970-01-01

(2026-01) Fast Unbalanced Private Computation on Set Intersection from Permuted Multi-Query Private Membership Test 1970-01-01

(2026-01) Extending RISC-V to Support Flexible-Radix Multiply-Accumulate Operations 1970-01-01

(2026-01) Equivalent computational problems for superspecial abelian surfaces 1970-01-01

(2026-01) Efficient Threshold ML-DSA 1970-01-01

(2026-01) Efficient Polynomial Evaluation over Structured Space and Application to Polynomial Method 1970-01-01

(2026-01) Deal out oblivious correlations; 2-depth HSS circuit for silent V-OLE generation 1970-01-01

(2026-01) Concretely Efficient Blind Signatures Based on VOLE-in-the-Head Proofs and the MAYO Trapdoor 1970-01-01

(2026-01) Complete Characterization of Randomness Extraction from DAG-Correlated Sources 1970-01-01

(2026-01) Chasing Rabbits Through Hypercubes; Better algorithms for higher dimensional 2-isogeny computations 1970-01-01

(2026-01) Breaking the Myth of MPCitH Inefficiency; Optimizing MQOM for Embedded Platforms 1970-01-01

(2026-01) Breaking the KAZ Suite; Practical Key Recovery Attacks on MySEAL 2.0’s Post-Quantum Candidates 1970-01-01

(2026-01) Blind Adaptor Signatures, Revisited; Stronger Security Definitions and Their Construction toward Practical Applications 1970-01-01

(2026-01) Benchmarking of the Amortized Post Quantum Combiner for MLS 1970-01-01

(2026-01) Batch Arguments with Optimal Communication 1970-01-01

(2026-01) BREAKMEIFYOUCAN!; Exploiting Keyspace Reduction and Relay Attacks in 3DES and AES-protected NFC Technologies 1970-01-01

(2026-01) BLISK; Boolean circuit Logic Integrated into the Single Key 1970-01-01

(2026-01) BABE; Verifying Proofs on Bitcoin Made 1000x Cheaper 1970-01-01

(2026-01) Augmenting BBS with Conventional Signatures 1970-01-01

(2026-01) Arithmetic autocorrelation of binary half--ell-sequences with connection integer p^{r}q^{s} 1970-01-01

(2026-01) Argo MAC; Garbling with Elliptic Curve MACs 1970-01-01

(2026-01) Analysis and Attacks on the Reputation System of Nym 1970-01-01

(2026-01) An improved random AKS-class primality proving algorithm 1970-01-01

(2026-01) Adaptive NIKE for Unbounded Parties 1970-01-01

(2026-01) Aborting Random Oracles; How to Build them, How to Use them 1970-01-01

(2026-01) Abelian surfaces in Hesse form and explicit isogeny formulas 1970-01-01

(2026-01) AKE Protocol Combining PQC and QKD 1970-01-01

(2026-01) A SNARK for (Non-)Subsequences with Text-Sub-Linear Proving Time 1970-01-01

(2026-01) A General Randomness Reuse Framework for First-Order Secure Masking and Applications on AES Design Using Randomness Solely for Input Encoding 1970-01-01

(2026-01) A Certified Framework for Deterministic Navigation in Higher-Genus p-Isogeny Graphs 1970-01-01

(2026-01) 2PC Memory-Manipulating Programs with Constant Overhead 1970-01-01

(2025-12) d-v-CLSAG; Extension for Concise Linkable Spontaneous Anonymous Group Signatures 1970-01-01

(2025-12) Verifiable Aggregate Receipts with Applications to User Engagement Auditing 1970-01-01

(2025-12) UFOs; An Ultra-fast Toolkit for Multiparty Computation of Small Elements 1970-01-01

(2025-12) Transparent and Post-Quantum Distributed SNARK with Linear Prover Time 1970-01-01

(2025-12) Succinct Garbled Circuits with Low-Depth Garbling Algorithms 1970-01-01

(2025-12) Streaming Function Secret Sharing and Its Applications 1970-01-01

(2025-12) SoK; Verifiable Federated Learning 1970-01-01

(2025-12) SoK; Approximate Agreement 1970-01-01

(2025-12) SUMSIG; Compact Code-Based Signatures from Sum-Check Protocols 1970-01-01

(2025-12) SNARGs for NP via Fiat--Shamir in the Plain Model 1970-01-01

(2025-12) Pseudorandom Correlation Functions for Garbled Circuits 1970-01-01

(2025-12) On the representation of self-orthogonal codes and applications to cryptography 1970-01-01

(2025-12) On Delegation of Verifiable Presentations from mdoc and BBS Credentials 1970-01-01

(2025-12) OOPS; One-time Oblivious Polynomial Signatures 1970-01-01

(2025-12) OHMG; One hot modular garbling 1970-01-01

(2025-12) New Constructions of Multiplicative Secret Sharing Schemes 1970-01-01

(2025-12) Nested YOSO MPC; Near Optimal Resilience Without an MPC Setup 1970-01-01

(2025-12) Moving a Step of ChaCha in Syncopated Rhythm (Extended Version) 1970-01-01

(2025-12) ML-DSA-OSH; An Efficient, Open-Source Hardware Implementation of ML-DSA 1970-01-01

(2025-12) Leakage-Resilient Multi-Party Computation; Protecting the Evaluator in Circuits Garbling 1970-01-01

(2025-12) InstantOMR; Oblivious Message Retrieval with Low Latency and Optimal Parallelizability 1970-01-01

(2025-12) High-Performance SIMD Software for Spielman Codes in Zero-Knowledge Proofs 1970-01-01

(2025-12) HHGS; Forward-secure Dynamic Group Signatures from Symmetric Primitives 1970-01-01

(2025-12) Fully Distributed Multi-Point Functions for PCGs and Beyond 1970-01-01

(2025-12) FRIVail; A Data Availability Scheme based on FRI Binius 1970-01-01

(2025-12) Efficiently Provable Approximations for Non-Polynomial Functions 1970-01-01

(2025-12) DNS-Anchored zk-SNARK Proofs; A Stateless Alternative to ACME Challenge-Response for Domain Control Validation 1970-01-01

(2025-12) Conditionally Input-Revealing 2PC and Fuzzy Password-Authenticated Key Exchange 1970-01-01

(2025-12) Analysis of Diffusion Properties in Generalized Feistel Ciphers under Multidimensional Linear Cryptanalysis 1970-01-01

(2025-12) An Ideal Linear Secret Sharing Scheme for Complete t-Partite k-Uniform Hypergraph Access Structures 1970-01-01

(2025-12) Accelerating FrodoKEM in Hardware 1970-01-01

(2025-12) A note on ''a fully dynamic multi-secret sharing scheme with redundant authorization'' 1970-01-01

(2025-12) A New Approach to Large Party Beaver-Style MPC with Small Computational Overhead 1970-01-01

(2025-11) Vega 1970-01-01

(2025-11) Time-Lock Encrypted Storage for Blockchains 1970-01-01

(2025-11) QUIC-MLS 1970-01-01

(2025-11) On Reed–Solomon Proximity Gaps Conjectures 1970-01-01

(2025-11) On Proximity Gaps for Reed–Solomon Codes 1970-01-01

(2025-11) Compact, Efficient and Non-Separable Hybrid Signatures 1970-01-01

(2025-11) All Polynomial Generators Preserve Distance with Mutual Correlated Agreement 1970-01-01

(2025-08) zip 1970-01-01

(2025-08) When Can We Incrementally Prove Computations of Arbitrary Depth? 1970-01-01

(2025-08) VOLE-in-the-Head Signatures Based on the Linear Code Equivalence Problem 1970-01-01

(2025-08) Two-Tier Black-box Blockchains and Application to Instant Layer-1 Payments 1970-01-01

(2025-08) Towards Building Efficient SCALES Protocols 1970-01-01

(2025-08) The Best of Both KEMs 1970-01-01

(2025-08) Stateless 2PC Signatures for Internet-Scale Authentication and Authorization 1970-01-01

(2025-08) Starfighters — on the general applicability of X-Wing 1970-01-01

(2025-08) Snake Mackerel 1970-01-01

(2025-08) Scalable Secure Multiparty Computation with Perfect Security from Preprocessing 1970-01-01

(2025-08) Practical Collision Attacks on Reduced-Round Xoodyak Hash Mode 1970-01-01

(2025-08) Polynomial Lattices for the BIKE Cryptosystem 1970-01-01

(2025-08) Peeking Into the Future 1970-01-01

(2025-08) Password-Hardened Encryption Revisited 1970-01-01

(2025-08) Optimistic Message Dissemination 1970-01-01

(2025-08) Note 1970-01-01

(2025-08) Not Easy to Prepare a Pesto 1970-01-01

(2025-08) Naor-Reingold goes Beyond-the-Birthday-Bound 1970-01-01

(2025-08) LESS is Even More 1970-01-01

(2025-08) Fully-Fluctuating Participation in Sleepy Consensus 1970-01-01

(2025-08) Fully-Adaptive Two-Round Threshold Schnorr Signatures from DDH 1970-01-01

(2025-08) Data Availability Sampling with Repair 1970-01-01

(2025-08) DOC★ 1970-01-01

(2025-08) Cross-Consensus Reliable Broadcast and its Applications 1970-01-01

(2025-08) Coral 1970-01-01

(2025-08) Can we Speed up Information Set Decoding by Using Extension Field Structure? 1970-01-01

(2025-08) Automated Verification of Proofs in the Universal Composability Framework with Markov Decision Processes 1970-01-01

(2025-08) Adaptively Secure Threshold ElGamal Decryption from DDH 1970-01-01

(2025-08) AGB 2.0 1970-01-01

(2025-08) ABEL 1970-01-01

(2025-08) A Note on the Post-Quantum Security of the Inverse Discrete Logarithm Problem 1970-01-01

(2025-08) A Note on the Post-Quantum Security of Identity-Based Encryption on Isogenous Pairing Groups 1970-01-01

(2025-08) A Note on the Binding Properties of KEM Combiners 1970-01-01

(2025-08) A New Paradigm for Privacy-Preserving Decision Tree Evaluation 1970-01-01

(2025-08) A Fully-Adaptive Threshold Partially-Oblivious PRF 1970-01-01

(2025-07) What’s the Matter? An In-Depth Security Analysis of the Matter Protocol 1970-01-01

(2025-07) Tree PCPs 1970-01-01

(2025-07) Sota Voce 1970-01-01

(2025-07) SLVer Bullet 1970-01-01

(2025-07) Post-Quantum Readiness in EdDSA Chains 1970-01-01

(2025-07) PlasmaFold 1970-01-01

(2025-07) Opossum Attack 1970-01-01

(2025-07) On Weak NIZKs, One-way Functions and Amplification 1970-01-01

(2025-07) Note 1970-01-01

(2025-07) Multi-Source Randomness Extraction and Generation in the Random-Oracle Model 1970-01-01

(2025-07) Linear Prover IOPs in Log Star Rounds 1970-01-01

(2025-07) How to Tolerate Typos in Strong Asymmetric PAKE 1970-01-01

(2025-07) Gödel in Cryptography 1970-01-01

(2025-07) Fast Final Exponentiation on BW and BLS Curves with Even Embedding Degrees at 128 bits security 1970-01-01

(2025-07) FRIttata 1970-01-01

(2025-07) Efficiently parsing existing eID documents for zero-knowledge proofs 1970-01-01

(2025-07) Collaborative zkSNARKs with Sublinear Prover Time and Constant Proof Size 1970-01-01

(2025-07) Batch Decryption without Epochs and its Application to Encrypted Mempools 1970-01-01

(2025-07) A note on the security of the BitVM3 garbling scheme 1970-01-01

(2025-06) Understanding Lasso 1970-01-01

(2025-06) Threshold Signatures Reloaded 1970-01-01

(2025-06) Speeding Up Sum-Check Proving 1970-01-01

(2025-06) SmallWood 1970-01-01

(2025-06) Simple VESS 1970-01-01

(2025-06) OnionPIRv2 1970-01-01

(2025-06) New Upper and Lower Bounds for Perfectly Secure MPC 1970-01-01

(2025-06) Guarding the Signal 1970-01-01

(2025-06) Generic Construction of Threshold Ring Signatures and Lattice-based Instantiations 1970-01-01

(2025-06) Evaluation of Modular Polynomials from Supersingular Elliptic Curves 1970-01-01

(2025-06) Efficient, Scalable Threshold ML-DSA Signatures 1970-01-01

(2025-06) Cryptanalysis of HiAE 1970-01-01

(2025-06) Brief Comments on Rijndael-256 and the Standard RISC-V Cryptography Extensions 1970-01-01

(2025-06) Bridging Bitcoin to Second Layers via BitVM2 1970-01-01

(2025-06) Beyond LWE 1970-01-01

(2025-06) A search to distinguish reduction for the isomorphism problem on direct sum lattices 1970-01-01

(2025-06) A Tale of Two Worlds, a Formal Story of WireGuard Hybridization 1970-01-01

(2025-05) Groebner Basis Cryptanalysis of Anemoi 1970-01-01

(2025-05) Diving Deep Into UC 1970-01-01

(2025-05) A Plausible Attack on the Adaptive Security of Threshold Schnorr Signatures 1970-01-01

(2025-03) Improved Cryptanalysis of ChaCha 1970-01-01

(2025-03) Analyzing Group Chat Encryption in MLS, Session, Signal, and Matrix 1970-01-01

(2025-03) A Fiat–Shamir Transformation From Duplex Sponges 1970-01-01

(2024-12) BitGC 1970-01-01

(2024-11) Impossibility Results for Post-Compromise Security in Real-World Communication Systems 1970-01-01

(2024-10) Blaze 1970-01-01

(2024-09) Schnorr Signatures are Tightly Secure in the ROM under a Non-interactive Assumption 1970-01-01

(2024-08) Garuda and Pari; Faster and Smaller SNARKs via Equifficient Polynomial Commitments 1970-01-01

(2024-07) TaSSLE 1970-01-01

(2024-07) A reduction from Hawk to the principal ideal problem in a quaternion algebra 1970-01-01

(2024-03) The 2Hash OPRF Framework and Efficient Post-Quantum Instantiations 1970-01-01

(2023-08) Verifiable Verification in Cryptographic Protocols 1970-01-01

(2023-04) Adding more parallelism to the AEGIS authenticated encryption algorithms 1970-01-01

(2023-03) Simplex Consensus 1970-01-01

(2022-03) Block-Cipher-Based Tree Hashing 1970-01-01

(2017-05) Multi-Collision Resistance 1970-01-01

(2017-01) The STROBE protocol framework 1970-01-01

(2017-01) Farfalle 1970-01-01

(2016-08) KangarooTwelve 1970-01-01