Sciweavers

99 search results - page 18 / 20
» An Efficient Anonymous Credential System
Sort
View
CCS
2009
ACM
14 years 2 months ago
Membership-concealing overlay networks
We introduce the concept of membership-concealing overlay networks (MCONs), which hide the real-world identities of participants. We argue that while membership concealment is ort...
Eugene Y. Vasserman, Rob Jansen, James Tyra, Nicho...
FUIN
2006
96views more  FUIN 2006»
13 years 7 months ago
A Component Coordination Model Based on Mobile Channels
In this paper we present a coordination model for component-based software systems based on the notion of mobile channels, define it in terms of a compositional trace-based semanti...
Juan Guillen Scholten, Farhad Arbab, Frank S. de B...
EUROPKI
2009
Springer
13 years 5 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
ATAL
2008
Springer
13 years 9 months ago
Undominated VCG redistribution mechanisms
Many important problems in multiagent systems can be seen as resource allocation problems. For such problems, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, in...
Mingyu Guo, Vincent Conitzer
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah