Abstract
Under the assumption that each pair of participants can communicate secretly, we show that any reasonable multiparty protocol can be achieved if at least 2x/3 of the participants are honest. The secrecy achieved is unconditional. It does not rely on any assumption about computational intractability. © 1988 ACM.
Cite
CITATION STYLE
APA
Chaum, D., Crépeau, C., & Damgård, I. (1988). Multiparty unconditionally secure protocols. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 11–19). Association for Computing Machinery. https://doi.org/10.1145/62212.62214
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free