Old Web
English
Sign In
Acemap
>
Paper
>
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and $\mathbb{Z}_{2^k}$
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and $\mathbb{Z}_{2^k}$
2021
Carsten Baum
Lennart Braun
Alexander Munch-Hansen
Peter Scholl
Keywords:
Mathematics
mixed mode
Discrete mathematics
Zero-knowledge proof
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]