Sciweavers

46 search results - page 2 / 10
» Hypergraphs of Multiparty Secrets
Sort
View
SCN
2010
Springer
129views Communications» more  SCN 2010»
13 years 3 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
ACNS
2006
Springer
121views Cryptology» more  ACNS 2006»
13 years 11 months ago
Authentication for Paranoids: Multi-party Secret Handshakes
In a society increasingly concerned with the steady assault on electronic privacy, the need for privacy-preserving techniques is both natural and justified. This need extends to t...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
TIT
2008
147views more  TIT 2008»
13 years 5 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 8 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...