Sciweavers

12 search results - page 1 / 3
» Anonymity in shared symmetric key primitives
Sort
View
DCC
2010
IEEE
13 years 3 months ago
Anonymity in shared symmetric key primitives
We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this level of anonymity. A new schem...
Gregory M. Zaverucha, Douglas R. Stinson
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 4 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ADHOCNOW
2010
Springer
13 years 5 months ago
Data Aggregation Integrity Based on Homomorphic Primitives in Sensor Networks
Designing message integrity schemes for data aggregation is an imperative problem for securing wireless sensor networks. In this paper, we propose three secure aggregation schemes ...
Zhijun Li, Guang Gong
CCS
2008
ACM
13 years 5 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
SP
2003
IEEE
155views Security Privacy» more  SP 2003»
13 years 9 months ago
Mixminion: Design of a Type III Anonymous Remailer Protocol
We present Mixminion, a message-based anonymous remailer protocol with secure single-use reply blocks. Mix nodes cannot distinguish Mixminion forward messages from reply messages,...
George Danezis, Roger Dingledine, Nick Mathewson