Sciweavers

3130 search results - page 12 / 626
» Collusion without communication
Sort
View
56
Voted
SCN
2010
Springer
127views Communications» more  SCN 2010»
14 years 10 months ago
Get Shorty via Group Signatures without Encryption
Patrik Bichsel, Jan Camenisch, Gregory Neven, Nige...
EUROCRYPT
2001
Springer
15 years 4 months ago
Lower Bounds for Multicast Message Authentication
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
Dan Boneh, Glenn Durfee, Matthew K. Franklin
ACNS
2009
Springer
142views Cryptology» more  ACNS 2009»
15 years 6 months ago
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
Mark Manulis
FC
2003
Springer
101views Cryptology» more  FC 2003»
15 years 5 months ago
Fully Private Auctions in a Constant Number of Rounds
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...
Felix Brandt
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
Robust incentive techniques for peer-to-peer networks
Lack of cooperation (free riding) is one of the key problems that confronts today’s P2P systems. What makes this problem particularly difficult is the unique set of challenges ...
Michal Feldman, Kevin Lai, Ion Stoica, John Chuang