Sciweavers

143 search results - page 28 / 29
» Hash, Displace, and Compress
Sort
View
INFOCOM
2009
IEEE
14 years 27 days ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 12 days ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
CCS
2010
ACM
13 years 6 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger
POPL
2007
ACM
14 years 6 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
MMSEC
2006
ACM
231views Multimedia» more  MMSEC 2006»
14 years 6 days ago
JPEG2000-based secure image authentication
We present an efficient JPEG2000-based image authentication scheme, which is robust to JPEG compression and other allowed signal processing operations. Positive wavelet-based wate...
Mathias Schlauweg, Dima Pröfrock, Erika M&uum...