2237 search results - page 200 / 448 » On the Security of Random Sources |
190
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
179
click to vote
ICMCS
2006
IEEE
16 years 1 months ago
2006
IEEE
A lightweight encryption technique for JPEG2000 with optional support for transparent encryption is proposed. Randomized anisotropic wavelet packet bases are used to construct a s...
159
click to vote
CANS
2008
Springer
15 years 9 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
159
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
The aim of this paper is to advocate a new software-oriented hash function family based on the HAIFA framework of Biham and Dunkelman, inheriting built-in randomized hashing and hi...
238
click to vote
SASN
2003
ACM
16 years 9 days ago
2003
ACM
In this paper we address the problem of secure multicast of data streams over a multihop wireless ad hoc network. We propose a dynamic multicast group management protocol that aim...