20 search results - page 1 / 4 » Fully Private Auctions in a Constant Number of Rounds |
FC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
We construct a fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys. More precisely, let N be the total number of users...
CCS
2008
ACM
13 years 7 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...