One-Hot Conversion: Towards Faster Table-Based A2B Conversion
Jan-Pieter D'Anvers
摘要
Arithmetic to Boolean masking (A2B) conversion is a crucial technique in the masking of lattice-based post-quantum cryptography. It is also a crucial part of building a masked comparison which is one of the hardest to mask building blocks for active secure lattice-based encryption. We first present a new method, called one-hot conversion, to efficiently convert from higher-order arithmetic masking to Boolean masking using a variant of the higher-order table-based conversion of Coron et al. Secondly, we specialize our method to perform arithmetic to 1-bit Boolean functions. Our one-hot function can be applied to masking lattice-based encryption building blocks such as masked comparison or to determine the most significant bit of an arithmetically masked variable. In our benchmarks, a speedup of 40 to 66 times is achieved over state-of-the-art tablebased A2B conversions, bringing table-based A2B conversions in the performance range of the Boolean circuit-based A2B conversions by only a slowdown of factor 1.2 to 2.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
- Strong Non-Interference and Type-Directed Higher-Order MaskingGilles Barthe, Sonia Belaïd, François Dupressoir, Pierre-Alain Fouque 等CCS 2016 · 被引用 302 次
- A Key-Recovery Timing Attack on Post-quantum Primitives Using the Fujisaki-Okamoto Transformation and Its Application on FrodoKEMQian Guo, Thomas Johansson, Alexander NilssonCRYPTO 2020 · 被引用 84 次
相关 Paper
- A Unified Framework for Succinct Garbling from Homomorphic Secret SharingYuval Ishai, Hanjun Li, Huijia LinCRYPTO 2025 · 被引用 11 次
- One Hot GarblingDavid Heath, Vladimir KolesnikovCCS 2021 · 被引用 20 次
- Measurement-based uncomputation of quantum circuits for modular arithmeticAlessandro Luongo, Antonio Michele Miti, Varun Narasimhachar, Adithya SireeshDAC 2025 · 被引用 3 次
- Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from LatticesYuval Ishai, Hang Su, David J. WuCCS 2021 · 被引用 3 次
- Efficient Arithmetic in Garbled CircuitsDavid HeathEUROCRYPT 2024 · 被引用 12 次
