shorter quasi-adaptive nizk proofs for linear subspaces.pptVIP

下载本文档

7
0
约 22页
2016-03-05 发布于广东
举报
版权申诉

shorter quasi-adaptive nizk proofs for linear subspaces.ppt

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

shorter quasi-adaptive nizk proofs for linear subspaces

El-Gamal Encryption El-Gamal Encryption Novel Quasi-Adaptive NIZK Can the CRS depend on defining matrix, i.e. g, f, a ? Yes, g, f, a are defined by a trusted party, who can also set CRS for NIZK depending on g, f, a Problem: g, f, a are not constant, but are chosen according to some distribution. The hardness of DDH (hence encryption security) depends on this choice. Novel Quasi-Adaptive NIZK Can the CRS depend on defining matrix or g, f, a ? Yes, g, f, a are defined by a trusted party, who can also set CRS for NIZK depending on g, f, a Problem: g, f, a are not constant, but are chosen according to some distribution. The hardness of DDH (hence encryption security) depends on this choice. CRS can depend on defining matrix, but CRS-gen must be a single efficient machine for the distribution of defining matrix. Most applications can use this notion. * Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces Charanjit Jutla, IBM Watson and Arnab Roy, Fujitsu Labs of America a ? g , x ? g , x · a ? g ≈ a ? g , x ? g , x ′ · a ? g (DDH) a ? g , x ? g , x · a ? g ≈ a ? g , x ? g , (c ? f + x · a ? g) c ? g , f c ? g , f (El-Gamal Encryption of c ? f) a, x, c :: a = a ? g , ? = x ? g , ? = c ? g , ? = c ? f + x · a ? g x, c :: ? = x ? g , ? = c ? g , ? = c ? f + x ? a ? x, c :: (?, ?, ?) = ? a ? ? Novel Quasi-Adaptive NIZK Public Parameters: g, a, f ??? D and CRS ? CRS-gen(g, a, f ) Honest Party: Choose x, c at random, generate ?, ?, ? and proof π ?? Adv (Need to hide x, c from Adv.) Replace π with simulated proof π‘ So, x and c no more needed in proof gen. a ? g , x ? g , (c ? f + x · a ? g) ≈ a ? g , x ? g , x · a ? g c ? g , f c ? g , f CRS-gen better be a polynomial time Turing Machine. 4. c ? f not ne