Memory Delegation
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 151-168
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- From Secrecy to Soundness: Efficient Verification via Secure Computation2010
- Short PCPs Verifiable in Polylogarithmic Time2005
- The random oracle methodology, revisitedJournal of the ACM, 2004
- Universal arguments and their applications2003
- Does parallel repetition lower the error in computationally sound protocols?2002
- How to go beyond the black-box simulation barrier2001
- Minimizing the use of random oracles in authenticated encryption schemes1997
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Checking computations in polylogarithmic time1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988