Sciweavers

448 search results - page 45 / 90
» k-anonymous message transmission
Sort
View
EUROCRYPT
2004
Springer
15 years 3 months ago
Dining Cryptographers Revisited
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
Philippe Golle, Ari Juels
AHSWN
2008
92views more  AHSWN 2008»
14 years 10 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
CJ
2006
123views more  CJ 2006»
14 years 10 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...
IPL
1998
89views more  IPL 1998»
14 years 9 months ago
A Limitation of Vector Timestamps for Reconstructing Distributed Computations
Vector timestamps provide a way of recording the causal relationships between events in a distributed computation. We draw attention to a limitation of such timestamps when used t...
Colin J. Fidge
CORR
2007
Springer
86views Education» more  CORR 2007»
14 years 10 months ago
Variations on Information Embedding in Multiple Access and Broadcast Channels
Information embedding (IE) is the transmission of information within a host signal subject to a distortion constraint. There are two types of embedding methods, namely irreversibl...
Shivaprasad Kotagiri, J. Nicholas Laneman