Sciweavers

96 search results - page 6 / 20
» Revealing Additional Information in Two-Party Computations
Sort
View
ICDCSW
2005
IEEE
14 years 1 months ago
A Topologically-Aware Worm Propagation Model for Wireless Sensor Networks
Internet worms have repeatedly revealed the susceptibility of network hosts to malicious intrusions. Recent studies have proposed to employ the underlying principles of worm propa...
Syed A. Khayam, Hayder Radha
SIGGRAPH
2010
ACM
13 years 12 months ago
Video tapestries with continuous temporal zoom
We present a novel approach for summarizing video in the form of a multiscale image that is continuous in both the spatial domain and across the scale dimension: There are no hard...
Connelly Barnes, Dan B. Goldman, Eli Shechtman, Ad...
FC
2009
Springer
118views Cryptology» more  FC 2009»
14 years 2 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
MMMACNS
2005
Springer
14 years 28 days ago
Unique User-Generated Digital Pseudonyms
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
Peter Schartner, Martin Schaffer
FC
2006
Springer
109views Cryptology» more  FC 2006»
13 years 11 months ago
A Private Stable Matching Algorithm
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
Philippe Golle