199 search results - page 36 / 40 » Adaptive Proofs of Knowledge in the Random Oracle Model |
101
click to vote
WDAG
2009
Springer
15 years 5 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...
ACSC
2008
IEEE
15 years 5 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...
103
click to vote
EUROCRYPT
2004
Springer
15 years 4 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)...
108
click to vote
ACISP
2006
Springer
15 years 2 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...
ICALP
2010
Springer
15 years 1 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...