Memory delegation

DOI10.1007/978-3-642-22792-9_9MaRDI QIDQ5199189zbMATH OpenOpenAlexFDO

Authors Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz

Publication date 12 August 2011

Published in Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_9

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Delegating RAM Computations
• Practical verified computation with streaming interactive proofs
• Refereed delegation of computation
• Batch verifiable computation of outsourced functions
• Delegating RAM computations with adaptive soundness and privacy

Cited in

(27)

• The hunting of the SNARK
• Practical homomorphic message authenticators for arithmetic circuits
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
• Arthur-Merlin streaming complexity
• Secure outsourcing of modular exponentiations under single untrusted programme model
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
• Metric pseudoentropy: characterizations, transformations and applications
• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• On the Complexity of Breaking Pseudoentropy
• 3-message zero knowledge against human ignorance
• Pseudoentropy: lower-bounds for chain rules and transformations
• Delegating RAM computations with adaptive soundness and privacy
• Delegating RAM Computations
• A counterexample to the chain rule for conditional HILL entropy
• Condensed Unpredictability
• Arguments of proximity (extended abstract)
• Refereed delegation of computation
• Verifiable stream computation and Arthur-Merlin communication
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Nearly optimal pseudorandomness from hardness
• Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
• Reusable online-efficient commitments
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Batch verifiable computation of outsourced functions

This page was built for publication: Memory delegation

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