子群距离问题的零知识证明

Cansu Betin Onur
{"title":"子群距离问题的零知识证明","authors":"Cansu Betin Onur","doi":"arxiv-2408.00395","DOIUrl":null,"url":null,"abstract":"In this study, we introduce a novel zero-knowledge identification scheme\nbased on the hardness of the subgroup distance problem in the Hamming metric.\nThe proposed protocol, named Subgroup Distance Zero Knowledge Proof (SDZKP),\nemploys a cryptographically secure pseudorandom number generator to mask\nsecrets and utilizes a Stern-type algorithm to ensure robust security\nproperties.","PeriodicalId":501037,"journal":{"name":"arXiv - MATH - Group Theory","volume":"8 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Zero-Knowledge Proof of Knowledge for Subgroup Distance Problem\",\"authors\":\"Cansu Betin Onur\",\"doi\":\"arxiv-2408.00395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, we introduce a novel zero-knowledge identification scheme\\nbased on the hardness of the subgroup distance problem in the Hamming metric.\\nThe proposed protocol, named Subgroup Distance Zero Knowledge Proof (SDZKP),\\nemploys a cryptographically secure pseudorandom number generator to mask\\nsecrets and utilizes a Stern-type algorithm to ensure robust security\\nproperties.\",\"PeriodicalId\":501037,\"journal\":{\"name\":\"arXiv - MATH - Group Theory\",\"volume\":\"8 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Group Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.00395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Group Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.00395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这项研究中,我们根据汉明度量中子群距离问题的难易程度,提出了一种新颖的零知识识别方案。所提出的协议被命名为子群距离零知识证明(SDZKP),它采用加密安全的伪随机数生成器来掩盖秘密,并利用斯特恩型算法来确保稳健的安全属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Zero-Knowledge Proof of Knowledge for Subgroup Distance Problem
In this study, we introduce a novel zero-knowledge identification scheme based on the hardness of the subgroup distance problem in the Hamming metric. The proposed protocol, named Subgroup Distance Zero Knowledge Proof (SDZKP), employs a cryptographically secure pseudorandom number generator to mask secrets and utilizes a Stern-type algorithm to ensure robust security properties.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Writing finite simple groups of Lie type as products of subset conjugates Membership problems in braid groups and Artin groups Commuting probability for the Sylow subgroups of a profinite group On $G$-character tables for normal subgroups On the number of exact factorization of finite Groups
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1