198 search results - page 4 / 40 » Weak Probabilistic Anonymity |
99
Voted
IJNSEC
2008
15 years 22 days ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
122
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
114
Voted
CSE
2009
IEEE
14 years 10 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
110
Voted
PERCOM
2005
ACM
16 years 10 days ago
2005
ACM
In a set of distributed wireless networks, such as globally distributed cellular systems, different networks could be administered by different operators. Mobile devices subscribe...
116
Voted
COMPSEC
2006
15 years 23 days ago
2006
Anonymity is a desirable security feature in addition to providing user identification and key agreement during a user's login process. Recently, Yang et al., proposed an eff...