2601 search results - page 66 / 521 » Secure Rewarding Schemes |
IWANN
1999
Springer
15 years 4 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
PROVSEC
2009
Springer
15 years 6 months ago
2009
Springer
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
117
click to vote
ISPEC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control ...
ACISP
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we propose the first identity-based chameleon hash scheme without key exposure, which gives a positive answer for the open problem introduced by Ateniese and de Mede...
AFRICACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Public-key encryption schemes are a useful and interesting field of cryptographic study. The ultimate goal for the cryptographer in the field of public-key encryption would be th...