2601 search results - page 78 / 521 » Secure Rewarding Schemes |
102
click to vote
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper describes a counter scheme that uses hash functions to count how many times the user is allowed to play protected content in a DRM-enabled player. The proposed basic sc...
115
click to vote
CN
2004
15 years 2 months ago
2004
Securing ad hoc networks in a fully self-organized way is effective and light-weight, but fails to accomplish trust initialization in many trust deficient scenarios. To overcome t...
SACRYPT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
124
click to vote
TCC
2005
Springer
15 years 8 months ago
2005
Springer
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret...
132
click to vote
ASIACRYPT
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...