Robust random number generation for peer-to-peer systems
Theoretical Computer Science
Semantic object watermark re-synchronization based on skeleton vertex corresponds
Proceedings of the 2nd ACM workshop on Multimedia in forensics, security and intelligence
Sponge-based pseudo-random number generators
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Software protection through dynamic code mutation
WISA'05 Proceedings of the 6th international conference on Information Security Applications
| Hi-index | 0.00 |
There is a large gap between the theory and practicefor random number generation. For example, on mostoperating systems, using /dev/random to generate a256-bit AES key is highly likely to produce a key withno more than 160 bits of security. In this paper, wepropose solutions to many of the issues that realsoftware-based random number infrastructures haveencountered. Particularly, we demonstrate thatuniversal hash functions are a theoretically appealingand efficient mechanism for accumulating entropy, weshow how to deal with forking processes withoutusing a two-phase commit, we explore better metricsfor estimating entropy and argue that systems shouldprovide both computational security and informationtheoretic security through separate interfaces.