惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

S
Security @ Cisco Blogs
雷峰网
雷峰网
T
Threat Research - Cisco Blogs
D
Docker
The Hacker News
The Hacker News
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Project Zero
Project Zero
C
Cyber Attacks, Cyber Crime and Cyber Security
Simon Willison's Weblog
Simon Willison's Weblog
The GitHub Blog
The GitHub Blog
Spread Privacy
Spread Privacy
Microsoft Security Blog
Microsoft Security Blog
Y
Y Combinator Blog
AWS News Blog
AWS News Blog
C
CXSECURITY Database RSS Feed - CXSecurity.com
U
Unit 42
Martin Fowler
Martin Fowler
T
Threatpost
S
Schneier on Security
Know Your Adversary
Know Your Adversary
V
Vulnerabilities – Threatpost
AI
AI
T
Tenable Blog
K
Kaspersky official blog
博客园 - 叶小钗
V
V2EX
C
CERT Recently Published Vulnerability Notes
博客园 - 聂微东
K
KPMG report finds enterprise disconnect between AI and its ROI | CIO
A
Arctic Wolf
H
Heimdal Security Blog
www.infosecurity-magazine.com
www.infosecurity-magazine.com
Google DeepMind News
Google DeepMind News
T
Tor Project blog
J
Java Code Geeks
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
Vercel News
Vercel News
B
Blog
P
Proofpoint News Feed
爱范儿
爱范儿
WordPress大学
WordPress大学
I
InfoQ
小众软件
小众软件
月光博客
月光博客
MyScale Blog
MyScale Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Jina AI
Jina AI
Help Net Security
Help Net Security

Cryptology ePrint Archive

Asynchronous Lagrange-Based Threshold FHE with Smaller Modulus Overhead Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography Icy-DVRF: A Distributed Verifiable Random Function based on FROST signatures Frobenius-UOV: A Very Efficient Multivariate Public Key Signature Scheme Revisiting Linear Subspace Trails in Poseidon A New Multiscalar Multiplication Method Resistant to Timing Attacks Device Binding for Anonymous Credentials on Legacy Phones Beyond Quadratic: Unlocking Pseudorandomness with Quartic Character Multi-leveled and ISA/IEC 62443-aware Certificate Transparency to Protect the PKI Service Supply Chain of Operational Technology rBFT: a Revamped Two-Stage BFT from Delegated Committee Delving Deep into Security Guarantees against Integral Distinguishers with Applications to PRESENT, TWINE and LBLOCK On the Communication Complexity of Sleepy Consensus Operationalising Post‑Quantum TLS: Automated Configuration Profiling and Hybrid PQC Deployment in Financial Infrastructure Enhancing Blockchain Proof of Stake with Active Weighted Signatures: The ADAPT Framework Threshold FHE with Short Decryption Shares without a Semi-trusted Server Efficient Bootstrapping in Fully Homomorphic Encryption for Matrix Arithmetic YsPIR: HE-Based Single-Server Private Information Retrieval with Low Communication Cost and High Throughput Black-box validation of Falcon key generation under numerical instability Tight Lattice-Based Signatures without Trapdoors from Search LWE Formalizing Blockchain PQC Signature Transition: How to Outpace Quantum Adversaries Optimized G+G Signature Storing Less in-the-Head: An Area-Efficient Hardware Architecture for SDitH-v2 SoK: Private LLM Inference using Approximate Homomorphic Encryption BitVM3: Efficient Bitcoin Bridges via Garbled Circuits Private Function Evaluation with Linear Complexity Obscura: Privacy-Preserving Protocol for the Algorand Blockchain Using LSAG Ring Signatures Cryptanalysis of Definite and Indefinite Lattice Isomorphism Problems With Applications to HAWK and DEFI Formalizing and Strengthening the Security Proof of NTOR Verifiable Anomaly and Similarity Detection Using Matrix Profile in Private Time-series Privacy Coins Under Viewing Key Compromise Adaptively-Secure Flexible and Identity-Based Broadcast Encryption from Decomposed LWE MERIDIAN: A Toroid-Inspired Permutation Block Cipher for Constrained Environments Toward Practical Fair Data Exchange: Eliminating In-Circuit Public-Key Operations Fault Injection Attacks Against zkSTARKs Beyond Binary: crosscorrelation of Cubic, Quartic and Quintic Character Sequences A Post-Quantum Accountable Sanitizable Signature Scheme Based on Unbalanced Oil and Vinegar TieredOMap: Skewness-Aware Oblivious Map Non-Adaptive Programmable PRFs and Applications to Stacked Garbling Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoin Efficient Bootstrapping of Matrices in FHE Formal Verification, Integration and Physical Evaluation of Prime-Field Masking on Silicon New Techniques for Communication-Efficient Secure Comparison Protocols Verifying Provenance of Digital Media: Security Analysis of C2PA and its Implementation EQuADiSE: Efficient Quantum-safe Adaptive Distributed Symmetric-key Encryption Panther: Robust Hybrid KEM Combiners via Structural Splicing Cobra: All-in-one for full-fledged defense — a hybrid nested KEM SCOUT-CT: Sound Constant-Time Outcome with Uncertainty Tracking using multi-taint analysis Cryptanalysis of the Sharafi–Daghigh digital signature scheme Improved Garbled RAM via Garbled Merge A Simple Batched Threshold Encryption Scheme GlitchSnipe: Toward Localized Voltage Fault Attacks MCU: An Efficient and Scalable Nonlinear Function Evaluation in MPC without Preprocessing Divide-and-Pair: Faster subgroup membership testing for elliptic curves Related-Key Multi-Pair Neural Distinguishers: Analysis and Applications to Lightweight Block Ciphers MDSS-STAR: Private Heavy-Hitters through Multi-Dealer Secret Sharing How to Authenticate a Non-Deterministic Computation Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators Open Problems in List Decoding and Correlated Agreement An Efficient Identity-Based Blind Signature Scheme from SM9 Tighter Bounds for the Oblivious Bit-Fixing Inner Product Extractor on Biased Seeds Counting and recovering the quadratic relations of a vectorial function Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty RoKoko: Lattice-based Succinct Arguments, a Committed Refinement Aggregator-Based Voting using proof of Partition HARE: Compact HQC via Distance-Informed Erasure Decoding A Maliciously-Secure Post-Quantum OPRF from Crypto Dark Matter Byzantine Consensus in the Partially Authenticated Setting Post-Quantum Anonymous Signatures from the Lattice Isomorphism Group Action Issuer-Hiding for BBS Anonymous Credentials via Randomizable Keys Relaxed Modular PCS from Arbitrary PCS and Applications to SNARKs for Integers Cross-Algorithm Deep Learning-based Non-Profiled Side-Channel Attacks Exploiting Symmetric Leakage Key Recovery Attacks on UOV Using $p^\ell$-truncated Polynomial Rings Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves PhantomCrypt: Second-Order Deniable Encryption with Post-Quantum Security When Trying to Catch Cheaters Breaks the MPC: Breaking and Fixing Delayed Consistency Checks in Trident, Fantastic Four, SWIFT, and Quad (Full Version) On the Use of Atkin and Weber Modular Polynomials in Isogeny Proofs of Knowledge Private IP Address Inference in NAT Networks via Off-Path TCP Control-Plane Attack Minimizing Mempool Dependency in PoW Mining on Blockchain: A Paradigm Shift with Compressed Block Representation for Enhanced Scalability, Decentralization and Security. Beyond-Birthday-Bound Security with HCTR2: Cascaded Construction and Tweak-based Key Derivation From Matrix to Polynomial NTRU FHE: Enabling Amortized Bootstrapping via Sparse Keys Adaptive NIKE for Unbounded Parties Hyperion: Private Token Sampling with Homomorphic Encryption TSS-PV: Traceable Secret Sharing with Public Verifiability A Graph-Theoretic Framework for Randomness Optimization in First-Order Masked Circuits Auntie: Unobservable Contracts from Zerocash and Trusted Execution Environments Fast Batch Matrix Multiplication in Ciphertexts Introducing GRAFHEN: GRoup-bAsed Fully Homomorphic Encryption without Noise Coppercloud: Blind Server-Supported RSA Signatures Threshold Public-Key Encryption: Definitions, Relations, and CPA-to-CCA Transforms On the $\gamma$-Spreadness of Average-Case to Worst-Case Transformations On the Regularity of the Generalized Birthday Problem The Pipes Model for Latency and Throughput Analysis Permutation-Based Hash from Non-Idealized Assumptions: Adding Feed-Forward to Sponge Secret-Key PIR from Random Linear Codes K-Linkable Ring Signatures and Applications in Generalized Voting Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC) ProxCode: Efficient Proximity Searchable Encryption from Error Correcting Codes DLFA: Deep Learning based Fault Analysis against Block Ciphers
Better Usability: Leakage-Resistant AEADs from Single-length Blockciphers
Chun Guo, Shandong University · 2026-04-28 · via Cryptology ePrint Archive

Paper 2026/824

Better Usability: Leakage-Resistant AEADs from Single-length Blockciphers

Mustafa Khairallah, Nanyang Technological University, Umeå University

Kazuhiko Minematsu, NEC (Japan)

Abstract

Existing leakage-resistant AEADs are rarely compatible with {\it single-length key} blockciphers (BCs), i.e., blockciphers with key-length equaling block-length. We present UEDTDM and UEDTMX, two single-length key BC-based leakage-resistant AEAD constructions. Both of them are one-pass with rate $1/4$, use ``partially fixed-key'' BC to maximize {\it practical} efficiency, and gather the strongest level of Grade-3 leakage-resistance (a terminology due to Bellizia et al., CRYPTO 2020) with a satisfactory black-box security bound. Their concrete security bounds are comparable with state-of-the-art construction TEDT of Berti et al. (TCHES 2020). Assuming that the underlying MJH hash has $(n-2\log_2n)$-bit collision security, they achieve $(n-2\log_2n)$-bit CIML2 and black-box CCA security, and approximately $n/2$-bit CCAmL2 security. Even more, they achieve birthday-bound context-committing security. To prove these claims, we introduce a framework UEDT that generalizes and expands the usability of the EDT construction of Berti et al. (ToSC 2017), prove unified provable security results, and then derive concrete bounds for the two instances, UEDTDM and UEDTMX. This framework may be of independent interest. We also demonstrate the performance advantage of our algorithms, especially in software. On x86 architectures where the AES-NI instructions are supported, our algorithms are twice faster than the closest competitor; LR-BC-3 (Bronchain et al., TCHES 2021). In addition, the ability to use the efficient MJH hash function and to reduce the amount of rekeying makes the algorithms faster across multiple platforms, as well.

Note: The full version of the paper, including CCAmL2 related definitions and formal proofs.

BibTeX

@misc{cryptoeprint:2026/824,
      author = {Chun Guo and Mustafa Khairallah and Kazuhiko Minematsu},
      title = {Better Usability: Leakage-Resistant {AEADs} from Single-length Blockciphers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/824},
      year = {2026},
      url = {https://eprint.iacr.org/2026/824}
}