Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)

DOI10.1007/978-3-031-15985-5_12zbMath1517.94060OpenAlexW4313137076MaRDI QIDQ6166955

Lennart Braun, Alexander Munch-Hansen, Peter Scholl, Carsten Baum

Publication date: 7 July 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15985-5_12

zbMATH Keywords

large circuitsinteractive zero-knowledge proof system

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Related Items (5)

Actively secure half-gates with minimum overhead under duplex networks ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head

Cites Work

• Unnamed Item
• Unnamed Item
• Secure arithmetic computation with constant computational overhead
• Extending oblivious transfer with low communication via key-homomorphic PRFs
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Scalable zero knowledge with no trusted setup
• Constrained Pseudorandom Functions and Their Applications
• New Algorithms for Learning in Presence of Errors
• Functional Signatures and Pseudorandom Functions

This page was built for publication: Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)