Stefan Dziembowski  Home/Search
Context Related
| brics.dk/DS/Ref/BR...RICSDS011.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: brics.dk/DS/Ref/BR...BRICSDSRef (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this thesis we study a problem of doing Verifiable Secret Sharing (VSS) and Multiparty Computations (MPC) in a model where private channels between the players and a broadcast channel is available. The adversary is active, adaptive and has an unbounded computing power. The thesis is based on two papers [CDD00, CDD 99]. (Update)
Cited by: More
Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003) (Correct)
Similar documents (at the sentence level):
10.4%: On the Complexity of Verifiable Secret Sharing and.. - Cramer.. (2000) (Correct)
Active bibliography (related documents): More All
0.5: Tight Security Proofs for the Bounded-Storage Model - Stefan Dziembowski Dziembowski (2002) (Correct)
0.4: Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (Correct)
0.3: General Secure Multi-Party Computation from any Linear .. - Cramer.. (1999) (Correct)
Similar documents based on text: More All
0.4: Efficient Multiparty Computations Secure Against.. - Cramer.. (1999) (Correct)
0.2: How Much Memory Is Needed to Win Infinite Games? - Dziembowski, Jurdzinski.. (1998) (Correct)
0.2: How Much Memory is Needed to Win Infinite Games? - Dziembowski, Jurdzinski.. (1997) (Correct)
BibTeX entry: (Update)
Stefan Dziembowski. Multiparty Computations Information-Theoretically Secure Against an Adaptive Adversary. PhD thesis, University of Arhus, 2000. http://citeseer.ist.psu.edu/dziembowski01multiparty.html More
@misc{ dziembowski00multiparty,
author = "S. Dziembowski",
title = "Multiparty Computations Information-Theoretically Secure Against an Adaptive
Adversary",
text = "Stefan Dziembowski. Multiparty Computations Information-Theoretically Secure
Against an Adaptive Adversary. PhD thesis, University of Arhus, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/dziembowski01multiparty.html" }
Citations (may not include all citations):127 Verifiable secret sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989
124 Bit commitment using pseudorandomness - Naor - 1991
109 Verifiable secret sharing and achieving simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
98 How to play any mental game --- A completeness theorem for p.. (context) - Goldreich, Micali et al. - 1987
91 Secret sharing schemes realizing general access structures (context) - Ito, Saito et al. - 1987
69 On span programs (context) - Karchmer, Wigderson - 1993
69 Adaptively secure multi-party computation - Canetti, Feige et al. - 1996
46 personal communication (context) - Hirt - 1999
45 General secure multi-party computation from any linear secre.. - Cramer, Damgard et al. - 2000
45 Optimal algorithms for Byzantine agreement (context) - Feldman, Micali - 1988
39 Complete characterization of adversaries tolerable in secure.. - Hirt, Maurer - 1997
22 Robust sharing of secrets when the dealer is honest or cheat.. (context) - Rabin - 1994
14 Committed oblivious transfer and private multi-party computa.. (context) - Crepeau, Graaf et al. - 1995
13 Communications of the Association for Computing Machinery (context) - Shamir, share et al. - 1979
12 Theory and Practice of Verifiable Secret Sharing - Gennaro - 1995
8 The tail of the hypergeometric distribution (context) - Chvatal - 1979
6 Efficient byzantine agreement secure against general adversa.. - Fitzi, Maurer - 1998
4 Simplified vss and facttrack multiparty computations with ap.. (context) - Gennaro, Rabin et al. - 1998
2 Concentration of measure for analysis of randomised algorith.. - Dubhashi, Panconesi - 1998
Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html): More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000) (Correct)
Dynamic Computation - Husfeldt (1997) (Correct)
Games for Verification: Algorithmic Issues - Jurdzinski (2000) (Correct)
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