Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 199-216
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data2004
- Smoothing probability distributions and smooth entropy2002
- Elements of Information Theory2001
- Secret-Key Reconciliation by Public Discussion2001
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Smooth Entropy and Rényi EntropyLecture Notes in Computer Science, 1997
- Generalized privacy amplificationIEEE Transactions on Information Theory, 1995
- Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, 1993
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978