Witness-based cryptographic program checking and robust function sharing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 499-508

  Frankel, Yair ^a   Gemmeli, Peter ^a   Yung, Moti ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EFFICIENCY; KNOWLEDGE BASED SYSTEMS; CRYPTOGRAPHY; FUNCTIONS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; ONLINE SYSTEMS; QUERY LANGUAGES; SECURITY OF DATA;

COMPUTATIONAL ADVANTAGES; CRYPTOGRAPHIC FUNCTIONS; ENTIRE FUNCTIONS; FUNCTION VALUES; NUMERICAL PROBLEMS; PROGRAM CHECKING; PROGRAM RESULT CHECKING; SECURITY REQUIREMENTS;

CRYPTOGRAPHY; PROGRAMMING THEORY;

CRYPTOGRAPHIC PROGRAM CHECKING; HOMOMORPHIC FUNCTIONS; ROBUST FUNCTION SHARING;

EID: 0029713931     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237998     Document Type: Conference Paper

References (26)

1. M. Abadi, J. Feigenbaum, and J. Kilian, On Hiding Information from an Oracle, STOC 87.
2. N. Alon, Z. Galil and M. Yung, Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary, European Symp. on Algorithms (ESA 95), Springer Verlag LNCS 979, 1995.
3. M. Bellare and P. Rogaway, Random Oracles are Practical: a paradigm for designing efficient protocols, ACM, 1-st Comp. and Com. Sec. 1993.
4. M. Blum, Designing programs to check their work, ICSI technical report TR-88-009.
5. M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor. Checking the Correctness of Memories. In the 32nd Annual Foundations of Computer Science Conference, pp 90-99, October 1991.
6. M. Blum, M. Luby, and R. Rubinfeld, Self testing/correcting with applications to numerical problems, Journal of Computer and Systems Science, Vol 47, pp. 549-595, 1993.
7. Preliminary version: The Proceedings of the 22nd ACM Symposium on the Theory of Computing, pp. 73-68, 1990.
8. M. Blum and S. Kannan, Designing programs that check their work, Proceedings of the 21st ACM Symposium on the Theory of Computing (STOC), pp. 86-97, 1989.
9. M. Blum and M. Wasserman, Software reliability via run-time result checking, 35th IEEE Foundations of Computer Science (FOCS), 1994.
10. D. Chaum and H. van Antwerpen, Undeniable Signatures, Advances in Cryptology, Proc. of Crypto'89 (Lecture Notes in Computer Science 435), pages 212-216, 1990.
11. D. E. Denning and M. Smid, Key Escrowing Now, IEEE Commu. Magazine, Sep. 1994, pp. 54-68.
12. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, How to Share a Function Securely, Proceedings of the ACM Symp. on the Theory of Computing (STOC), pp. 522-533, 1994.
13. Y. Desmedt and Y. Frankel, Threshold cryptosystems, Crypto'89, Springer-Verlag LNCS 435, 1990, pp. 307-315.
14. A. Fiat and A. Shamir, "How to prove yourself: practical solutions to identification and signature problems", Crypto'86, pp. 186-194.
15. FIPS PUB 185, Escrowed Encryption Standard Feb. 1994. (Dept. of Commerce).
16. Y. Frankel, "A practical protocol for large group oriented networks", Advances in cryptology, Proc. of Eurocrypt 89. pp. 56-61.
17. Y. Frankel, P. Gemmell, P. MacKenzie, M. Yung Proactive RSA. manuscript, available from the authors.
18. O. Goldreich and H. Krawczyk, On the Composition of Zero-Knowledge Proof Systems, ICALP 1990.
19. O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design, J. of the ACM, v. 38, 1991, pp. 691-729.
20. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM J. on Computing, v. 18(1), 1989.
21. R. Impagliazzo, and M. Yung, Direct Minimum Knowledge Computations, Crypto-87, Springer Verlag LNCS, pp. 40-51.
22. R. Lipton, New directions in testing, distributed comput. and cryptography DIMACS series in Dis. Math and Th. Comp. Sci. vol 2, 1991, 191-202.
23. New York Times article (Wed., Oct. 11, 1995) on recent breaks of Netscape servers by U. C. Berekeley students: "If the application code is not secure, i.e., it can be replaced by a hacked version⋯"
24. M. Reiter and K. Birman, How to securely replicate services, ACM Trans, on Progr. Languages and Systems, 16(3), May 1994, pp. 986-1009.
25. R. Rubinfeld, A mathematical theory of self-checking, self-testing and self-correcting programs, Ph. D. Thesis, Univ. of California, Berkeley, 1990.
26. A. Yao, Coherent functions and program checkers, Proceedings of the 22nd ACM Symposium on the Theory of Computing (STOC), pp. 84-94, 1990.