Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost

DOI10.1007/978-3-662-48000-7_8zbMath1351.94052OpenAlexW2139594012MaRDI QIDQ3457064

Mike Rosulek, Payman Mohassel, Zhangxiang Hu

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)

Related Items (6)

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ PrORAM ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Succinct arguments for RAM programs via projection codes ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Constant-round maliciously secure two-party computation in the RAM model

Cites Work

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

This page was built for publication: Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost