Sciweavers

5891 search results - page 383 / 1179
» On the Computational Security of a Distributed Key Distribut...
Sort
View
DCOSS
2006
Springer
15 years 10 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
151
Voted
TIFS
2008
109views more  TIFS 2008»
15 years 6 months ago
Lookup-Table-Based Secure Client-Side Embedding for Spread-Spectrum Watermarks
Today, mass-scale electronic content distribution systems embed forensic tracking watermarks primarily at the distribution server. For limiting the bandwidth usage and server compl...
Mehmet Utku Celik, Aweke N. Lemma, Stefan Katzenbe...
183
Voted
CCS
2009
ACM
16 years 1 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
CHI
2007
ACM
16 years 7 months ago
AwareLESS authentication: insensible input based authentication
To increase the security of handheld devices, we propose awareLESS authentication. Since insensible input prevents the leakage of the key information, it can provide more secure a...
Hiroyuki Manabe, Masaaki Fukumoto
JCS
2011
126views more  JCS 2011»
15 years 1 months ago
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
One of the main challenges in pervasive computing is how we can establish secure communication over an untrusted high-bandwidth network without any initial knowledge or a Public K...
L. H. Nguyen, A. W. Roscoe