- 1、本文档共67页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
* ZWXF—Setup Let G1 be a cyclic additive group generated by P, whose order is a prime q, and G2 be a cyclic multiplicative group of the same order q. ê :G1×G1→G2 is a bilinear map. Define two hash function H1,H2, H3:{0,1}*→G1* 。 KGC chooses a master secret key s∈Zq* randomly and computes Ppub=sP。 KGC publishes system parameters {G1, G2, q, ê, P, Ppub, H1, H2,H3} and keeps the master key s secret。 ZWXF—Partial-Private-Key-Extract Given an identity ID , the KGC computes the corresponding private key SID=sQID and sends it to its owner in a secure way. Here QID =H1 (ID). Set-Secret-Value: user chooses a random number xID ∈Zq* Set-Private-Key:DID=(xID, SID) Set-Public-Key:PKID=xIDP Sign: Choose a random number r ∈Zq* Compute U=rP V= SID +rH2(m, ID,PKID,U)+x H3(m, ID,PKID) The signature of m is (U,V) Verify: ê(V, P)=ê(QID, Ppub) ê(U, H2(m, ID,PKID,U)) ê(PKID, H3(m, ID,PKID)) 人有了知识,就会具备各种分析能力, 明辨是非的能力。 所以我们要勤恳读书,广泛阅读, 古人说“书中自有黄金屋。 ”通过阅读科技书籍,我们能丰富知识, 培养逻辑思维能力; 通过阅读文学作品,我们能提高文学鉴赏水平, 培养文学情趣; 通过阅读报刊,我们能增长见识,扩大自己的知识面。 有许多书籍还能培养我们的道德情操, 给我们巨大的精神力量, 鼓舞我们前进。 Syntax for identity-based encryption Identity-Based Encryption Setup Extract Encrypt Decrypt A sender does not need to look up the recipient’s public key before sending out an encrypted message. The encryption steps PKG s Alice Bob Ppub m C IDBob skBob m Identity-based encryption-BF scheme It was proposed by Boneh and Franklin in Crypto 2001. It uses bilinear maps over supersingular elliptic curves. Let G1 be a cyclic additive group generated by P, whose order is a prime q, and G2 be a cyclic multiplicative group of the same order q. A bilinear pairing is a map ê :G1×G1→G2 with the following properties: Bilinearity: ê (aP, bQ)= ê (P,Q)ab for all P, Q∈G1, and a,b∈ Zq*. Non-degeneracy: There exists P and Q in G1 such that ê(P,Q) ≠1. Computability: There is an efficient algorithm to compute ê(P,Q) for all P,Q in G1. BF scheme—Setup Let G1 be a cyclic additive group generated by P, whose order is a pr
文档评论(0)