12 search results - page 1 / 3 » Anonymity in shared symmetric key primitives |
DCC
2010
IEEE
13 years 11 months ago
2010
IEEE
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...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
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...
ADHOCNOW
2010
Springer
14 years 11 days ago
2010
Springer
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 ...
CCS
2008
ACM
14 years 27 days ago
2008
ACM
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...
SP
2003
IEEE
14 years 4 months ago
2003
IEEE
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,...