Robust Key Agreement Schemes
Terence Chan, Ning Cai, Alex Grant

TL;DR
This paper studies a key agreement problem where two parties aim to establish a shared key despite adversarial message tampering, providing coding schemes and bounds on key generation rates without secrecy constraints.
Contribution
It introduces new coding schemes and bounds specifically designed for adversarial tampering scenarios in key agreement without secrecy requirements.
Findings
Proposed coding schemes achieve higher key rates under adversarial conditions.
Derived bounds define the maximum achievable key rates in tampering scenarios.
Showed the effectiveness of schemes through theoretical analysis.
Abstract
This paper considers a key agreement problem in which two parties aim to agree on a key by exchanging messages in the presence of adversarial tampering. The aim of the adversary is to disrupt the key agreement process, but there are no secrecy constraints (i.e. we do not insist that the key is kept secret from the adversary). The main results of the paper are coding schemes and bounds on maximum key generation rates for this problem.
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
TopicsSecurity in Wireless Sensor Networks · Chaos-based Image/Signal Encryption · Cryptographic Implementations and Security
