TY - GEN
T1 - Shorter, Tighter, FAESTer
T2 - 45th International Cryptology Conference-CRYPTO-Annual
AU - Baum, Carsten
AU - Beullens, Ward
AU - de Saint Guilhem, Cyprien Delpech
AU - Klooss, Michael
AU - Majenz, Christian
AU - Mukherjee, Shibam
AU - Orsini, Emmanuela
AU - Ramacher, Sebastian
AU - Rechberger, Christian
AU - Roy, Lawrence
AU - Scholl, Peter
A2 - Braun, Lennart
A2 - Kalai, YT
A2 - Kamara, SF
PY - 2025
Y1 - 2025
N2 - In the past decade and largely in response to the NIST standardization effort for post-quantum cryptography, many new designs for digital signatures have been proposed. Among those, the FAEST digital signature scheme (Baum et al., CRYPTO 2023) stands out due to its interesting security-performance trade- off. It only relies on well-tested symmetric-key cryptographic primitives, as it constructs a digital signature from a zero-knowledge (ZK) proof of knowledge of an AES key. To achieve this, it uses the VOLE- in-the-Head ZK proof system which relies only on pseudorandom generator (PRG) and hash function calls. FAEST simultaneously has relatively small signature size and competitive sign and verify times.In this work, we improve both the security and practical efficiency of FAEST. We improve the main computational bottleneck of the original construction by replacing hash function calls in the underlying vector commitment scheme with calls to an AES-based PRG. At the same time, we also improve the signature size by revisiting the evaluation of the AES block cipher in ZK. We use observations from Galois Theory to compress the size of the witness (and thus signature), due to the algebraic nature of the AES S-Box. We implemented our new construction, and our benchmarks show that its sign and verify times reduce up to 50% over the state-of-the-art while achieving the same security and smaller signatures.Finally, we analyze our resulting signature scheme both in the Quantum Random Oracle Model (QROM) and its classical analogue. To achieve concretely good security bounds, we devise a new classical proof for FAEST based on Renyi divergence techniques. We construct a QROM analogue and present a new Fiat-Shamir transform which is applicable to VOLE-in-the-Head-based signature schemes.
AB - In the past decade and largely in response to the NIST standardization effort for post-quantum cryptography, many new designs for digital signatures have been proposed. Among those, the FAEST digital signature scheme (Baum et al., CRYPTO 2023) stands out due to its interesting security-performance trade- off. It only relies on well-tested symmetric-key cryptographic primitives, as it constructs a digital signature from a zero-knowledge (ZK) proof of knowledge of an AES key. To achieve this, it uses the VOLE- in-the-Head ZK proof system which relies only on pseudorandom generator (PRG) and hash function calls. FAEST simultaneously has relatively small signature size and competitive sign and verify times.In this work, we improve both the security and practical efficiency of FAEST. We improve the main computational bottleneck of the original construction by replacing hash function calls in the underlying vector commitment scheme with calls to an AES-based PRG. At the same time, we also improve the signature size by revisiting the evaluation of the AES block cipher in ZK. We use observations from Galois Theory to compress the size of the witness (and thus signature), due to the algebraic nature of the AES S-Box. We implemented our new construction, and our benchmarks show that its sign and verify times reduce up to 50% over the state-of-the-art while achieving the same security and smaller signatures.Finally, we analyze our resulting signature scheme both in the Quantum Random Oracle Model (QROM) and its classical analogue. To achieve concretely good security bounds, we devise a new classical proof for FAEST based on Renyi divergence techniques. We construct a QROM analogue and present a new Fiat-Shamir transform which is applicable to VOLE-in-the-Head-based signature schemes.
UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=ait_230127_woslite_expandedapikey&SrcAuth=WosAPI&KeyUT=WOS:001588007500005&DestLinkType=FullRecord&DestApp=WOS_CPL
U2 - 10.1007/978-3-032-01887-8_5
DO - 10.1007/978-3-032-01887-8_5
M3 - Conference Proceedings with Oral Presentation
SN - 978-3-032-01886-1
VL - 16005
T3 - Lecture Notes In Computer Science
SP - 124
EP - 156
BT - Advances In Cryptology-Crypto 2025
PB - Springer Nature
Y2 - 17 August 2025 through 21 August 2025
ER -