Cryptographic Applications of Pseudo-Telepathy Games
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Proceedings |
| Conference | MEMICS 2009: Fifth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | Pseudo-telepathy games; cryptography; user identification |
| Description | Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. After introducing a model for pseudo-telepathy games, we investigate their possible cryptographic applications. A simple user identification protocol based on playing some pseudo-telepathy game by the players is proposed and its security properties are analyzed. |
| Related projects: |