On interactive oracle proofs for Boolean R1CS statements

DOI10.1007/978-3-031-18283-9_11zbMath1514.94057MaRDI QIDQ6045202

Ignacio Cascudo, Emanuele Giunta

Publication date: 26 May 2023

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

zbMATH Keywords

reverse multiplication friendly embeddingsincheck protocolsrowcheck protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Amortized complexity of information-theoretically secure MPC revisited
• Secure computation with constant communication overhead using multiplication embeddings
• Transparent SNARKs from DARK compilers
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Constant-overhead unconditionally secure multiparty computation over binary fields
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Aurora: transparent succinct arguments for R1CS
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• Interactive Oracle Proofs
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Additive Fast Fourier Transforms Over Finite Fields
• Constant-round interactive proofs for delegating computation
• Automata, Languages and Programming
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Improved single-round secure multiplication using regenerating codes

This page was built for publication: On interactive oracle proofs for Boolean R1CS statements