{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:59:23Z","timestamp":1784134763781,"version":"3.55.0"},"reference-count":107,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/jproc.2015.2462774","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T20:36:29Z","timestamp":1442435789000},"page":"1781-1795","source":"Crossref","is-referenced-by-count":43,"title":["Universal Hashing for Information-Theoretic Security"],"prefix":"10.1109","volume":"103","author":[{"given":"Himanshu","family":"Tyagi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110950"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","volume":"50","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"},{"key":"ref31","author":"gulcu","year":"2014","journal-title":"Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928985"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871040"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2265141"},{"key":"ref28","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"g\u00e1cs","year":"1973","journal-title":"Probl Control Inf Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586132"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791222"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref21","first-page":"48","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisz\u00e1r","year":"1996","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref100","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-40974-8_4","article-title":"Commitment capacity of discrete memoryless channels","volume":"2898","author":"winter","year":"2003","journal-title":"Cryptography and Coding"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110230"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262083"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_15"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503220"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874824"},{"key":"ref56","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","author":"katz","year":"2007","journal-title":"Introduction to Modern Cryptography"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364768"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2006.873653"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63486"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2278971"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-36899-8_6","article-title":"On oblivious transfer capacity","volume":"7777","author":"ahlswede","year":"2013","journal-title":"Information Theory Combinatorics Search Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.651026"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2005.858853"},{"key":"ref8","author":"bellare","year":"2012","journal-title":"A cryptographic treatment of the wiretap channel"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033797"},{"key":"ref7","author":"bellare","year":"2012","journal-title":"Polynomial-Time Semantically-Secure Encryption Achieving the Secrecy Capacity"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-642-32009-5_18","article-title":"Semantic security for the wiretap channel","volume":"7417","author":"bellare","year":"2012","journal-title":"Advances in Cryptology—CRYPTO 2012"},{"key":"ref46","author":"hayashi","year":"2013","journal-title":"Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages"},{"key":"ref45","author":"hayashi","year":"2013","journal-title":"Quantum Wiretap Channel with Non-uniform Random Number and Its Exponent and Equivocation Rate of Leaked Information"},{"key":"ref48","author":"hayashi","year":"2015","journal-title":"More efficient privacy amplification with less random seeds via dual universal hash function"},{"key":"ref47","author":"hayashi","year":"2015","journal-title":"Equivocations exponents and second-order coding rates under various Rényi information measures"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875010"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513794"},{"key":"ref44","author":"hayashi","year":"2015","journal-title":"Secret key agreement General capacity and second-order asymptotics"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028449"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2014.012314.00178"},{"key":"ref70","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-45539-6_24","article-title":"Information-theoretic key agreement: From weak to strong secrecy for free","volume":"1807","author":"maurer","year":"2000","journal-title":"Advances in Cryptology—EUROCRYPT 2000"},{"key":"ref76","author":"rabin","year":"2005","journal-title":"How to Exchange Secrets with Oblivious Transfer"},{"key":"ref77","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/978-3-642-25385-0_28","article-title":"On the efficiency of bit commitment reductions","volume":"7073","author":"ranellucci","year":"2011","journal-title":"Advances in Cryptology—CRYPTO 2011"},{"key":"ref74","author":"pappu","year":"2001","journal-title":"Physical one-way functions"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970787"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1147\/sj.403.0614"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055763"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343226"},{"key":"ref61","author":"ling","year":"2014","journal-title":"Achieving AWGN channel capacity with lattice Gaussian coding"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.804244"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162275"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1362-2_11"},{"key":"ref66","first-page":"90","article-title":"The computational complexity of universal hashing","author":"mansour","year":"0","journal-title":"Proc 5th Structure in Complexity Theory Conf"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/5.4440"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/1409944.1409960"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref1","first-page":"1855","article-title":"The complexity of estimating Rényi entropy","author":"acharya","year":"0","journal-title":"Proc ACM\/SIAM Symp Discrete Algorithms"},{"key":"ref95","author":"tyagi","year":"2015","journal-title":"Universal hashing for information theoretic security CoRR"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874974"},{"key":"ref93","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/978-3-642-55220-5_21","article-title":"A bound for multiparty secret key agreement and implications for a problem of secure computing","volume":"8441","author":"tyagi","year":"2014","journal-title":"Advances in Cryptology—Eurocrypt 2014"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/18.179343"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref106","article-title":"Universal hash functions for emerging ultra-low-power networks","author":"yuksel","year":"0","journal-title":"Proc Commun Netw Distrib Syst Model Simul Conf"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901143"},{"key":"ref105","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TIFS.2010.2043187","article-title":"Information-theoretically secret key generation for fading wireless channels","volume":"5","author":"ye","year":"2010","journal-title":"IEEE Trans Inf Forens Security"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620489"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173731"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461974"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.12.017"},{"key":"ref99","author":"winkler","year":"2012","journal-title":"On the efficiency of classical and quantum secure function evaluation"},{"key":"ref96","author":"tyagi","year":"2014","journal-title":"Converses for Secret Key Agreement and Secure Computing"},{"key":"ref97","first-page":"2157","article-title":"Estimating the unseen: Improved estimators for entropy and other properties","author":"valiant","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26 (NIPS 2013)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref12","first-page":"216","article-title":"UMAC: Fast and secure message authentication","volume":"1666","author":"black","year":"1999","journal-title":"Advances in Cryptology—CRYPTO 1999"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261991"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-012-0034-2"},{"key":"ref82","first-page":"233","article-title":"Smooth Rényi entropy and applications","author":"renner","year":"0","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref81","author":"renner","year":"2005","journal-title":"Security of quantum key distribution"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2170660"},{"key":"ref84","first-page":"547","article-title":"On measures of entropy and information","author":"r\u00e9nyi","year":"0","journal-title":"Proc 4th Berkeley Symp Math Stat Probab"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691225"},{"key":"ref83","first-page":"199","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","author":"renner","year":"0","journal-title":"Proc 11th Int Conf Theory Appl Cryptol Inf Security"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_1"},{"key":"ref80","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-642-42033-7_11","article-title":"Efficient one-way secret-key agreement and private channel coding via polarization","volume":"8269","author":"renes","year":"2013","journal-title":"Advances in Cryptology—ASIACRYPT 2013"},{"key":"ref89","first-page":"3","article-title":"Universal hash families and the leftover hash lemma, applications to cryptography and computing","volume":"42","author":"stinson","year":"2002","journal-title":"J Combin Math Combin Comput"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620400"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48059-5_12"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/7270357\/07270413.pdf?arnumber=7270413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:03:11Z","timestamp":1642003391000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7270413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":107,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2015.2462774","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}