Delegating RAM Computations

DOI10.1007/978-3-662-53644-5_4zbMath1397.94074OpenAlexW2951221994MaRDI QIDQ3181023

Omer Paneth, Yael Kalai

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

3-Message Zero Knowledge Against Human Ignorance ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Parallelizable delegation from LWE ⋮ SNARGs for monotone policy batch NP ⋮ Verifiable private information retrieval ⋮ The hunting of the SNARK ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Round-optimal black-box commit-and-prove with succinct communication

Cites Work

• Checking the correctness of memories
• The hunting of the SNARK
• Fully Succinct Garbled RAM
• Secure Two-Party Computation with Low Communication
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
• Succinct Randomized Encodings and their Applications
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Non-Interactive Proofs of Proximity
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Adaptive Succinct Garbled RAM or: How to Delegate Your Database
• Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
• Arguments of Proximity
• Relations Among Complexity Measures
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Memory Delegation
• How to delegate computations
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• Interactive proofs of proximity

This page was built for publication: Delegating RAM Computations