Efficient IdentityBased Encryption Without Random Oracles高效的基于身份的加密无随机预言机.pptVIP

下载本文档

37
0
约4.03千字
约 18页
2017-02-13 发布于上海
举报
版权申诉

Efficient IdentityBased Encryption Without Random Oracles高效的基于身份的加密无随机预言机.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文档。上传文档

Efficient IdentityBased Encryption Without Random Oracles高效的基于身份的加密无随机预言机

Efficient Identity-BasedEncryption Without Random Oracles Brent Waters Stanford Universtiy Identity-Based Encryption (IBE) IBE: Public key encryption scheme where public key is an arbitrary string (ID). Examples: user’s e-mail address, current-date, … Brief History of IBE Shamir ’84 Challenged community with IBE concept BF’01 Pairing-based cryptography Proof uses Random Oracles CHK’03 Introduced weaker “Selective-ID” model Proof without Random Oracles Ciphertext element per bit of identity Brief History of IBE BB’04 Eurocrypt Efficient system in Selective-ID model BB’04 (Crypto) Proof in full model w/o Random Oracles Not practical system This work Practical system with proof in full model w/o Random Oracles Mathematically similar to BB’04 (Eurocrypt) IBE System Setup Generate public parameters Key Gen Generate a private key Encrypt Encrypt message M for given identity, ID Decrypt Decrypt a ciphertext if have private key for identity IBE Semantic Security Bilinear Maps Complexity Assumption Our Scheme Setup Key Gen(v) Encrypt(v,M) Decrypt(d,C=C0,C1,C2) Comparison to BB’04 Setup Key Gen(v) Encrypt(v,M) Decrypt(d,C=C0,C1,C2) Comparison to BB’04 Setup Key Gen(v) Encrypt(v,M) Decrypt(d,C=C0,C1,C2) Proof Idea Commit to parameters Identities can either generate keys for them or use as a challenge Bounding abort probability Limit dependencies “Bob” in Private Key set = “Alice” in Private Key Set Pairwise independence is enough If v and v’ differ in at least 1 bit u’?i 2 Vui and u’?i 2 V’ui differ in at least one element Pr[not abort] 1/(8(n+1)q) q- is max # of queries Signature Scheme Transformation from IBE scheme into signature scheme (IBE keys =sigs) Efficient signature scheme relies on Computational-DH assumption ..., but has somewhat large public key Conclusions + Open Problems Presented fully secure and efficient IBE scheme in standard model Can we reduce public parameter size? Get tight bounds? Proof Idea Proof Idea x’+?i