20 search results - page 3 / 4 » Fully Private Auctions in a Constant Number of Rounds |
127
click to vote
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
139
click to vote
SP
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
119
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
SIGMETRICS
2008
ACM
15 years 1 months ago
2008
ACM
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
113
click to vote
PKC
2012
Springer
13 years 4 months ago
2012
Springer
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...