Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Citation data:
Theoretical Computer Science, ISSN: 0304-3975, Vol: 660, Page: 23-56
- Publication Year:
- Mathematics; Computer Science
We construct new leakage-resilient signature schemes. Our schemes remain unforgeable against an adversary leaking arbitrary (yet bounded) information on the entire state of the signer (sometimes known as fully leakage resilience), including the random coin tosses of the signing algorithm.