Sciweavers

230 search results - page 14 / 46
» On Anonymity with Identity Escrow
Sort
View
ACISP
2007
Springer
14 years 2 months ago
A Practical System for Globally Revoking the Unlinkable Pseudonyms of Unknown Users
We propose the first single sign-on system in which a user can access services using unlinkable digital pseudonyms that can all be revoked in case she abuses any one service. Our ...
Stefan Brands, Liesje Demuynck, Bart De Decker
ISCI
2008
160views more  ISCI 2008»
13 years 8 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
INFOCOM
2007
IEEE
14 years 2 months ago
Mutual Anonymous Communications: A New Covert Channel Based on Splitting Tree MAC
—Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver’s knowledge of the sender’s identity. In this paper we pres...
Zhenghong Wang, Jing Deng, Ruby B. Lee
WDAG
2004
Springer
103views Algorithms» more  WDAG 2004»
14 years 1 months ago
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...
James Aspnes, Faith Ellen Fich, Eric Ruppert
ENTCS
2007
89views more  ENTCS 2007»
13 years 7 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang