{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:55:23Z","timestamp":1729619723301,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282763","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"1786-1790","source":"Crossref","is-referenced-by-count":4,"title":["More efficient privacy amplification with less random seeds"],"prefix":"10.1109","author":[{"given":"Masahito","family":"Hayashi","sequence":"first","affiliation":[]},{"given":"Toyohiro","family":"Tsurumaru","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/502090.502099"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TIT.2011.2158473"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1038\/ncomms1631"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIT.2013.2276628"},{"key":"ref37","article-title":"More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function","author":"hayashi","year":"0","journal-title":"arXiv 1311 5322"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1016\/0022-0000(81)90033-7"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/ISIT.2013.6620720"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/TIT.2013.2250576"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1137\/S0097539793244708"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TIT.2014.2337884"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2011.2110950"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2013.2278971"},{"key":"ref14","article-title":"Security analysis of epsilon-almost dual universa12 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2","author":"hayashi","year":"0","journal-title":"arXiv 1309 1596"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ISIT.2012.6284690"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1088\/1367-2630\/16\/6\/063009"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1088\/1367-2630\/14\/9\/093014"},{"key":"ref18","article-title":"Non-Asymptotic and Asymptotic Analyses on Markov Chains in Several Problems","author":"hayashi","year":"2013","journal-title":"arXiv 1309 7528"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1515\/gcc.2010.006"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/18.476316"},{"year":"2006","author":"silverman","journal-title":"A Friendly Introduction to Number Theory","key":"ref28"},{"key":"ref3","first-page":"175","article-title":"Quantum Cryptography: Public Key Distribution and Coin Tossing","author":"bennett","year":"1984","journal-title":"Proceedings of IEEE International Conference on Computers Systems and Signal Processing Bangalore India"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1006\/ffta.1999.0270"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1137\/100813683"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref29","first-page":"3","article-title":"Universal hash families and the leftover hash lemma, and applications to cryptography and computing","volume":"42","author":"stinson","year":"2002","journal-title":"J Combin Math Combin Comput"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-540-45198-3_22","article-title":"On Extracting Private Randomness over a Public Channel","volume":"2764","author":"dodis","year":"2003","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques Lecture Notes in Computer Science"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-540-27821-4_30","article-title":"Improved Randomness Extraction from Two Independent Sources","volume":"3122","author":"dodis","year":"2004","journal-title":"Approximation Random-ization and Combinatorial Optimization Algorithms and Techniques Lecture Notes in Computer Science"},{"year":"0","journal-title":"Austrian Institue of Technology QKD Software project","key":"ref2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/CCC.2003.1214429"},{"key":"ref1","article-title":"Efficient Privacy Amplification Algorithms for Quantum Key Distribution","author":"asai","year":"2011","journal-title":"(in Japanese) IEICE technical report ISEC 2010–121"},{"key":"ref20","article-title":"Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages","author":"matsumoto","year":"2011","journal-title":"arXiv 1111 4174"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/2591796.2591843"},{"key":"ref21","article-title":"A modular framework for randomness extraction based on Trevisan's construction","author":"mauerer","year":"0","journal-title":"arXiv 1212 0520v1 [cs IT]"},{"year":"2005","author":"renner","journal-title":"Security of quantum key distribution","key":"ref24"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1137\/0222053"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1364\/OE.19.010387"},{"key":"ref25","first-page":"407","article-title":"Universally composable privacy amplification against quantum adversaries","volume":"3378","author":"renner","year":"2005","journal-title":"Theory of Cryptography Second Theory of Cryptography Conference TCC 2005"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282763.pdf?arnumber=7282763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T01:16:10Z","timestamp":1567214170000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282763\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282763","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}