Efficient Amplification of the Security of weak Pseudrandom 对弱伪随机安全有效的扩增.pptVIP

下载本文档

4
0
约6.19千字
约 17页
2018-06-19 发布于福建
举报
版权申诉

Efficient Amplification of the Security of weak Pseudrandom 对弱伪随机安全有效的扩增.ppt

1、本文档共17页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Efficient Amplification of the Security of weak Pseudrandom 对弱伪随机安全有效的扩增

Efficient Amplification of the Security of weak Pseudo-random Function Generators Author: Steven Myers Speaker: Bo-Yuan Peng Outline Motivation What Is a Pseudo-Random Function Generator? Diamond Operator Strong PRFG Construction Scheme Proof of Strong PRFG Construction Conclusion Motivation It was known that a partially secure PRPG implied a totally secure PRPG. The construction scheme is as the following scheme, although not efficient. Motivation (contd) Here a natural, efficient and parallelizable construction for generating a PRFG from a partially secure PRFG is given. if is a partially secure pseudo-random function generator, then the constructionis a strongly secure pseudo-random function generator, where s are randomly chosen from , and s are randomly chosen from . What Is a Pseudo-Random Function Generator? Function GeneratorsWe call a function generator, and that is a key of . We write as . Function Generator EnsemblesLet and be polynomials, and let . For each , let be a function generator. We call a function generator ensemble. What Is a Pseudo-Random Function Generator? (contd) -Distinguishing AdversaryLet be a function, and let and be two sequence of distributions over oracle gates, where is a distribution over oracle gates of input size , for .We say the circuit family is an adversary capable of distinguishing from if for some polynomial and infinitely many , What Is a Pseudo-Random Function Generator? (contd) Pseudo-Random Function Generator Ensembles:Consider , the set of all functions for some ;and