A Wireless Security Framework without Shared Secrets

Authors:
Lifeng Sang;Anish Arora
Affiliations:
Department of Computer Science and Engineering, The Ohio State University, Columbus 43210;Department of Computer Science and Engineering, The Ohio State University, Columbus 43210
Venue:
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Year:
2009

Citing 7
Cited 0

Secure Broadcast Communication in Wired and Wireless Networks

Secure Broadcast Communication in Wired and Wireless Networks
Embracing wireless interference: analog network coding

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Robust location distinction using temporal link signatures

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Dialog codes for secure wireless communications

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Transient-based identification of wireless sensor nodes

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming

IEEE Transactions on Information Theory
The Wiretap Channel With Feedback: Encryption Over the Channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops a framework for wireless security that provides confidentiality, identity authentication, message authentication, integrity, sender non-repudiation, receiver non-repudiation and anonymity. Our framework is based on two physical primitives: collaborative jamming and spatial signature enforcement. Notably, it eschews the use of shared secrets, while providing a cryptosystem that is no less secure than conventional cryptosystems.