Sciweavers

851 search results - page 141 / 171
» Random constructions and density results
Sort
View
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
15 years 10 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
15 years 6 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
SAC
2009
ACM
15 years 4 months ago
Modular implementation of adaptive decisions in stochastic simulations
We present a modular approach to implement adaptive decisions with existing scientific codes. Using a sophisticated system software tool based on the function call interception t...
Pilsung Kang 0002, Yang Cao, Naren Ramakrishnan, C...
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...