NP-completeness and physical zero-knowledge proof of Hotaru Beam

DOI10.1007/978-981-96-1090-7_20MaRDI QIDQ6970727zbMATH OpenFDO

Authors Taisei Otsuji, Peter Fulla, Takuro Fukunaga

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_20

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Interactive physical zero-knowledge proof for Norinori
• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• Optimal binary space partitions for segments in the plane
• Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The knowledge complexity of interactive proof-systems

Cited in

(1)

• Efficient AND protocols resistant to maliciously revealing a single card

This page was built for publication: NP-completeness and physical zero-knowledge proof of Hotaru Beam

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970727)