Adam Smith, Anton Stiglic  Home/Search
Context Related
| cs.mcgill.ca/pub/techre...TR98.2.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.mcgill.ca/~asmith/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present here a generalization of the work done by Rabin and Ben-Or in [RB89]. We give a protocol for multiparty computation which tolerates any Q² active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional although we allow an exponentially small probability of error. This is possible due to a protocol for... (Update)
Context of citations to this paper: More
...with complexity O( k logn)nm 3 ) bits, where m is the size of the monotone span program. In some independent work Smith and Stiglic[SS98] present a somewhat similar idea, which however results in a less efficient protocol (O(k 2 (k log n)nm 3 ) bits) because they directly...
...is feasible and for which there is an efficient linear secret sharing scheme, efficient multi party protocols exist. Smith and Stiglic [SS98] consider also uniquely active adversaries and propose protocols for the active model with broadcast. The efficiency of their...
Cited by: More
Traffic Analysis Attacks and Trade-Offs in Anonymity.. - Back, Möller, Stiglic (2001) (Correct)
Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (Correct)
General Adversaries in Unconditional Multi-Party Computation - Fitzi, Hirt, Maurer (1999) (Correct)
Similar documents (at the sentence level):
79.7%: Multiparty computation unconditionally secure against Q - Adversary Structures Adam (Correct)
25.6%: Multiparty computation unconditionally secure against Q² .. - Smith, Stiglic (1998) (Correct)
Active bibliography (related documents): More All
0.3: Towards Fault-Tolerant and Secure On-Line Services - Zhou (2001) (Correct)
0.2: Secure Multi-party Quantum Computation - Crépeau, Gottesman, Smith (2002) (Correct)
0.2: Statistical Multiparty Computation Based on - Random Walks On (2005) (Correct)
Similar documents based on text: More All
0.7: Secure Multi-Party Computation from any Linear Secret.. - Nikov, Nikova, Preneel (2003) (Correct)
Related documents from co-citation: More All
3: Verifiable secret sharing and multiparty protocols with honest majority (context) - Rabin, Ben-Or - 1989
3: How to play any mental game --- a completeness theorem for protocols with honest.. (context) - Goldreich, Micali et al. - 1987
3: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
BibTeX entry: (Update)
A. Smith and A. Stiglic. Multiparty computations unconditionally secure against Q 2 adversary structures. Manuscript, 1998. http://citeseer.ist.psu.edu/article/smith98multiparty.html More
@techreport{ smith98multiparty,
author = "Adam Smith and Anton Stiglic",
title = "Multiparty computation unconditionally secure against ${\cal Q}^2$ adversary structures",
number = "SOCS-98.2",
year = "1998",
url = "citeseer.ist.psu.edu/article/smith98multiparty.html" }
Citations (may not include all citations):287 Multiparty unconditionally secure protocols (context) - Chaum, Crepeau et al.
219 Completeness theorems for noncryptographic fault-tolerant di.. (context) - Ben-Or, Goldwasser et al.
140 How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
69 On span programs (context) - Karchmer, Wigderson - 1993
39 Complete characterization of adversaries tolerable in genera.. - Hirt, Maurer - 1997
23 Fast asynchronous Byzantine agreement with optimal resilienc.. (context) - Canetti, Rabin - 1993
10 Asynchronous Byzantine agreement protocols (context) - Bracha - 1987
10 Span programs and general multiparty computation (context) - Cramer, Damgard et al. - 1998
8 Asynchronous secure computations with optimal resilience (context) - Ben-Or, Kelmer et al. - 1994
8 Personal communication (context) - Cramer - 1998
5 able secret sharing and achieving simultaneity in the presen.. (context) - Chor, Goldwasser et al. - 1985
4 cient multiparty computations with dishonest minority (context) - Cramer, Damgard et al. - 1998
2 able secret sharing and multiparty protocols with honest maj.. (context) - Rabin, Ben-Or - 1989
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