Delegating RAM Computations

DOI10.1007/978-3-662-53644-5_4MaRDI QIDQ3181023zbMATH OpenOpenAlexFDO

Authors Yael Kalai, Omer Paneth

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)

Recommendations

• Memory delegation
• Delegating RAM computations with adaptive soundness and privacy
• Exploiting locality in LT-RAM computations
• scientific article; zbMATH DE number 3874614
• scientific article; zbMATH DE number 177809
• scientific article; zbMATH DE number 176491
• scientific article; zbMATH DE number 512978
• scientific article; zbMATH DE number 4179292

Cites work

• Adaptive succinct garbled RAM or: how to delegate your database
• Arguments of proximity (extended abstract)
• Checking the correctness of memories
• Fully succinct garbled RAM
• How to delegate computations
• Interactive proofs of proximity: delegating computation in sublinear time
• Leveled fully homomorphic signatures from standard lattices
• Memory delegation
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Non-interactive proofs of proximity
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Proofs of proximity for context-free languages and read-once branching programs
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Relations Among Complexity Measures
• Secure two-party computation with low communication
• Short pairing-based non-interactive zero-knowledge arguments
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Succinct non-interactive arguments via linear interactive proofs
• Succinct randomized encodings and their applications
• The hunting of the SNARK

Cited in

(20)

• SNARGs for monotone policy batch NP
• No-signaling linear PCPs
• Parallelizable delegation from LWE
• Locally verifiable distributed SNARGs
• Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
• Delegating RAM computations with adaptive soundness and privacy
• Adaptive succinct garbled RAM or: how to delegate your database
• Lattice-based functional commitments: fast verification and cryptanalysis
• Round-optimal black-box commit-and-prove with succinct communication
• Non-interactive publicly-verifiable delegation of committed programs
• 3-message zero knowledge against human ignorance
• SNARGs for P from sub-exponential DDH and QR
• SPARKs: succinct parallelizable arguments of knowledge
• No-signaling linear PCPs
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
• Fully-succinct publicly verifiable delegation from constant-size assumptions
• Boosting batch arguments and RAM delegation
• The hunting of the SNARK
• Verifiable private information retrieval
• Memory delegation

This page was built for publication: Delegating RAM Computations

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