{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:18:52Z","timestamp":1761743932812},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642552199"},{"type":"electronic","value":"9783642552205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55220-5_21","type":"book-chapter","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T07:47:50Z","timestamp":1398844070000},"page":"369-386","source":"Crossref","is-referenced-by-count":21,"title":["A Bound for Multiparty Secret Key Agreement and Implications for a Problem of Secure Computing"],"prefix":"10.1007","author":[{"given":"Himanshu","family":"Tyagi","sequence":"first","affiliation":[]},{"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1109\/18.243431","volume":"39","author":"R. Ahlswede","year":"1993","unstructured":"Ahlswede, R., Csisz\u00e1r, I.: Common randomness in information theory and cryptography\u2013part i: Secret sharing. IEEE Trans. Inf. Theory\u00a039(4), 1121\u20131132 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C.H. Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C.H. Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM J. Comput.\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"3824","DOI":"10.1103\/PhysRevA.54.3824","volume":"54","author":"C.H. Bennett","year":"1996","unstructured":"Bennett, C.H., DiVincenzo, D.P., Smolin, J.A., Wootters, W.K.: Mixed-state entanglement and quantum error correction. Phys. Rev. A\u00a054, 3824\u20133851 (1996)","journal-title":"Phys. Rev. A"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-69053-0_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C.: Smooth entropy and R\u00e9nyi entropy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 193\u2013208. Springer, Heidelberg (1997)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Cerf, N., Massar, S., Schneider, S.: Multipartite classical and quantum secrecy monotones. Physical Review A\u00a066(4), 042309 (2002)","DOI":"10.1103\/PhysRevA.66.042309"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Chan, C.: Agreement of a restricted secret key. In: Proc. IEEE International Symposium on Information Theory, pp. 1782\u20131786 (July 2012)","DOI":"10.1109\/ISIT.2012.6283585"},{"key":"21_CR9","unstructured":"Chan, C., Zheng, L.: Mutual dependence for secret key agreement. In: Proc. Annual Conference on Information Sciences and Systems (CISS) (2010)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/ISIT.2003.1228272"},{"issue":"1","key":"21_CR11","first-page":"48","volume":"32","author":"I. Csisz\u00e1r","year":"1996","unstructured":"Csisz\u00e1r, I.: Almost independence and secrecy capacity. Prob. Pered. Inform.\u00a032(1), 48\u201357 (1996)","journal-title":"Prob. Pered. Inform."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J.: Information theory: Coding theorems for discrete memoryless channels, 2nd edn. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921889"},{"issue":"12","key":"21_CR13","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1109\/TIT.2004.838380","volume":"50","author":"I. Csisz\u00e1r","year":"2004","unstructured":"Csisz\u00e1r, I., Narayan, P.: Secrecy capacities for multiple terminals. IEEE Trans. Inf. Theory\u00a050(12), 3047\u20133061 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2008","unstructured":"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\u00a038(1), 97\u2013139 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"8","key":"21_CR15","doi-asserted-by":"publisher","first-page":"3973","DOI":"10.1109\/TIT.2010.2050832","volume":"56","author":"A.A. Gohari","year":"2010","unstructured":"Gohari, A.A., Anantharam, V.: Information-theoretic key agreement of multiple terminals part i. IEEE Trans. Inf. Theory\u00a056(8), 3973\u20133996 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"21_CR16","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1109\/TIT.2003.813556","volume":"49","author":"M. Hayashi","year":"2003","unstructured":"Hayashi, M., Nagaoka, H.: General formulas for capacity of classical-quantum channels. IEEE Trans. Inf. Theory\u00a049(7), 1753\u20131768 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proc. Annual Symposium on Theory of Computing, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC (2007)","DOI":"10.1201\/9781420010756"},{"key":"21_CR19","unstructured":"Kullback, S.: Information Theory and Statistics. Dover Publications (1968)"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U.M. Maurer","year":"1993","unstructured":"Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory\u00a039(3), 733\u2013742 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"21_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/18.748999","volume":"45","author":"U.M. Maurer","year":"1999","unstructured":"Maurer, U.M., Wolf, S.: Unconditionally secure key agreement and the intrinsic conditional information. IEEE Trans. Inf. Theory\u00a045(2), 499\u2013514 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Orlitsky, A., Gamal, A.E.: Communication with secrecy constraints. In: STOC, pp. 217\u2013224 (1984)","DOI":"10.1145\/800057.808684"},{"key":"21_CR23","unstructured":"Pappu, R.S.: Physical one-way functions. Ph. D. Dissertation, Massachussetts Institute of Technology (2001)"},{"issue":"5","key":"21_CR24","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","volume":"56","author":"Y. Polyanskiy","year":"2010","unstructured":"Polyanskiy, Y., Poor, H.V., Verd\u00fa, S.: Channel coding rate in the finite blocklength regime. IEEE Trans. Inf. Theory\u00a056(5), 2307\u20132359 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR25","unstructured":"Renner, R.: Security of quantum key distribution. Ph. D. Dissertation, ETH Zurich (2005)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/3-540-39200-9_35","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Renner","year":"2003","unstructured":"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.\u00a02656, pp. 562\u2013577. Springer, Heidelberg (2003)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"R. Renner","year":"2005","unstructured":"Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-10230-1_5","volume-title":"Information Theoretic Security","author":"R. Renner","year":"2009","unstructured":"Renner, R., Wolf, S., Wullschleger, J.: Trade-offs in information-theoretic multi-party one-way key agreement. In: Desmedt, Y. (ed.) ICITS 2007. LNCS, vol.\u00a04883, pp. 65\u201375. Springer, Heidelberg (2009)"},{"key":"21_CR29","unstructured":"R\u00e9nyi, A.: On measures of entropy and information. In: Proc. Fourth Berkeley Symposium on Mathematics Statistics and Probability, vol.\u00a01, pp. 547\u2013561. Univ. of Calif. Press (1961)"},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028, 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"21_CR31","unstructured":"Tyagi, H.: Common randomness principles of secrecy. Ph. D. Dissertation, Univeristy of Maryland, College Park (2013)"},{"issue":"9","key":"21_CR32","doi-asserted-by":"publisher","first-page":"5363","DOI":"10.1109\/TIT.2013.2262496","volume":"59","author":"H. Tyagi","year":"2013","unstructured":"Tyagi, H., Narayan, P.: How many queries will resolve common randomness? IEEE Trans. Inf. Theory\u00a059(9), 5363\u20135378 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"21_CR33","doi-asserted-by":"publisher","first-page":"6337","DOI":"10.1109\/TIT.2011.2165807","volume":"57","author":"H. Tyagi","year":"2011","unstructured":"Tyagi, H., Narayan, P., Gupta, P.: When is a function securely computable? IEEE Trans. Inf. Theory\u00a057(10), 6337\u20136350 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR34","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1103\/PhysRevA.57.1619","volume":"57","author":"V. Vedral","year":"1998","unstructured":"Vedral, V., Plenio, M.B.: Entanglement measures and purification procedures. Phys. Rev. A\u00a057, 1619\u20131633 (1998)","journal-title":"Phys. Rev. A"},{"issue":"20","key":"21_CR35","doi-asserted-by":"publisher","first-page":"200501","DOI":"10.1103\/PhysRevLett.108.200501","volume":"108","author":"L. Wang","year":"2012","unstructured":"Wang, L., Renner, R.: One-shot classical-quantum capacity and hypothesis testing. Phys. Rev. Lett.\u00a0108(20), 200501 (2012)","journal-title":"Phys. Rev. Lett."},{"key":"21_CR36","unstructured":"Watanabe, S., Hayashi, M.: Finite-length analysis on tail probability and simple hypothesis testing for Markov chain. arXiv:1401.3801"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. Annual Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55220-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T10:47:18Z","timestamp":1689158838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55220-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552199","9783642552205"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55220-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}