Sciweavers

978 search results - page 102 / 196
» Knowledge, Probability, and Adversaries
Sort
View
IPPS
2009
IEEE
15 years 4 months ago
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability
We consider the fully distributed Video-on-Demand problem, where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less between ...
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgol...
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
15 years 4 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
WPES
2006
ACM
15 years 3 months ago
Nonesuch: a mix network with sender unobservability
Oblivious submission to anonymity systems is a process by which a message may be submitted in such a way that neither the anonymity network nor a global passive adversary may dete...
Thomas S. Heydt-Benjamin, Andrei Serjantov, Beness...
EUROCRYPT
2010
Springer
15 years 2 months ago
Adaptively Secure Broadcast
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
Martin Hirt, Vassilis Zikas
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith