20 search results - page 4 / 4 » Fully Private Auctions in a Constant Number of Rounds |
IPTPS
2005
Springer
13 years 11 months ago
2005
Springer
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
ECCC
2000
13 years 5 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...