Secure communications with an asymptotic secrecy model
Knowledge-Based Systems
Radio-telepathy: extracting a secret key from an unauthenticated wireless channel
Proceedings of the 14th ACM international conference on Mobile computing and networking
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Secret sharing over fast-fading MIMO wiretap channels
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
The candidate key protocol for generating secret shared keys from similar sensor data streams
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Information-theoretically secret key generation for fading wireless channels
IEEE Transactions on Information Forensics and Security
Secure wireless communication with dynamic secrets
INFOCOM'10 Proceedings of the 29th conference on Information communications
Automatic secret keys from reciprocal MIMO wireless channels: measurement and analysis
IEEE Transactions on Information Forensics and Security
Privacy amplification with social networks
Proceedings of the 15th international conference on Security protocols
| Hi-index | 754.84 |
For pt.I see ibid., vol.49, no.4, p.822-31(2003). In the first part, we showed that when two parties, willing to generate a secret key, but connected only by a completely insecure communication channel, have access to independent repetitions of some random experiment, then the possibility of secret-key agreement depends on a certain property, called simulatability, of the probability distribution modeling the parties' initial knowledge. More generally, the simulatability condition is important in the context of identification and authentication among parties sharing some correlated but not necessarily identical partially secret keys. Unfortunately, this condition is a priori not very useful since it is not clear how to decide efficiently whether it is satisfied or not for a given distribution PXYZ. We introduce a new formalism, based on a mechanical model for representing the involved quantities, that allows for dealing with discrete joint distributions of random variables and their manipulations by noisy channels. We show that this representation leads to a simple and efficient characterization of the possibility of secret-key agreement secure against active adversaries.