Self-testing/correcting protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1693, Issue , 1999, Pages 269-284

  Franklin, Matthew ^a   Garay, Juan A ^b   Yung, Moti ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c CerCo Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

CRASH FAILURES; DISTRIBUTED FUNCTION; DISTRIBUTED PROTOCOLS; HIGH PROBABILITY; PRIVACY PRESERVING; PROGRAM CHECKING; SELF-TESTING;

PROBABILITY;

EID: 84947924339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48169-9_19     Document Type: Conference Paper

References (27)

1. Y. Afek, S. Kutten and M. Yung, “The Local Detection Paradigm and Its Applications to Self-Stabilization.” TCS 186 (1-2), pp. 199-229 (1997). 272
2. L. Adleman and K. Kompella. “Fast Checkers for Cryptography.” In CRYPTO ’90, pp. 515-529. 271
3. B. Awerbuch, B. Patt-Shamir and G. Varghese, “Self Stabilizing by local Checking and Correction.” In FOCS ’91, pp. 268-277. 272
4. M. Blum, “Designing programs to check their work.” Communications of the ACM. 270
5. P. Berman and A. Bharali, “Quick Atomic Broadcast.” In WDAG ’93. 280
6. M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor. “Checking the Correctness of Memories.” In FOCS ’91, pp. 90-99. 271
7. D. Beaver and J. Feigenbaum, “Hiding Instances in Multioracle Queries.” In STACS ’90, pp. 37-48. 281, 281
8. M. Bellare, J. Garay and T. Rabin. “Batch Verification with Applications to Cryptography and Checking” (invited paper). In LATIN ’98, pp. 170-191. 271
9. M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation.” In STOC ’88, pp. 1-10. 271, 280
10. M. Blum and S. Kannan, “Designing programs to check their work.” In STOC ’89, pp. 86-97. 271
11. M. Blum, M. Luby, and R. Rubinfeld, “Self-Testing/Correcting with Applications to Numerical Problems.” In STOC ’90, pp. 73-83. 270, 270, 270, 271, 271, 271, 273, 273, 274, 275, 280, 282
12. D. Chaum, C. Crepeau and I. Damgard. “Multiparty Unconditionally Secure Protocols.” In STOC ’88, pp. 11-19. 271, 280
13. B. Chor, M. Merritt, and D. Shmoys, “Simple Constant-Time Consensus Protocols in Realistic Failure Models.” In PODC ’85, pp. 152-162. 271, 280
14. D. Dolev, “The Byzantine Generals Strike Again,” Journal of Algorithms, 3(1):14-30, January 1982. 271, 275
15. S. Dolev, A. Israeli and S. Moran, “Self Stabilization of Dynamic Systems assuming only Read/Write Atomicity.” In PODC ’90, pp. 103-117. 272
16. C. Dwork and Y. Moses, “Knowledge and common knowledge in a Byzantine environment: crash failures.” Information and Computation 88, pp. 156-186 (1990). 275
17. F. Ergun, S. Ravi Kumar and R. Rubinfeld. “Approximate Checking of Polynomials and Functional Equations.” In FOCS ’96, pp. 592-601. 271
18. Y. Frankel, P. Gemmell and M. Yung. “Witness-Based Cryptographic Program Checking and Robust Function Sharing.” In STOC ’96, pp. 499-508. 271
19. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. “Selftesting/ correcting for polynomials and for approximate functions.” In STOC ’91, pp. 32-42. 271
20. S. Kannan, “Program Checkers for Algebraic Problems.” Ph.D. Thesis, ICSI TR- 89-064, December 1989. 270
21. R. Karp, M. Luby, and N. Madras, “Monte-Carlo Approximation Algorithms for Enumeration Problems.” Journal of Algorithms 10, pp. 429-448 (1989). 277
22. S. Katz and K. Perry, “Self-Stabilizing Extensions for Message-Passing Systems.” In PODC ’90, pp. 91-101. 272
23. R. Lipton, “New Directions in Testing,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 2 (1991), pp. 191-202. 270, 270, 278
24. L. Lamport, R.E. Shostak and M. Pease, “The Byzantine Generals Problem,” ACM ToPLaS, Vol. 4, No. 3 (1982), pp. 382-401. 271, 275
25. R. Rubinfeld, “A Mathematical Theory of Self-Checking, Self-Testing and Self- Correcting Programs.” Ph.D. Thesis, ICSI TR-90-054, October 1990. 271, 277
26. R. Rubinfeld. “On the Robustness of Functional Equations.” In FOCS ’94, pp. 2-13. 271
27. R. Rubinfeld. “Designing Checkers for Programs that Run in Parallel.” Algorithmica 15(4), pp. 287-301, 1996. 271