On Ideal Lattices and Learning With Errors Over Rings关于理想格与环上误差的学习.pptVIP

下载本文档

42
0
约1.44万字
约 46页
2017-03-08 发布于上海
举报
版权申诉

On Ideal Lattices and Learning With Errors Over Rings关于理想格与环上误差的学习.ppt

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

On Ideal Lattices and Learning With Errors Over Rings关于理想格与环上误差的学习

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Simple Cryptosystem Public Key Encryption Based on LWE A s + e = b Secret Key: s in ?qn Public Key: A in ?qm?n , b=As+e (where m=2n·logq) r A r b To encrypt a single bit z?{0,1}: Pick r in {0,1}m and send (rA, r·b+z·q/2) + 0 q/2 , Proof of Semantic Security A s + e = b r A r b + A b 1. The public key is pseudo-random: based on LWE A b r 2. If A,b is truly random, then the distribution of (rA, r·b) (over r chosen from {0,1}m) is statistically extremely close to uniform so decryption is impossible z Other Applications Public Key Encryption [R05, KawachiTanakaXagawa07, PeikertVaikuntanathanWaters08] CCA-Secure PKE [PeikertWaters08, Peikert09] Identity-Based Encryption [GentryPeikertVaikuntanathan08] Oblivious Transfer [PeikertVaikuntanathanWaters08] Circular-Secure Encryption [ApplebaumCashPeikertSahai09] Leakage Resilient Encryption [AkaviaGoldwasserVaikunathan09, DodisGoldwasserKalaiPeikertVaikuntanathan10, GoldwasserKalaiPeikertVaikuntanathan10] Hierarchical Identity-Based Encryption [CashHofheinzKiltzPeikert09, AgrawalBonehBoyen09] Learning Theory [KlivansSherstov06] And more… Hardness Hardness The best known algorithms run in exponential time Even quantum algorithms don’t do any better LWE is an extension of LPN, a central problem in learning theory and coding theory (decoding from random linear codes) Hardness More importantly, LWE is as hard as worst-case lattice problems [R05, Peikert09] More precisely, For q=2O(n), as hard as GapSVP [Peikert09] For q=poly(n), As hard as GapSVP given a somewhat short basis [Peikert09] As hard as GapSVP and SIVP using a quantum reduction [R05] The SIS problem The “Small Integer Solution” problem is a ‘dual’ problem to LWE: Given a1,a2,… uniformly chosen from ?qn , find a subset of them that sums to zero SIS is used for ‘minicrypt’ constructions, such as: One-way functions [Ajtai96] Collision resistant hash functions [GoldreichGoldwasserHalevi96] Di