Tag - #paper

(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) ZKBoost; Zero-Knowledge Verifiable Training for XGBoost 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 HyperFrog Cryptosystem; High-Genus Voxel Topology as a Trapdoor for Post-Quantum KEMs 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) Solving SIS in any norm via Gaussian sampling 1970-01-01

(2026-02) Shared and leakage free MAYO 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) Post-Quantum Security of Block Cipher Constructions 1970-01-01

(2026-02) Plonk Without Random Oracles 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) 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) On the Use of Atkin and Weber Modular Polynomials in Isogeny Proofs of Knowledge 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) New lower bound of the r-th order nonlinearity via algebraic immunity 1970-01-01

(2026-02) Nested MuSig2 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) Isochronous Fixed-Weight Sampling in Hardware 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) How to Classically Verify a Quantum Cat without Killing It 1970-01-01

(2026-02) Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform 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 Polynomial Evaluation on Structured Space over Finite Fields 1970-01-01

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

(2026-02) Differential-Linear Attacks from New Distinguishers; the case of SERPENT and PRESENT 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) Bitcoin PIPEs v2 1970-01-01

(2026-02) Analysis and Vulnerabilities in zkLogin 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 Generalized Attack on RSA and Its Variants 1970-01-01

(2026-02) A Generalized -chi_n-Function 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{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-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