Efficient proof composition for verifiable computation

DOI10.1007/978-3-319-99073-6_8zbMath1496.68067OpenAlexW2886845474MaRDI QIDQ2167734

Refik Molva, Hervé Chabanne, Julien Keuffer

Publication date: 25 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-99073-6_8

zbMATH Keywords

neural networksverifiable computationproof composition

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Computer security (68M25)

Related Items (1)

Enhancing privacy preservation and trustworthiness for decentralized federated learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security arguments for digital signatures and blind signatures
• Practical verified computation with streaming interactive proofs
• Time-Optimal Interactive Proofs for Circuit Evaluation
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Collision-Free Hashing from Lattice Problems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Algebraic methods for interactive proof systems
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: Efficient proof composition for verifiable computation