Zero-Knowledge Proofs of the Conjugacy for Permutation Groups
| dc.creator | Verbitsky, Oleg | |
| dc.date | 2008-01-31 | |
| dc.date.accessioned | 2026-07-07T08:57:32Z | |
| dc.date.available | 2026-07-07T08:57:32Z | |
| dc.description | We design a perfect zero-knowledge proof system for recognition if two permutation groups are conjugate. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/0801.4917 | |
| dc.identifier | http://arxiv.org/abs/0801.4917 | |
| dc.identifier | Bulletin of the Lviv University, Series in Mechanics and Mathematics. Vol. 61, pp. 195--205 (2003) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/147005 | |
| dc.subject | Computational Complexity | |
| dc.title | Zero-Knowledge Proofs of the Conjugacy for Permutation Groups | |
| dc.type | text |