46 search results - page 4 / 10 » Hypergraphs of Multiparty Secrets |
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
INDOCRYPT
2003
Springer
14 years 17 days ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
ESORICS
2010
Springer
13 years 7 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...