34 search results - page 1 / 7 » Non-Interactive and Information-Theoretic Secure Verifiable ... |
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
STOC
2000
ACM
13 years 11 months ago
2000
ACM
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...
ASIACRYPT
2010
Springer
13 years 5 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...
EUROCRYPT
1998
Springer
14 years 3 days ago
1998
Springer
ACISP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol re...