Sciweavers

2421 search results - page 134 / 485
» Message from the Co-Chairs
Sort
View
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 9 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
CHI
2009
ACM
14 years 4 months ago
Butler lies: awareness, deception and design
Instant messaging (IM) is a common and popular way for co-workers, friends, and family to stay in touch, but its “always-on” properties can sometimes lead people to feel overe...
Jeffrey T. Hancock, Jeremy P. Birnholtz, Natalya N...
ISW
2009
Springer
14 years 3 months ago
MAC Precomputation with Applications to Secure Memory
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, Sh...
Juan A. Garay, Vladimir Kolesnikov, Rae McLellan
PAM
2007
Springer
14 years 3 months ago
Measures of Self-similarity of BGP Updates and Implications for Securing BGP
Abstract. Techniques for authenticating BGP protocol objects entail the inspection of additional information in the form of authentication credentials that can be used to validate ...
Geoff Huston
BROADNETS
2006
IEEE
14 years 3 months ago
Optimizing IP Multicast through Delayed Multicast Tree Pruning
This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and tra...
Yongjun Li, Wenhui Zhou, James Zijun Wang, Deyu Qi