2601 search results - page 386 / 521 » Secure Rewarding Schemes |
CRYPTO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
153
click to vote
PKC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
119
click to vote
PKC
2004
Springer
15 years 8 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
135
Voted
CRYPTO
1997
Springer
15 years 7 months ago
1997
Springer
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
129
click to vote
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. While sensor networks have recently emerged as a promising computing model, they are vulnerable to various node compromising attacks. In this paper, we propose COOL, a CO...