慣性聚合 高效追讀感興趣之博客、新聞、科技資訊
閱原文 以慣性聚合開啟

推薦訂閱源

博客园 - 司徒正美
V
V2EX
T
Tailwind CSS Blog
有赞技术团队
有赞技术团队
aimingoo的专栏
aimingoo的专栏
Apple Machine Learning Research
Apple Machine Learning Research
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
A
About on SuperTechFans
月光博客
月光博客
T
The Blog of Author Tim Ferriss
宝玉的分享
宝玉的分享
Martin Fowler
Martin Fowler
博客园 - 聂微东
The GitHub Blog
The GitHub Blog
V
Visual Studio Blog
WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
Engineering at Meta
Engineering at Meta
GbyAI
GbyAI

Cryptology ePrint Archive

Dynamic Group Time-based One-time Passwords MBU: Scalable and Constant-Round Evaluation of Non-linear Functions in Standard MPC Setting CEDAR: A Compact and Efficient Decoder Architecture for RS-RM Code in HQC LEAH: Lightweight and Efficient Hardware Accelerator for Code-based PQC Scheme HQC The Sum-Check Protocol over the Monomial Basis, and Other Optimizations How to Authenticate a Non-Deterministic Computation Fully Adaptive Threshold Blind Signature Without AGM Additive FFTs for HQC on ARM Cortex-M4, Revisited SPoCK: Sequential Proofs of Complete Knowledge Blind Verifiable Delay Functions Compact Fully Asynchronous Updatable Public Key Encryption Scheme from Hamming Quasi-Cyclic Cryptosystem CLAASP-MP: An Automated MILP Framework for Monomial Prediction Assessing Geometric Security of AES Neural Realizations: Linear-Time Key Recovery via Neural Leakage Explicit Bounds on the Existence Probability of Random Multivariate Quadratic Systems over Finite Fields Faster Logical Operations from Discrete CKKS SecDTD: Dynamic Token Drop for Secure Transformers Inference Towards Zero Rotation and Beyond: Architecting Neural Networks for Fast Secure Inference with Homomorphic Encryption Code-based Scalable Collaborative SNARKs MAGNET: MAsked Gaussian Now Efficient and Table-less Automated formal analysis of Signal’s Double Ratchet: attacks, fixes and security proofs Bitsliced Segment-Based Search Technique for Low-Depth and Hardware-Efficient S-Box Circuits The Cost of Fluidity: Communication Complexity Trade-offs in Fluid MPC Decomposition of Large Look-Up Tables for Fast Homomorphic Evaluation Hint-Free Multi-Signatures (Mis)using the Lattice Isomorphism Problem. Cryptanalysis of the double-LIP and Construction of LIP-Based Blind Signatures Improving LatticeFold+ with ℓ2-norm Checks ABRA-CAPA-DABRA: Full break of CAPA Polynomial-Time Cryptanalytic Extraction of Graph Neural Networks in the Hard-Label Setting Zero-Knowledge Proof of Progress: Secure Multi-Phase Capture-the-Flag Competitions Scalable Registration-Based Encryption from Lattices ISE-supported erasure of residual shares Chorus: Secret Recovery with Ephemeral Client Committees $\mathsf{Veloz}$: Efficient and Flexible Distribution Framework for Code-Based Polynomial Commitment Scheme How to construct even faster and indifferentiable hash functions from random permutations Public Key Encryption from High-Corruption Constraint Satisfaction Problems Drop-In Masked Modular Reduction for ML-DSA: Cutting Side-Channel Cost in the Root-of-Trust Optimizing and Implementing Threshold MAYO Improved Cryptanalysis of the Permuted Kernel Problem with Applications to PERK v2.2.0, SUSHSYFISH and PKP-DSS Cross-Paradigm Models of Restricted Syndrome Decoding with Application to CROSS Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies
向构建无记忆统一框架于TCitH之途
Jesús-Javier · 2026-05-22 · via Cryptology ePrint Archive

文 2026/1029

向 TCitH 统一无内存框架之探

Décio Luiz Gazzoni Filho,技术创新研究所,电气工程系,伦敦大学隆德里纳分校

Marco Palumbi,技术创新研究所

Luis Rivera-Zamarripa科技创新研究院

摘要

今之 NIST 竞赛,增量子后数字签名方案,有二变:TCitH 与 VOLEitH。VOLEitH 签名短,栈内存多,故不甚宜于制限之器。吾辈今示,TCitH 之方案,可行于嵌入式系统,如 Cortex-M4 之器。吾辈呈一简明统合之零知识证明(ZKP)框架,涵括 NIST 竞赛 TCitH 之所有提交。吾辈之实现,较基线,栈使用减至九十九分之九,代码尺寸之增微,性能之增亦微。此框架为可延展:增新方案,惟须实其下问题之数学,及多项式证明之程序。吾辈复献一 Rijndael-256 之新常时、位切片实现,针对嵌入式架构,主 GGM 树扩展、PRG、承诺函数,此皆 TCitH 方案之枢要。此乃独立贡献,其意更广,盖 NIST 正标准化 Rijndael-256,且其用及于 MPCitH 之方案。吾辈信,此框架与实现,可助新之开发者与密码学者,于提案新 TCitH 方案时。

《圣经引文格式》

@misc{cryptoeprint:2026/1029,
      author = {Jesús-Javier Chi-Domínguez and Décio Luiz Gazzoni Filho and Marco Palumbi and Luis Rivera-Zamarripa},
      title = {Towards a Unified Memory-Less Framework for {TCitH}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1029},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1029}
}