Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 463-474
- https://doi.org/10.1007/3-540-45022-x_39
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Private information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Single Database Private Information Retrieval Implies Oblivious TransferPublished by Springer Nature ,2000
- Computationally Private Information Retrieval with Polylogarithmic CommunicationPublished by Springer Nature ,1999
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Protecting data privacy in private information retrieval schemesPublished by Association for Computing Machinery (ACM) ,1998
- Ensuring the integrity of agent-based computations by short proofsPublished by Springer Nature ,1998
- Upper bound on the communication complexity of private information retrievalPublished by Springer Nature ,1997
- Two prover protocolsPublished by Association for Computing Machinery (ACM) ,1994
- Checking computations in polylogarithmic timePublished by Association for Computing Machinery (ACM) ,1991
- Witness indistinguishable and witness hiding protocolsPublished by Association for Computing Machinery (ACM) ,1990