{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:06:09Z","timestamp":1742951169425,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811050640"},{"type":"electronic","value":"9789811050657"}],"license":[{"start":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T00:00:00Z","timestamp":1501027200000},"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-981-10-5065-7_10","type":"book-chapter","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T09:58:39Z","timestamp":1500976719000},"page":"177-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Uniform Random Number Generation and Secret Key Agreement for General Sources by Using Sparse Matrices"],"prefix":"10.1007","author":[{"given":"Jun","family":"Muramatsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeki","family":"Miyake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,26]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"E. Abbe, Polarization and randomness extraction, in Proceedings of 2011 IEEE International Symposium Information Theory (St. Petersburg, Russia, 31 July\u20135 Aug 2011), pp.\u00a0184\u2013188","DOI":"10.1109\/ISIT.2011.6033870"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1109\/18.243431","volume":"IT\u201339","author":"R Ahlswede","year":"1993","unstructured":"R. Ahlswede, I. Csisz\u00e1r, Common randomness in information theory and cryptography \u2014 Part I: secret sharing. IEEE Trans. Inform. Theory IT\u201339(4), 1121\u20131132 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/18.651026","volume":"IT\u201344","author":"R Ahlswede","year":"1998","unstructured":"R. Ahlswede, I. Csisz\u00e1r, Common randomness in information theory and cryptography \u2014 Part II: CR capacity. IEEE Trans. Inform. Theory IT\u201344(1), 225\u2013240 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"IT\u201341","author":"CH Bennett","year":"1995","unstructured":"C.H. Bennett, G. Brassard, C. Crepeau, U. Maurer, Generalized privacy amplification. IEEE Trans. Inform. Theory IT\u201341(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"M. Bloch, Channel intrinsic randomness, in Proceedings of 2010 IEEE International Symposium Information Theory (Austin, USA, 13\u201318 June 2010), pp.\u00a02607\u20132611","DOI":"10.1109\/ISIT.2010.5513744"},{"issue":"12","key":"10_CR6","doi-asserted-by":"publisher","first-page":"8077","DOI":"10.1109\/TIT.2013.2283722","volume":"IT\u201359","author":"M Bloch","year":"2013","unstructured":"M. Bloch, J.N. Laneman, Strong secrecy from channel resolvability. IEEE Trans. Inform Theory IT\u201359(12), 8077\u20138098 (2013)","journal-title":"IEEE Trans. Inform Theory"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s001459900023","volume":"10","author":"C Cachin","year":"1997","unstructured":"C. Cachin, U.M. Maurer, Linking information reconciliation and privacy amplification. J. Cryptol. 10, 97\u2013110 (1997)","journal-title":"J. Cryptol."},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/TIT.1975.1055356","volume":"IT\u201321","author":"TM Cover","year":"1975","unstructured":"T.M. Cover, A proof of the data compression theorem of Slepian and Wolf for ergodic sources. IEEE Trans. Inform. Theory IT\u201321(2), 226\u2013228 (1975)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR9","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"T.M. Cover, J.A. Thomas, Elements of Information Theory, 2nd edn. (Wiley, Hoboken, 2006)","edition":"2"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TIT.1982.1056524","volume":"IT\u201328","author":"I Csisz\u00e1r","year":"1982","unstructured":"I. Csisz\u00e1r, Linear codes for sources and source networks: error exponents, universal coding. IEEE Trans. Inform. Theory IT\u201328(4), 585\u2013592 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10_CR11","first-page":"40","volume":"32","author":"I Csisz\u00e1r","year":"1996","unstructured":"I. Csisz\u00e1r, Almost independence and secrecy capacity. Probl. Inform. Transm. 32(1), 40\u201347 (1996)","journal-title":"Probl. Inform. Transm."},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csisz\u00e1r","year":"2011","unstructured":"I. Csisz\u00e1r, J. K\u00f6rner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. (Cambridge University Press, Cambridge, 2011)","edition":"2"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"J.L. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci. 18, 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/18.256486","volume":"IT\u201339","author":"TS Han","year":"1993","unstructured":"T.S. Han, S. Verd\u00fa, Apploximation theory of output statistics. IEEE Trans. Inform. Theory IT\u201339(3), 752\u2013772 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12066-8","volume-title":"Information-Spectrum Methods in Information Theory","author":"TS Han","year":"2003","unstructured":"T.S. Han, Information-Spectrum Methods in Information Theory (Springer, Berlin, 2003)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, D. Zuckerman, How to recycle random bits, in 30th IEEE Symposium of Fundations of Computer Science (30 Oct\u20131 Nov 1989), pp.\u00a0248\u2013253","DOI":"10.1109\/SFCS.1989.63486"},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1109\/TIT.2008.921860","volume":"IT\u201352","author":"H Koga","year":"2008","unstructured":"H. Koga, Coding theorem on the threshold scheme for a general source. IEEE Trans. Inform. Theory IT\u201352(4), 2658\u20132677 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"IT\u201339","author":"UM Maurer","year":"1993","unstructured":"U.M. Maurer, Secret key agreement by public discussion from common information. IEEE Trans. Inform. Theory IT\u201339(3), 733\u2013742 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"10_CR19","doi-asserted-by":"publisher","first-page":"2036","DOI":"10.1093\/ietfec\/e89-a.7.2036","volume":"E89\u2013A","author":"J Muramatsu","year":"2006","unstructured":"J. Muramatsu, Secret key agreement from correlated source outputs using low density parity check matrices. IEICE Trans. Fundam. E89\u2013A(7), 2036\u20132046 (2006)","journal-title":"IEICE Trans. Fundam."},{"issue":"5","key":"10_CR20","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1109\/TIT.2014.2309140","volume":"IT\u201360","author":"J Muramatsu","year":"2014","unstructured":"J. Muramatsu, Channel coding and lossy source coding using a generator of constrained random numbers. IEEE Trans. Inform. Theory IT\u201360(5), 2667\u20132686 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10_CR21","doi-asserted-by":"crossref","first-page":"3574","DOI":"10.1109\/TIT.2015.2428238","volume":"IT\u201361","author":"J Muramatsu","year":"2014","unstructured":"J. Muramatsu, Variable-length lossy source cod using a constrained-random-number generator. IEEE Trans. Inform. Theory IT\u201361(6), 3574\u20133592 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10_CR22","first-page":"1275","volume":"E86\u2013A","author":"J Muramatsu","year":"2003","unstructured":"J. Muramatsu, T. Koga, T. Mukouchi, On the problem of generating mutually independent random sequences. IEICE Trans. Fundam. E86\u2013A(5), 1275\u20131284 (2003)","journal-title":"IEICE Trans. Fundam."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"J. Muramatsu, S. Miyake, Hash property and coding theorems for sparse matrices and maximal-likelihood coding. IEEE Trans. Inform. Theory IT\u201356(5), 2143\u20132167 (2010). Corrections: IT-56(9), 4762 (2010); IT-59(10), 6952\u20136953 (2013)","DOI":"10.1109\/TIT.2010.2054412"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"J. Muramatsu, S. Miyake, Construction of Slepian-Wolf source code and broadcast channel code based on hash property (2010), \n                    arXiv:1006.5271\n                    \n                   [CS.IT]","DOI":"10.1109\/ISIT.2010.5513527"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"J. Muramatsu, S. Miyake, Construction of strongly secure wiretap channel code based on hash property, in Proceedings 2011 IEEE International Symposium on Information Theory (St. Petersburg, Russia, 31 July\u20135 Aug 2011), pp.\u00a0612\u2013616","DOI":"10.1109\/ISIT.2011.6034202"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/TIT.2011.2173716","volume":"IT\u201358","author":"J Muramatsu","year":"2012","unstructured":"J. Muramatsu, S. Miyake, Construction of codes for wiretap channel and secret key agreement from correlated source outputs based on hash property. IEEE Trans. Inform. Theory IT\u201358(2), 671\u2013692 (2012)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"J. Muramatsu, S. Miyake, Uniform random number generation by using sparse matrix, Proceedings of IEEE Information Theory Workshop (Lausanne, Switzerland, 3\u20137 Sept 2012), pp. 612\u2013616","DOI":"10.1109\/ITW.2012.6404748"},{"key":"10_CR28","unstructured":"J. Muramatsu, S. Miyake, Construction of a channel code from an arbitrary source code with decoder side information, in Proceedings of International Symposium Information Theory and Its Applications (Monterey, CA, USA, 30 Oct\u20132 Nov, 2016), pp.\u00a0176\u2013180"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume":"3788","author":"R Renner","year":"2005","unstructured":"R. Renner, S. Wolf, Simple and tight bounds for information reconciliation and privacy amplification. Lect. Notes Comput. Sci. 3788, 199\u2013216 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"5","key":"10_CR30","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/18.412679","volume":"IT\u201341","author":"S Vembu","year":"1995","unstructured":"S. Vembu, S. Verd\u00fa, Generating random bits from an arbitrary source. IEEE Trans. Inform. Theory IT\u201341(5), 1322\u20131332 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"10_CR31","doi-asserted-by":"publisher","first-page":"3280","DOI":"10.1109\/TIT.2007.903122","volume":"IT\u201353","author":"Z Zhang","year":"2007","unstructured":"Z. Zhang, Estimating mutual information via Kolmogorov distance. IEEE Trans. Inform. Theory IT\u201353(9), 3280\u20133283 (2007)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Mathematics for Industry","Mathematical Modelling for Next-Generation Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-5065-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T09:17:57Z","timestamp":1557998277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-5065-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,26]]},"ISBN":["9789811050640","9789811050657"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-5065-7_10","relation":{},"ISSN":["2198-350X","2198-3518"],"issn-type":[{"type":"print","value":"2198-350X"},{"type":"electronic","value":"2198-3518"}],"subject":[],"published":{"date-parts":[[2017,7,26]]},"assertion":[{"value":"26 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}