Computational alternatives to random number generators

We present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). In opposition to all past state-machine models, we assume that the signer is a memoryless automaton that starts from some internal state, receives a message, outputs its signature and returns precisely to the same initial state; therefore, the new technique formally converts randomized signatures into deterministic ones. Finally, we show how to translate the random oracle concept required in security proofs into a realistic set of tamper-resistance assumptions

Published in:
Selected Areas in Cryptography '98, SAC'98, 1556, 72-80
Presented at:
Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998

 Record created 2007-01-18, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)