(Enter summary)
Abstract: Introduction
Secret Sharing is a fundamental notion for secure cryptographic design. In a Secret
Sharing protocol a dealer shares a secret among n servers so that subsets of t + 1 or
more servers can later reconstruct the secret, while subsets of t or less servers have
no information about it. This is what it is usually called a threshold Secret Sharing
scheme.
A Verifiable Secret Sharing (VSS for short in the following) protocol adds faulttolerance
to the above tasks. Informally, as first... (Update)
Cited by: More
Fast Three-Party Shared Generation of RSA Keys without.. - Ibrahim, Ibrahim.. (2004)
(Correct)
Fast Fully-Distributed and Threshold RSA Function Sharing - Ibrahim, Ibrahim, El-Sawy (2004)
(Correct)
Verifiable Threshold Sharing of a Large Secret Safe-Prime - Maged Hamada Ibrahim (2005)
(Correct)
Similar documents (at the sentence level):
8.8%: Verifiable Secret Sharing as Secure Computation - Gennaro, Micali (1995)
(Correct)
Active bibliography (related documents): More All
0.2: Theory and Practice of Verifiable Secret Sharing - Gennaro (1996)
(Correct)
0.1: Cryptology - Rivest (1990)
(Correct)
0.1: Lecture Notes on Cryptography - Goldwasser, Bellare (1996)
(Correct)
Similar documents based on text: More All
0.5: The Round Complexity of Verifiable Secret Sharing.. - Gennaro, Ishai.. (2001)
(Correct)
0.4: Asynchronous Verifiable Secret Sharing and Proactive .. - Cachin, Kursawe.. (2002)
(Correct)
0.3: On the Complexity of Verifiable Secret Sharing and.. - Cramer.. (2000)
(Correct)
Related documents from co-citation: More All
8: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
8: Completeness Theorems for NonCryptographic Fault-Tolerant Distributed Computatio.. (context) - BenOr, Goldwasser et al. - 1988
7: Verifiable secret sharing and multiparty protocols with honest majority (context) - Rabin, Ben-Or - 1989
BibTeX entry: (Update)
Gennaro, R. Theory and Practice of Verifiable Secret Sharing. PhD thesis, Massachusetts Institute of Technology (MIT), May 1996. http://citeseer.ist.psu.edu/gennaro96theory.html More
@misc{ gennaro96theory,
author = "R. Gennaro",
title = "Theory and Practice of Verifiable Secret Sharing",
text = "Gennaro, R. Theory and Practice of Verifiable Secret Sharing. PhD thesis,
Massachusetts Institute of Technology (MIT), May 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/gennaro96theory.html" }
Citations (may not include all citations):
287
Multiparty unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988
120
Secure computation (context) - Micali, Rogaway - 1992
109
Verifiable secret sharing and achieving simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
93
Generalized secret sharing and monotone functions (context) - Benaloh, Leichter - 1988
28
An optimal probabilistic protocol for synchronous byzantine .. (context) - Feldman, Micali - 1988
22
Robust sharing of secrets when the dealer is honest or cheat.. (context) - Rabin - 1994
10
Completeness theorems for faulttolerant distributed computin.. (context) - Ben-Or, Goldwasser et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/theory.lcs.mit.edu.html): More
Studies in Secure Multiparty Computation and Applications - Canetti (1995)
(Correct)
Machine Learning (Lecture notes 13) - Rivest (1994)
(Correct)
Scheduling Multithreaded Computations by Work Stealing - Blumofe, Leiserson (1994)
(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