Can Alice and Bob be random: a study on human playing zero knowledge protocols
| dc.creator | Kulesza, Kamil | |
| dc.date | 2007-08-23 | |
| dc.date.accessioned | 2026-07-07T08:25:16Z | |
| dc.date.available | 2026-07-07T08:25:16Z | |
| dc.description | The research described in this abstract was initiated by discussions between the author and Giovanni Di Crescenzo in Barcelona in early 2004. It was during Advanced Course on Contemporary Cryptology that Di Crescenzo gave a course on zero knowledge protocols (ZKP), see [1]. After that course we started to play with unorthodox ideas for breaking ZKP, especially one based on graph 3-coloring. It was chosen for investigation because it is being considered as a "benchmark" ZKP, see [2], [3]. At this point we briefly recall such a protocol's description. | |
| dc.description | An extended abstract of the paper submitted for publication, 3 pages total | |
| dc.identifier | https://arxiv.org/abs/0708.3230 | |
| dc.identifier | http://arxiv.org/abs/0708.3230 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/136603 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Computers and Society | |
| dc.subject | D.4.6 | |
| dc.title | Can Alice and Bob be random: a study on human playing zero knowledge protocols | |
| dc.type | text |