An Information Theoretic Framework for Biometric Security Systems
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Secret rate - privacy leakage in biometric systems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Secure communication using an untrusted relay via sources and channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Perfect secrecy, perfect omniscience and steiner tree packing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Biometric systems: privacy and secrecy aspects
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Secret sharing over fast-fading MIMO wiretap channels
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Secure source coding with a helper
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Secure physical layer key generation schemes: performance and information theoretic limits
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Perfect omniscience, perfect secrecy, and Steiner tree packing
IEEE Transactions on Information Theory
Secret keys from channel noise
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Watermarking identification codes with related topics on common randomness
General Theory of Information Transfer and Combinatorics
General Theory of Information Transfer and Combinatorics
Biometric Security from an Information-Theoretical Perspective
Foundations and Trends in Communications and Information Theory
Message transmission and key establishment: conditions for equality of weak and strong capacities
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
| Hi-index | 754.90 |
We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest