D. Chaum, C. Crepeau, & I. Damg ard (1988). Multi-party uncondi144 tionally secure protocols. In Proc. 20th ACM Symp. on Theory of Computing, Chicago, 1988. ACM.  Home/Search   Document Not in Database   Summary   Related Articles

.... The majority of participants are honest: If we assume that a reliable broadcast channel exists, that each pair of participants has a private communication channel and that at least 2 3 n (later improved to 1 2 n) participants are honest, then there exist protocols for multi party computations [9, 4, 35, 3, 1]. All these protocols are based on secret sharing schemes, in which a participants breaks his secret in n Gamma 1 shares which he gives to the others. These secret sharing schemes have the property that a certain quorum is needed to reconstruct the secret from the shares, but a smaller number of ....

D. Chaum, C. Crepeau, & I. Damg ard (1988). Multi-party uncondi144 tionally secure protocols. In Proc. 20th ACM Symp. on Theory of Computing, Chicago, 1988. ACM.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC