{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:58:25Z","timestamp":1742921905829,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_3","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"20-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Sasaki","sequence":"first","affiliation":[]},{"given":"Bateh Mathias","family":"Agbor","sequence":"additional","affiliation":[]},{"given":"Shingo","family":"Masuda","sequence":"additional","affiliation":[]},{"given":"Yu-ichi","family":"Hayashi","sequence":"additional","affiliation":[]},{"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[]},{"given":"Hideaki","family":"Sone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-07536-5_8","volume-title":"Applied Cryptography and Network Security","author":"H Ahmadi","year":"2014","unstructured":"Ahmadi, H., Safavi-Naini, R.: Private message transmission using disjoint paths. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 116\u2013133. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_8"},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915\u20131923 (1995). https:\/\/doi.org\/10.1109\/18.476316","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR3","volume-title":"The Combinatorics of Network Reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn, C.J., Colbourn, C.: The Combinatorics of Network Reliability, vol. 200. Oxford University Press, New York (1987)"},{"issue":"12","key":"3_CR4","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 50(12), 3047\u20133061 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.838380","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993). https:\/\/doi.org\/10.1145\/138027.138036","journal-title":"J. ACM"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"MK Franklin","year":"2000","unstructured":"Franklin, M.K., Wright, R.N.: Secure communication in minimal connectivity models. J. Cryptol. 13(1), 9\u201330 (2000). https:\/\/doi.org\/10.1007\/s001459910002","journal-title":"J. Cryptol."},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480198335215","volume":"18","author":"MK Franklin","year":"2004","unstructured":"Franklin, M.K., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. SIAM J. Discrete Math. 18(3), 437\u2013450 (2004). https:\/\/doi.org\/10.1137\/S0895480198335215","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Indo, Y., Mizuki, T., Nishizeki, T.: Absolutely secure message transmission using a key sharing graph. Discrete Math. Alg. Appl. 4(4) (2012). https:\/\/doi.org\/10.1142\/S179383091250053X","DOI":"10.1142\/S179383091250053X"},{"key":"3_CR9","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs: International Symposium, pp. 215\u2013232 (1967)"},{"issue":"5","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1142\/S0129054111008659","volume":"22","author":"T Mizuki","year":"2011","unstructured":"Mizuki, T., Nakayama, S., Sone, H.: An application of st-numbering to secret key agreement. Int. J. Found. Comput. Sci. 22(5), 1211\u20131227 (2011). https:\/\/doi.org\/10.1142\/S0129054111008659","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"15","key":"3_CR11","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.ipl.2009.04.004","volume":"109","author":"T Mizuki","year":"2009","unstructured":"Mizuki, T., Sato, T., Sone, H.: A one-round secure message broadcasting protocol through a key sharing tree. Inf. Process. Lett. 109(15), 842\u2013845 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.04.004","journal-title":"Inf. Process. Lett."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-17773-6_7","volume-title":"Security Protocols","author":"S Nagaraja","year":"2010","unstructured":"Nagaraja, S.: Privacy amplification with social networks. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2007. LNCS, vol. 5964, pp. 58\u201373. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17773-6_7"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-12060-7_7","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"R O\u0161t\u2019\u00e1dal","year":"2014","unstructured":"O\u0161t\u2019\u00e1dal, R., \u0160venda, P., Maty\u00e1\u0161, V.: A new approach to secrecy amplification in partially compromised networks (invited paper). In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds.) SPACE 2014. LNCS, vol. 8804, pp. 92\u2013109. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12060-7_7"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/T-AIEE.1926.5061224","volume":"XLV","author":"GS Vernam","year":"1926","unstructured":"Vernam, G.S.: Cipher printing telegraph systems for secret wire and radio telegraphic communications. Trans. Am. Inst. Electr. Eng. XLV, 295\u2013301 (1926)","journal-title":"Trans. Am. Inst. Electr. Eng."},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00145-001-0002-y","volume":"14","author":"Y Wang","year":"2001","unstructured":"Wang, Y., Desmedt, Y.: Secure communication in multicast channels: The answer to franklin and wright\u2019s question. J. Cryptol. 14(2), 121\u2013135 (2001). https:\/\/doi.org\/10.1007\/s00145-001-0002-y","journal-title":"J. Cryptol."},{"issue":"9","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1587\/transfun.E93.A.1650","volume":"93","author":"S Watanabe","year":"2010","unstructured":"Watanabe, S., Matsumoto, R., Uyematsu, T.: Strongly secure privacy amplification cannot be obtained by encoder of slepian-wolf code. IEICE Trans. 93(9), 1650\u20131659 (2010). http:\/\/search.ieice.org\/bin\/summary.php?id=e93-a_9_1650","journal-title":"IEICE Trans."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:39:26Z","timestamp":1710344366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}