Sciweavers

208 search results - page 3 / 42
» Computing Anonymously with Arbitrary Knowledge
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Zhenyu Xu, Pradip K. Srimani
DSN
2009
IEEE
14 years 2 months ago
On the effectiveness of low latency anonymous network in the presence of timing attack
In this paper, we introduce a novel metric that can quantitatively measure the practical effectiveness (i.e. anonymity) of all anonymous networks in the presence of timing attack....
Jing Jin, Xinyuan Wang
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Randomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...
SIGMOD
2005
ACM
123views Database» more  SIGMOD 2005»
14 years 1 months ago
To Do or Not To Do: The Dilemma of Disclosing Anonymized Data
Decision makers of companies often face the dilemma of whether to release data for knowledge discovery, vis a vis the risk of disclosing proprietary or sensitive information. Whil...
Laks V. S. Lakshmanan, Raymond T. Ng, Ganesh Rames...
FIDJI
2004
Springer
14 years 1 months ago
Coordinated Anonymous Peer-to-Peer Connections with MoCha
Abstract. MoCha is an exogenous coordination middleware for distributed communication based on mobile channels. Channels allow anonymous, and point-to-point communication among nod...
Juan Guillen Scholten, Farhad Arbab