Ronald Cramer, Ivan B. Damgård, Ueli Maurer  Home/Search
Context Related
| brics.dk/RS/97/Ref...ICSRS9728.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/RS/97/Ref/BRICSRS97... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The contributions of this paper are three-fold. First, as an abstraction of previously proposed cryptographic protocols we propose two cryptographic primitives: homomorphic shared commitments and linear secret sharing schemes with an additional multiplication property. We describe new constructions for general secure multi-party computation protocols, both in the cryptographic and the information-theoretic (or secure channels) setting, based on any realizations of these primitives. (Update)
Context of citations to this paper: More
...simplicity of exposition. The same definitional methodology holds with respect to other, more general corruption structures (e.g. [31, 16]) both in the non adaptive and the adaptive cases. 4.3 Modular composition: The non adaptive case Recall that we want to break down a...
...as a subprotocol in various applications such as secure multi party computation. For example, the results of Cramer, Damgard and Maurer in [CDM98] rely on the existence of a broadcast protocol, secure against a general adversary, with computation and message complexity...
Cited by: More
Security and Composition of Multi-party Cryptographic Protocols - Canetti (1999) (Correct)
Efficient Byzantine Agreement Secure Against General.. - Fitzi, Maurer (1998) (Correct)
Active bibliography (related documents): More All
0.9: Span Programs over Rings and How to Share a Secret from a Module - Fehr (1998) (Correct)
0.7: On the Complexity of Verifiable Secret Sharing and.. - Cramer.. (2000) (Correct)
0.7: Secure Distributed Linear Algebra in a Constant Number of.. - Cramer, Damgård (2000) (Correct)
Similar documents based on text: More All
1.7: Multiparty Computation from Threshold Homomorphic.. - Cramer, Damgård.. (2000) (Correct)
1.4: Improved Non-Committing Encryption Schemes based on a.. - Damgård, Nielsen (2000) (Correct)
1.3: Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1998) (Correct)
Related documents from co-citation: More All
3: Complete characterization of adversaries tolerable in secure multi-party computa.. - Hirt, Maurer - 1997
3: Completeness Theorems for noncryptographic fault-tolerant distributed computatio.. (context) - Ben-Or, Goldwasser et al. - 1988
3: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
BibTeX entry: (Update)
R. Cramer, I. Damgard and U. Maurer ,"Span programs and general secure multi-party computation", manuscript, 1998. http://citeseer.ist.psu.edu/cramer97span.html More
@misc{ cramer98span,
author = "R. Cramer and I. Damgard and U. Maurer",
title = "Span programs and general secure multi-party computation",
text = "R. Cramer, I. Damgard and U. Maurer ,Span programs and general secure multi-party
computation, manuscript, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/cramer97span.html" }
Citations (may not include all citations):44 Simplified VSS and Fast-Track Multiparty Computations with A.. - Gennaro, Rabin et al.
21 Communications of the ACM (context) - Shamir, Share et al. - 1979
11 Wigderson: How to Play Any Mental Game or a Completeness The.. (context) - Goldreich, Micali
11 Leichter: Generalized Secret Sharing and Monotone Functions (context) - Benaloh
9 Wigderson: On Span Programs (context) - Karchmer - 1993
8 Damgard: Multi-Party Unconditionally Secure Protocols (context) - Chaum, Cr'epeau
6 Wigderson: Completeness theorems for Non-Cryptographic Fault.. (context) - Ben-Or, Goldwasser
6 Ben-Or: Verifiable Secret Sharing and Multiparty Protocols w.. (context) - Rabin
4 Wigderson: Extremal Bipartite Graphs and Superpolynomial Low.. (context) - Babai, G'al et al.
4 Naor: Adaptively Secure Multi-Party Computation (context) - Canetti, Feige et al.
4 Awerbuch: Verifiable Secret Sharing and Achieving Simultanei.. (context) - Chor, Goldwasser et al.
2 Maurer: Complete Characterization of Adversaries Tolerable i.. (context) - Hirt
1 Weizmann Institute of Science (context) - Canetti, Secure et al. - 1995
1 Damgard: Zero Knowledge for Finite Field Arithmetic or: Can .. (context) - Cramer - 1997
1 Springer Verlag LNCS series (context) - Pudl'ak, Sgall et al.
1 Micali: An Optimal Probabilistic Protocol for Synchronous By.. (context) - Feldman - 1997
Documents on the same site (http://www.brics.dk/RS/97/Ref/BRICS-RS-97-Ref/): More
Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997) (Correct)
CoFI: The Common Framework Initiative for Algebraic Specification .. - Mosses (1997) (Correct)
Syntax and Semantics of the logic ... - Butz (1997) (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