199 search results - page 36 / 40 » Adaptive Proofs of Knowledge in the Random Oracle Model |
149
Voted
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
131
Voted
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
147
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
157
Voted
ACISP
2006
Springer
15 years 7 months ago
2006
Springer
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...
133
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...