{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:24:41Z","timestamp":1725704681588},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875081","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"1489-1493","source":"Crossref","is-referenced-by-count":15,"title":["Markov chain Monte Carlo algorithms for lattice Gaussian sampling"],"prefix":"10.1109","author":[{"given":"Zheng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Cong","family":"Ling","sequence":"additional","affiliation":[]},{"given":"Guillaume","family":"Hanrot","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1111\/1467-9868.00070"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1109\/78.978381"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1090\/mbk\/058","author":"levin","year":"2008","journal-title":"Markov Chains and Mixing Times"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/TSP.2006.872539"},{"year":"2013","author":"hassibi","journal-title":"Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems An Analysis of Stationary Distribution and Mixing Time","key":"16"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1145\/2488608.2488680"},{"year":"2001","author":"liu","journal-title":"Monte Carlo Strategies in Scientific Computing","key":"14"},{"key":"11","first-page":"937","article-title":"Finding the closest lattice vector when it is unusually close","author":"klein","year":"2000","journal-title":"Proc ACM-SIAM Symp on Discrete Algorithms"},{"key":"12","first-page":"80","article-title":"An efficient and parallel Gaussian sampler for lattices","author":"peikert","year":"2010","journal-title":"Crypto"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/18.256499"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1145\/1568318.1568324"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/49.29616"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1007\/BF01445125"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1145\/1374376.1374407"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/TCOMM.2013.101813.130500"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/TIT.2011.2162180"},{"key":"5","article-title":"Semantically secure lattice codes for the Gaussian wiretap channel","author":"ling","year":"2012","journal-title":"IEEE Trans Inform Theory"},{"key":"4","article-title":"Achieiving the AWGN channel capacity with lattice Gaussian coding","author":"ling","year":"2012","journal-title":"IEEE Trans Inform Theory"},{"key":"9","article-title":"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based","author":"gentry","year":"2013","journal-title":"Crypto"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/FOCS.2004.72"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875081.pdf?arnumber=6875081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:39:47Z","timestamp":1602671987000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875081","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}