Efficient proof of RAM programs from any public-coin zero-knowledge system

DOI10.1007/978-3-031-14791-3_27OpenAlexW4294698909MaRDI QIDQ6134849

Titouan Tanguy, Cyprien Delpech De Saint Guilhem, Michiel Verbauwhede, Emmanuela Orsini

Publication date: 25 July 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_27

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Arya: nearly linear-time zero-knowledge proofs for correct program execution
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Aurora: transparent succinct arguments for R1CS
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
• The knowledge complexity of interactive proof-systems
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Sublinear Zero-Knowledge Arguments for RAM Programs
• On the Size of Pairing-Based Non-interactive Arguments
• PrORAM

This page was built for publication: Efficient proof of RAM programs from any public-coin zero-knowledge system