Sciweavers

977 search results - page 177 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
SASN
2006
ACM
14 years 3 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
SIGCOMM
2006
ACM
14 years 3 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
EUROCRYPT
2005
Springer
14 years 3 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
MMSEC
2004
ACM
137views Multimedia» more  MMSEC 2004»
14 years 3 months ago
Perturbed quantization steganography with wet paper codes
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
MIDDLEWARE
2004
Springer
14 years 3 months ago
PoliPer: policies for mobile and pervasive environments
The need for sharing is well known in a large number of distributed applications. These applications are difficult to develop either for fully wired or mobile wireless networks. ...
Luís Veiga, Paulo Ferreira