Sciweavers

246 search results - page 42 / 50
» Informed secure watermarking using optimal transport
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
SIGMOD
2011
ACM
204views Database» more  SIGMOD 2011»
12 years 10 months ago
Datalog and emerging applications: an interactive tutorial
We are witnessing an exciting revival of interest in recursive Datalog queries in a variety of emerging application domains such as data integration, information extraction, netwo...
Shan Shan Huang, Todd Jeffrey Green, Boon Thau Loo
EUROCRYPT
2007
Springer
14 years 2 months ago
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...
Krzysztof Pietrzak, Johan Sjödin
EMS
2008
IEEE
13 years 9 months ago
Threat Modeling Revisited: Improving Expressiveness of Attack
Threat modeling plays an important role in the deployment of optimal security controls and a number of threat modeling techniques have been proposed. However, most of the existing...
Drake Patrick Mirembe, Maybin K. Muyeba
TIT
2008
187views more  TIT 2008»
13 years 7 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer