Background: Alice and Bob collect N wireless channel measurements, quantize secret bits out of them, correct for errors and perform privacy amplification to reduce the eavesdropper information to arrive at the final key.
Question: Is there a wireless key agreement technique/protocol like described above, which is provably secure for a finite N?
Yes, Aggregate Signature based Authentication Protocol is useful in such scenarios. Because aggregate signature can be checked by batch verification instead of one-by-one verification. So, download some papers on aggregate signature based authentication to secure all kinds of nodes from any attack, then other task can easily be done. You have to secure your nodes first by using a robust protocol for authenticity, integrity and confidentiality.
- Badges
- Science topic
- Similar topics
- Biological Science
- Microbiology
- Virology
- Virus