Efficient Multiparty Computations Secure Against an Adaptive Adversary
- 15 April 1999
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 311-326
- https://doi.org/10.1007/3-540-48910-x_22
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Secure ComputationPublished by Springer Science and Business Media LLC ,2007
- Fair Computation of General Functions in Presence of Immoral MajorityPublished by Springer Science and Business Media LLC ,2001
- Cryptographic Protocols Provably Secure Against Dynamic AdversariesPublished by Springer Science and Business Media LLC ,2001
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemeLecture Notes in Computer Science, 2000
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptographyPublished by Association for Computing Machinery (ACM) ,1998
- Robust sharing of secrets when the dealer is honest or cheatingJournal of the ACM, 1994
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987