Sciweavers

2237 search results - page 367 / 448
» On the Security of Random Sources
Sort
View
P2P
2009
IEEE
15 years 4 months ago
On Tracking Freeriders in Gossip Protocols
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received ...
Rachid Guerraoui, Kévin Huguenin, Anne-Mari...
ATAL
2009
Springer
15 years 4 months ago
Smart cheaters do prosper: defeating trust and reputation systems
Traders in electronic marketplaces may behave dishonestly, cheating other agents. A multitude of trust and reputation systems have been proposed to try to cope with the problem of...
Reid Kerr, Robin Cohen
ICISS
2009
Springer
15 years 4 months ago
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowled...
Michael K. Reiter, Vyas Sekar, Chad Spensky, Zheng...
ISW
2009
Springer
15 years 4 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
ARC
2010
Springer
178views Hardware» more  ARC 2010»
15 years 4 months ago
An Analysis of Delay Based PUF Implementations on FPGA
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabri...
Sergey Morozov, Abhranil Maiti, Patrick Schaumont