A bound for multiparty secret key agreement and implications for a problem of secure computing

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

Volumn 8441 LNCS, Issue , 2014, Pages 369-386

  Tyagi, Himanshu ^a   Watanabe, Shun ^b,c  

^a University of California at San Diego   (United States)

^b UNIVERSITY OF TOKUSHIMA   (Japan)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

secret key agreement; secure computing; single shot bound

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CRYPTOGRAPHY;

BINARY HYPOTHESIS TESTING; DISTRIBUTED SEQUENCES; INSECURE COMMUNICATION CHANNEL; PROBABILITY OF ERRORS; SECRET KEY AGREEMENT; SECURE COMPUTING; SINGLE SHOTS; STRUCTURAL CONNECTIONS;

ACCESS CONTROL;

EID: 84901684455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-55220-5_21     Document Type: Conference Paper

References (37)

1. Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography-part i: Secret sharing. IEEE Trans. Inf. Theory 39(4), 1121-1132 (1993)
2. Bennett, C.H., Brassard, G., Crépeau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915-1923 (1995)
3. Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210-229 (1988)
4. Bennett, C.H., DiVincenzo, D.P., Smolin, J.A., Wootters, W.K.: Mixed-state entanglement and quantum error correction. Phys. Rev. A 54, 3824-3851 (1996)
5. Cachin, C.: Smooth entropy and Rényi entropy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 193-208. Springer, Heidelberg (1997)
6. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Proc. Annual Symposium on Foundations of Computer Science (also, see Cryptology ePrint Archive, Report 2000/067), 136-145 (2001)
7. Cerf, N., Massar, S., Schneider, S.: Multipartite classical and quantum secrecy monotones. Physical Review A 66(4), 042309 (2002)
8. Chan, C.: Agreement of a restricted secret key. In: Proc. IEEE International Symposium on Information Theory, pp. 1782-1786 (July 2012)
9. Chan, C., Zheng, L.: Mutual dependence for secret key agreement. In: Proc. Annual Conference on Information Sciences and Systems (CISS) (2010)
10. Christandl, M., Renner, R., Wolf, S.: A property of the intrinsic mutual information. In: Proc. IEEE International Symposium on Information Theory, p. 258 (June 2003)
11. Csiszár, I.: Almost independence and secrecy capacity. Prob. Pered. Inform. 32(1), 48-57 (1996)
12. Csiszár, I., Körner, J.: Information theory: Coding theorems for discrete memoryless channels, 2nd edn. Cambridge University Press (2011)
13. Csiszár, I., Narayan, P.: Secrecy capacities for multiple terminals. IEEE Trans. Inf. Theory 50(12), 3047-3061 (2004)
14. Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM Journal on Computing 38(1), 97-139 (2008)
15. Gohari, A.A., Anantharam, V.: Information-theoretic key agreement of multiple terminals part i. IEEE Trans. Inf. Theory 56(8), 3973-3996 (2010)
16. Hayashi, M., Nagaoka, H.: General formulas for capacity of classical-quantum channels. IEEE Trans. Inf. Theory 49(7), 1753-1768 (2003)
17. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from oneway functions. In: Proc. Annual Symposium on Theory of Computing, pp. 12-24 (1989)
18. Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall/CRC (2007)
19. Kullback, S.: Information Theory and Statistics. Dover Publications (1968)
20. Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory 39(3), 733-742 (1993)
21. Maurer, U.M., Wolf, S.: Unconditionally secure key agreement and the intrinsic conditional information. IEEE Trans. Inf. Theory 45(2), 499-514 (1999)
22. Orlitsky, A., Gamal, A.E.: Communication with secrecy constraints. In: STOC, pp. 217-224 (1984)
23. Pappu, R.S.: Physical one-way functions. Ph. D. Dissertation, Massachussetts Institute of Technology (2001)
24. Polyanskiy, Y., Poor, H.V., Verdú, S.: Channel coding rate in the finite blocklength regime. IEEE Trans. Inf. Theory 56(5), 2307-2359 (2010)
25. Renner, R.: Security of quantum key distribution. Ph. D. Dissertation, ETH Zurich (2005)
26. Renner, R., Wolf, S.: New bounds in secret-key agreement: The gap between formation and secrecy extraction. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 562-577. Springer, Heidelberg (2003)
27. 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) (Pubitemid 43763476)
28. Renner, R., Wolf, S., Wullschleger, J.: Trade-offs in information-theoretic multiparty one-way key agreement. In: Desmedt, Y. (ed.) ICITS 2007. LNCS, vol. 4883, pp. 65-75. Springer, Heidelberg (2009)
29. Rényi, A.: On measures of entropy and information. In: Proc. Fourth Berkeley Symposium on Mathematics Statistics and Probability, vol. 1, pp. 547-561. Univ. of Calif. Press (1961)
30. Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28, 656-715 (1949)
31. Tyagi, H.: Common randomness principles of secrecy. Ph. D. Dissertation, Univeristy of Maryland, College Park (2013)
32. Tyagi, H., Narayan, P.: How many queries will resolve common randomness? IEEE Trans. Inf. Theory 59(9), 5363-5378 (2013)
33. Tyagi, H., Narayan, P., Gupta, P.: When is a function securely computable? IEEE Trans. Inf. Theory 57(10), 6337-6350 (2011)
34. Vedral, V., Plenio, M.B.: Entanglement measures and purification procedures. Phys. Rev. A 57, 1619-1633 (1998)
35. Wang, L., Renner, R.: One-shot classical-quantum capacity and hypothesis testing. Phys. Rev. Lett. 108(20), 200501 (2012)
36. Watanabe, S., Hayashi, M.: Finite-length analysis on tail probability and simple hypothesis testing for Markov chain. arXiv:1401.3801
37. Yao, A.C.: Protocols for secure computations. In: Proc. Annual Symposium on Foundations of Computer Science, pp. 160-164 (1982)