Memory Delegation
- 1 January 2011
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- From Secrecy to Soundness: Efficient Verification via Secure ComputationLecture Notes in Computer Science, 2010
- Short PCPs Verifiable in Polylogarithmic TimePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The random oracle methodology, revisitedJournal of the ACM, 2004
- Universal arguments and their applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Does parallel repetition lower the error in computationally sound protocols?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- How to go beyond the black-box simulation barrierPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Minimizing the use of random oracles in authenticated encryption schemesPublished by Springer Science and Business Media LLC ,1997
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Checking computations in polylogarithmic timePublished by Association for Computing Machinery (ACM) ,1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988