Sciweavers

211 search results - page 16 / 43
» A Message Recognition Protocol Based on Standard Assumptions
Sort
View
ADHOC
2005
100views more  ADHOC 2005»
13 years 7 months ago
Robust position-based routing for wireless ad hoc networks
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li
CCS
2009
ACM
14 years 2 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
ESORICS
2008
Springer
13 years 9 months ago
A Distributed Implementation of the Certified Information Access Service
In this paper we consider the problem of securely outsourcing computation on private data. We present a protocol for securely distributing the computation of the data structures u...
Carlo Blundo, Emiliano De Cristofaro, Aniello Del ...
NIPS
2001
13 years 9 months ago
A Sequence Kernel and its Application to Speaker Recognition
A novel approach for comparing sequences of observations using an explicit-expansion kernel is demonstrated. The kernel is derived using the assumption of the independence of the ...
W. M. Campbell
TIT
2008
164views more  TIT 2008»
13 years 7 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung