CRYPTO
2009
Springer
13 years 8 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
CRYPTO
2009
Springer
13 years 10 months ago
2009
Springer
We suggest practical sub-linear size zero-knowledge arguments for statements involving linear algebra. Given commitments to matrices over a finite field, we give a sub-linear siz...