五张牌和协议在承诺格式只使用实际洗牌

Yuta Abe, Y. Hayashi, T. Mizuki, H. Sone
{"title":"五张牌和协议在承诺格式只使用实际洗牌","authors":"Yuta Abe, Y. Hayashi, T. Mizuki, H. Sone","doi":"10.1145/3197507.3197510","DOIUrl":null,"url":null,"abstract":"In card-based cryptography, designing AND protocols in committed format is a major topic of research. The state-of-the-art AND protocol proposed by Koch, Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. Their protocol»s minimality relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to \"practical»» ones, namely uniform closed shuffles, to our knowledge, six cards are sufficient: The six-card AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: Can we improve upon this six-card protocol using only practical shuffles? In other words, whether there exists a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing a five-card committed-format AND protocol using only practical shuffles. The shuffles that our protocol uses are random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.","PeriodicalId":170582,"journal":{"name":"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop","volume":"259 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Five-Card AND Protocol in Committed Format Using Only Practical Shuffles\",\"authors\":\"Yuta Abe, Y. Hayashi, T. Mizuki, H. Sone\",\"doi\":\"10.1145/3197507.3197510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In card-based cryptography, designing AND protocols in committed format is a major topic of research. The state-of-the-art AND protocol proposed by Koch, Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. Their protocol»s minimality relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to \\\"practical»» ones, namely uniform closed shuffles, to our knowledge, six cards are sufficient: The six-card AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: Can we improve upon this six-card protocol using only practical shuffles? In other words, whether there exists a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing a five-card committed-format AND protocol using only practical shuffles. The shuffles that our protocol uses are random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.\",\"PeriodicalId\":170582,\"journal\":{\"name\":\"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop\",\"volume\":\"259 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3197507.3197510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3197507.3197510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

在基于卡片的密码学中,设计已提交格式的AND协议是一个重要的研究课题。由Koch, Walzer和Härtel在ASIACRYPT 2015中提出的最先进的AND协议仅使用四张卡,这是允许的最小数量。他们的协议的最小性依赖于一些复杂的洗牌,这些洗牌具有可能结果的非均匀概率。将允许的洗牌限制在“实用”的洗牌上,即均匀封闭的洗牌,据我们所知,六张牌就足够了:Mizuki和Sone在2009年提出的六张牌AND协议使用了随机等分切法,这是一种均匀循环的洗牌(因此是封闭的)。因此,一个问题出现了:我们能否只用实际的洗牌来改进这个六张牌的协议?换句话说,是否存在仅使用均匀闭合洗牌的已提交格式的五牌与协议一直是该领域中最重要的未决问题之一。在本文中,我们通过设计一个仅使用实际洗牌的五张牌提交格式和协议来肯定地回答这个问题。我们的协议使用的洗牌是随机切割和随机平分切割,这两种洗牌都是均匀的循环洗牌,可以很容易地由人类实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Five-Card AND Protocol in Committed Format Using Only Practical Shuffles
In card-based cryptography, designing AND protocols in committed format is a major topic of research. The state-of-the-art AND protocol proposed by Koch, Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. Their protocol»s minimality relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to "practical»» ones, namely uniform closed shuffles, to our knowledge, six cards are sufficient: The six-card AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: Can we improve upon this six-card protocol using only practical shuffles? In other words, whether there exists a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing a five-card committed-format AND protocol using only practical shuffles. The shuffles that our protocol uses are random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信