94 search results - page 6 / 19 » On the complexity of verifiable secret sharing and multipart... |
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
14 years 2 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
CCS
2001
ACM
14 years 6 days ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
CISC
2006
Springer
14 years 8 days ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
ASIACRYPT
2001
Springer
14 years 1 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...