Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.00395 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917738573725696 |
|---|---|
| author | Onur, Cansu Betin |
| author_facet | Onur, Cansu Betin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_00395 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Zero-Knowledge Proof of Knowledge for Subgroup Distance Problem Onur, Cansu Betin Cryptography and Security Group Theory 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. |
| title | A Zero-Knowledge Proof of Knowledge for Subgroup Distance Problem |
| topic | Cryptography and Security Group Theory |
| url | https://arxiv.org/abs/2408.00395 |