Oblivious Transfer based on the McEliece Assumptions不经意传输基于McEliece假设.pptVIP

下载本文档

11
0
约5.94千字
约 37页
2017-03-08 发布于上海
举报
版权申诉

Oblivious Transfer based on the McEliece Assumptions不经意传输基于McEliece假设.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文档。上传文档

Oblivious Transfer based on the McEliece Assumptions不经意传输基于McEliece假设

An Active Attack Given Q can one find P and P‘ with Q = P?P‘such that both have reasonable error correcting properties? We could not exclude this... Bob could be able to obtain both... An Actively Secure Protocol We perform the protocol twice (with random inputs): Bob commits to G, and in one of the protocols Alice will ask Bob to unveil and check if he cheated. The cheating probability for Bob is 50%, but this can be made arbitrarily small by repetition... More efficient than Goldreich‘s compiler. Interactive Hashing We want Bob to send two matrices to Alice one he can decode efficiently and one which is random. Interactive hashing could yield a more efficient solution... We have a different reduction to a protocol secure against active cheaters based on BR Commitments (a generalized version). Yields committed oblivious transfer! Conclusions OT based on McElice Cryptosystem Secure against quantum computers (?) Maybe an application for interactive hashing. * Oblivious Transferbased on the McEliece Assumptions Rafael Dowsley Jeroen van der Graaf J?rn Müller-Quade Anderson C. A. Nascimento University of Brasilia Encryption Decryption Plaintext Ciphertext Plaintext Key Key However, there are other (more challenging) tasks to be dealt with in cryptology… Secure Multi (Two)-Party Computations. They want to know if there exists mutual interest between them. However, they do not want to reveal an uncorresponded love. F(X,Y)= X AND Y X AND Y=1 ? I love you X AND Y=0 ? Get away! The players must learn the answer but should get no extra knowledge on each other’s input, besides what can be computed from his/her input and the output itself. The Millionaires Problem Two millionaires want to know who is the richest one between them. However, they are not willing to reveal the amount of their wealth. Secure Two Party Computations Bob X Y F(X,Y) Alice should know nothing about F(X,Y) besides what can be computed from X. Bob should know nothing about X besides what