20 search results - page 2 / 4 » Fully Private Auctions in a Constant Number of Rounds |
CRYPTO
2009
Springer
13 years 12 months ago
2009
Springer
We present a new methodology for proving security of encryption systems using what we call Dual System Encryption. Our techniques result in fully secure Identity-Based Encryption ...
IJCAI
2007
13 years 6 months ago
2007
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
ICDCN
2011
Springer
12 years 8 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
We describe two new public key broadcast encryption systems for stateless receivers. Both systems are fully secure against any number of colluders. In our first construction both...