Trade-offs in information-theoretic multi-party one-way key agreement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4883 LNCS, Issue , 2009, Pages 65-75

  Renner, Renato ^a   Wolf, Stefan ^b   Wullschleger, Jürg ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

KEY AGREEMENT; LEFTOVER HASH LEMMA; PUBLIC COMMUNICATIONS; SECRET KEY; SLEPIAN-WOLF CODING;

NETWORK SECURITY;

INFORMATION THEORY;

EID: 70549105910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10230-1_5     Document Type: Conference Paper

References (20)

1. Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography - part I: Secret sharing. IEEE Transactions on Information Theory 39(4), 1121-1132 (1993)
2. Bennett, C.H., Brassard, G., Crépeau, C., Maurer, U.: Generalized privacy amplification. IEEE Transactions on Information Theory 41(6), 1915-1923 (1995)
3. Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM Journal on Computing 17(2), 210-229 (1988)
4. Brassard, G., Salvail, L.: Secret-key reconciliation by public discussion. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 410-423. Springer, Heidelberg (1994)
5. Cachin, C.: Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Zurich, Switzerland (1997)
6. Csiszár, I., Körner, J.: Broadcast channels with confidential messages. IEEE Transactions on Information Theory 24, 339-348 (1978)
7. Csiszár, I., Narayan, P.: Secrecy capacities for multiple terminals. IEEE Transactions on Information Theory 50(12), 3047-3061 (2004)
8. Cover, T.: A proof of the data compression theorem of Slepian and Wolf for ergodic sources. IEEE Transactions on Information Theory 21, 226-228 (1975)
9. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences 18, 143-154 (1979)
10. Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523-540. Springer, Heidelberg (2004)
11. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 12-24. ACM Press, New York (1989)
12. Maurer, U.: Secret key agreement by public discussion. IEEE Transaction on Information Theory 39(3), 733-742 (1993)
13. Muramatsu, J., Koga, H., Mukouchi, T.: On the problem of generating mutually independent random sequences. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 86(5), 1275-1284 (2003)
14. Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307-321. Springer, Heidelberg (1997)
15. Renner, R.: Security of Quantum Key Distribution. PhD thesis, ETH Zurich, Switzerland (2005), http://arxiv.org/abs/quant-ph/0512258
16. Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 199-216. Springer, Heidelberg (2005)
17. Renner, R., Wolf, S., Wullschleger, J.: The single-serving channel capacity. In: Proceedings of the IEEE International Symposium on Information Theory, ISIT 2006 (2006)
18. Shannon, C.E.: A mathematical theory of communication. Bell System Tech. Journal 27, 379-423, 623-656 (1948)
19. Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Transactions on Information Theory IT-19, 471-480 (1973)
20. Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 555-572. Springer, Heidelberg (2007)