Ivan Damgård, Matthias Fitzi, Jesper Buus Nielsen, Tomas Toft  Home/Search
Context Related
| iacr.org/2005/140.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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that if a set of players hold shares of a value a Z p for some prime p (where the set of shares is written [a] p ), it is possible to compute, in constant round and with unconditional security, sharings of the bits of a, i.e. compute sharings [a 0 ] p , . . . , [a #-1 ] p such that # = 2 (p)#, a 0 , . . . , a #-1 1} and a = . Our protocol is secure against active adversaries and works for any linear secret sharing scheme with a multiplication protocol. (Update)
Cited by: More
Improved Efficiency for Private Stable Matching - Matthew Franklin Mark (2006) (Correct)
Active bibliography (related documents): More All
0.3: Unconditionally Secure Constant Round Multi-Party Computation for.. - Kiltz (2005) (Correct)
0.2: Efficient Multi-Party Computation over Rings - Cramer, Fehr, Ishai, Kushilevitz (2003) (Correct)
0.2: On 2-Round Secure Multiparty Computation - Gennaro, Ishai, Kushilevitz, Rabin (2002) (Correct)
Similar documents based on text: More All
0.3: Improved Non-Committing Encryption Schemes based on a.. - Damgård, Nielsen (2000) (Correct)
0.3: Multiparty Computation from Threshold Homomorphic.. - Cramer, Damgård.. (2000) (Correct)
0.3: On Protocol Security in the Cryptographic Model - Nielsen (2003) (Correct)
BibTeX entry: (Update)
Ivan Damgrd, Matthias Fitzi, Jesper Buus Nielsen, and Tomas Toft. How to split a shared secret into shared bits in constant-round. Cryptology ePrint Archive, Report 2005/140, 2005. http://eprint.iacr.org/. http://citeseer.ist.psu.edu/damgrd05how.html More
@misc{ damgrd05how,
author = "I. Damgrd and M. Fitzi and J. Nielsen and T. Toft",
title = "How to split a shared secret into shared bits in constant-round",
text = "Ivan Damgrd, Matthias Fitzi, Jesper Buus Nielsen, and Tomas Toft. How to
split a shared secret into shared bits in constant-round. Cryptology ePrint
Archive, Report 2005/140, 2005. http://eprint.iacr.org/.",
year = "2005",
url = "citeseer.ist.psu.edu/damgrd05how.html" }
Citations (may not include all citations):53 A minimal model for secure computation - Feige, Kilian et al. - 1994
39 Non-cryptographic fault-tolerant computing in constant numbe.. (context) - Bar-Ilan, Beaver - 1989
24 Unbounded fan-in circuits and associative functions (context) - Chandra, Fortune et al. - 1983
21 Randomizing polynomials: A new representation with applicati.. - Ishai, Kushilevitz - 2000
16 Zero-knowledge proofs for finite field arithmetic (context) - Cramer, Damgaard - 1998
11 Lower bounds for constant depth circuits for prefix problems (context) - Chandra, Fortune et al. - 1983
8 cient computation modulo a shared secret with application to.. (context) - Algesheimer, Camenisch et al. - 2002
7 Perfect constant-round secure computation via perfect random.. - Ishai, Kushilevitz - 2002
7 Unconditionally secure constant round multi-party computatio.. - Kiltz - 2005
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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