Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost

DOI10.1007/978-3-662-48000-7_8MaRDI QIDQ3457064zbMATH OpenOpenAlexFDO

Authors Zhangxiang Hu, Payman Mohassel, Mike Rosulek

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48000-7_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Sublinear zero-knowledge arguments for RAM programs
• Zero-knowledge proofs from secure multiparty computation
• Non-interactive zero-knowledge proofs to multiple verifiers
• Zero knowledge with efficient provers
• The power of preprocessing in zero-knowledge proofs of knowledge

Cites work

• Efficient Non-interactive Proof Systems for Bilinear Groups
• Garbled RAM revisited
• How to garble RAM programs?
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
• Oblivious Transfer Is Symmetric
• Secure Arithmetic Computation with No Honest Majority
• Software protection and simulation on oblivious RAMs
• Space/time trade-offs in hash coding with allowable errors
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(9)

• Constant-round maliciously secure two-party computation in the RAM model
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Constant-round maliciously secure two-party computation in the RAM model
• Sublinear zero-knowledge arguments for RAM programs
• PrORAM
• Efficient proof of RAM programs from any public-coin zero-knowledge system
• Succinct arguments for RAM programs via projection codes
• Zero-knowledge RAM: doubly efficient and black-box

This page was built for publication: Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457064)