作者: Huafei Zhu , Wee-Siong Ng , See-Kiong Ng
DOI: 10.1007/978-3-642-39218-4_11
关键词: Pseudorandom generator 、 Entropy (information theory) 、 Stateless protocol 、 Provable security 、 Theoretical computer science 、 Pseudorandom number generator 、 Computer science 、 Cryptography 、 Computer security model 、 Randomness extractor
摘要: Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or controls generators’ entropy resources. The BH scheme is constructed from Barak, Shaltiel Tromer’s randomness extractor its security formalized simulation-based framework. model however, does not address scenario where attacker completely resources no internal state. Namely, consider bad-refresh conditioned on compromised = false. such a case interesting since if output protocol false looks random to attacker, then secure even (recall model). called sustainable above mentioned requirement guaranteed. This paper studies sustainability generator makes following two contributions: first fold, new notion which we call extends definition BH’s introduced simulation paradigm; second show achieves under joint assumptions underlying stateless function G cryptographic number extract() statistically close uniform distribution.