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

arXiv - MATH - Group Theory Pub Date : 2024-08-01 DOI:arxiv-2408.00395

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":null,"pages":null},"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\":null,\"pages\":null},\"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），它采用加密安全的伪随机数生成器来掩盖秘密，并利用斯特恩型算法来确保稳健的安全属性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - MATH - Group Theory

自引率

0.00%

发文量