18 search results - page 4 / 4 » The Round Complexity of Verifiable Secret Sharing Revisited |
CRYPTO
1994
Springer
13 years 10 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
CCS
2007
ACM
13 years 12 months ago
2007
ACM
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
IACR
2011
12 years 5 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...