Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract) [chapter]

Zvi Galil, Stuart Haber, Moti Yung
1988 Lecture Notes in Computer Science  
We give a general procedure for designing correct, secure, and fault-tolerant cryptographic protocols for many parties, thus enlarging the domain of tasks that can be performed efficiently by cryptographic means. We model the most general sort of feasible adversarial behavior, and describe fault-recovery procedures that can tolerate it. Our constructions minimize the use of cryptographic resources. By applying the complexity-theoretic approach to knowledge, we are able to measure and control
more » ... computational knowledge released to the various users, as well as its temporal availability. Supported in part by NSF grants MCS-8303139 and DCR-8511713. Supported in part by an IBM graduate fellowship.
doi:10.1007/3-540-48184-2_10 fatcat:ghzpsdxxjfa5hd2lysht6zonpu