2601 search results - page 440 / 521 » Secure Rewarding Schemes |
107
click to vote
ASIACRYPT
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Recently, Bellare and Palacio succeeded in defining the plaintext awareness, which is also called PA2, in the standard model. They propose three valiants of the standard ...
129
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
124
click to vote
FC
2006
Springer
15 years 6 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
114
click to vote
EUROCRYPT
2000
Springer
15 years 6 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
125
click to vote
CARDIS
2010
Springer
15 years 6 months ago
2010
Springer
This paper establishes a novel model for RFID schemes where readers are not continuously connected to the back office, but only periodically. Furthermore, adversaries are not only ...