Loading...
Please wait, while we are loading the content...
Similar Documents
Program Result Checking Against Adaptive Programs and in Cryptographic Settings (Extended Abstract) (1990)
| Content Provider | CiteSeerX |
|---|---|
| Author | Blum, Manuel Lu, Michael Rubinfeld, Ronitt |
| Description | ) Manuel Blum Computer Science Division U.C. Berkeley Berkeley, California 94720 Michael Luby International Computer Science Institute Berkeley, California 94704 Ronitt Rubinfeld y Computer Science Division U.C. Berkeley Berkeley, California 94720 May 17, 1990 Abstract The theory of program result checking introduced in [Blum] allows one to check that a program P correctly computes the function f on input x. The checker may use P 's outputs on other inputs to help it check that P (x) = f(x). In this setting, P is always assumed to be a fixed program, whose output on input x is a function P (x). We extend the theory to check a program P which returns a result on input x that may depend on previous questions asked of P . We call a checker that works for such a program an adaptive checker. We consider the case where there is an adaptive program that supposedly computes f running on each of several noninteracting machines. We design adaptive checkers that work for a c... |
| File Format | |
| Language | English |
| Publisher | American Mathematical Society |
| Publisher Date | 1990-01-01 |
| Publisher Institution | In DIMACS Workshop on Distributed Computing and Crypthography |
| Access Restriction | Open |
| Subject Keyword | Cryptographic Setting Previous Question Extended Abstract Adaptive Program Program Result Checking Adaptive Program Adaptive Checker Program Result Several Noninteracting Machine Fixed Program |
| Content Type | Text |
| Resource Type | Article |
