Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- 1 January 1991
- journal article
- Published by Springer Science and Business Media LLC in Journal of Cryptology
- Vol. 4 (2), 75-122
- https://doi.org/10.1007/bf00196771
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Hiding instances in multioracle queriesLecture Notes in Computer Science, 1990
- Minimum-Knowledge Interactive Proofs for Decision ProblemsSIAM Journal on Computing, 1989
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Multiparty computation with faulty majorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- How to share a secretCommunications of the ACM, 1979