Cryptology ePrint Archive: Report 2021/750

Available versions in chronological order


Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and $\mathbb{Z}_{2^k}$
Carsten Baum and Lennart Braun and Alexander Munch-Hansen and Peter Scholl

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and $\mathbb{Z}_{2^k}$
Carsten Baum and Lennart Braun and Alexander Munch-Hansen and Peter Scholl


[ Cryptology ePrint archive ]