On hiding information from an oracle
- 1 August 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 39 (1), 21-50
- https://doi.org/10.1016/0022-0000(89)90018-4
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A simple protocol for secure circuit evaluationPublished by Springer Nature ,1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- On hiding information from an oraclePublished by Association for Computing Machinery (ACM) ,1987
- The complexity of perfect zero-knowledgePublished by Association for Computing Machinery (ACM) ,1987
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted DataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952