4 search results - page 1 / 1 » Better with Byzantine: Manipulation-Optimal Mechanisms |
SAGT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
—To harness the ever growing capacity and decreasing cost of storage, providing an abstraction of dependable storage in the presence of crash-stop and Byzantine failures is compu...
SRDS
2007
IEEE
14 years 5 months ago
2007
IEEE
Replication is a mechanism extensively used to guarantee the availability and good performance of data storage services. Byzantine Quorum Systems (BQS) have been proposed as a sol...
ESORICS
2010
Springer
13 years 12 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...