Memory Delegation
From MaRDI portal
Publication:5199189
DOI10.1007/978-3-642-22792-9_9zbMath1288.68005OpenAlexW2912272112MaRDI QIDQ5199189
Ran Raz, Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu
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
Related Items (22)
Condensed Unpredictability ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ Arguments of Proximity ⋮ Delegating RAM Computations ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ Refereed delegation of computation ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ Batch verifiable computation of outsourced functions ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ The hunting of the SNARK ⋮ On the Complexity of Breaking Pseudoentropy ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Arthur-Merlin streaming complexity
This page was built for publication: Memory Delegation