pith. sign in

arxiv: 0905.2977 · v1 · submitted 2009-05-18 · 💻 cs.CR · quant-ph

Cryptography for Multi-Located Parties

classification 💻 cs.CR quant-ph
keywords multi-locatedpartiescryptographyeasiermakeaddressattackcoding
0
0 comments X
read the original abstract

This note describes some cryptographic issues related to multi-located parties. In general, multi-located parties make it difficult for the eavesdropper to mount the man-in-the-middle attack. Conversely, they make it easier to address problems such as joint encryption and error correction coding. It is easier to implement the three-stage quantum cryptography protocol.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.