摘要

Currently, leakage resilient cryptography is very hot in the cryptography research. A leakage-resilient cryptographic primitive is said to be secure, if arbitrary but bounded information about the signer's secret key (involve other secret states) is leaked to an adversary. The standard security notion for digital signature schemes is unforgebility under chosen message attacks. Leakage-resilient signature strengthens the standard security notion by giving the adversary the additional power to learn a bounded amount of arbitrary information about the signer's secret key during every signature generation. The main result of this paper is a construction of a new leakage-resilient signature scheme from division intractability of hash function in the bounded retrieval model. Our scheme can be proved secure under division intractability of hash function.

全文