Cryptography for Multi-Located Parties
Subhash Kak

TL;DR
This paper discusses cryptographic challenges and advantages of multi-located parties, highlighting how they complicate eavesdropping but facilitate joint encryption, error correction, and quantum cryptography protocols.
Contribution
It provides an analysis of cryptographic issues specific to multi-located parties, emphasizing practical implementation benefits for quantum cryptography.
Findings
Multi-located parties hinder man-in-the-middle attacks.
They simplify joint encryption and error correction.
Implementation of three-stage quantum cryptography is easier.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Cryptographic Implementations and Security
