NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910037633400832 |
|---|---|
| author | Otsuji, Taisei Fulla, Peter Fukunaga, Takuro |
| author_facet | Otsuji, Taisei Fulla, Peter Fukunaga, Takuro |
| contents | Hotaru Beam is a logic puzzle which objective is to connect circles placed on a grid by drawing only lines with specified starting points and numbers of bends. A zero-knowledge proof is a communication protocol that allows one player to persuade the other that they are in possession of a certain piece of information without actually revealing it. We show that Hotaru Beam is NP-complete and present a physical zero-knowledge proof (i.e. implementable using physical items) for proving that one knows a solution to the puzzle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_01393 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam Otsuji, Taisei Fulla, Peter Fukunaga, Takuro Computational Complexity Cryptography and Security Hotaru Beam is a logic puzzle which objective is to connect circles placed on a grid by drawing only lines with specified starting points and numbers of bends. A zero-knowledge proof is a communication protocol that allows one player to persuade the other that they are in possession of a certain piece of information without actually revealing it. We show that Hotaru Beam is NP-complete and present a physical zero-knowledge proof (i.e. implementable using physical items) for proving that one knows a solution to the puzzle. |
| title | NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam |
| topic | Computational Complexity Cryptography and Security |
| url | https://arxiv.org/abs/2603.01393 |