{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:02:13Z","timestamp":1774990933873,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541752","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2514-2518","source":"Crossref","is-referenced-by-count":8,"title":["Incremental and decremental secret key agreement"],"prefix":"10.1109","author":[{"given":"Chung","family":"Chan","sequence":"first","affiliation":[{"name":"Institute of Network Coding at the Chinese University of Hong Kong, China"}]},{"given":"Ali","family":"Al-Bashabsheh","sequence":"additional","affiliation":[{"name":"Institute of Network Coding at the Chinese University of Hong Kong, China"}]},{"given":"Qiaoqiao","family":"Zhou","sequence":"additional","affiliation":[{"name":"Institute of Network Coding at the Chinese University of Hong Kong, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282464"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282463"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2588506"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176786"},{"key":"ref14","article-title":"Clustering of random variables by multivariate mutual information on Chow-Liu tree approximations","author":"chan","year":"2015","journal-title":"Fifty-Third Annual Allerton Conference on Communication Control and Computing"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1109\/TMBMC.2016.2630054","article-title":"Info-clustering: A mathematical theory of clustering","author":"chan","year":"2016","journal-title":"submitted to IEEE Transactions on Molecular Biological and Multi-Scale Communications"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2539347"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533546"},{"key":"ref18","article-title":"Bounds on public communication needed to achieve sk capacity in the hypergraphical source model","author":"mukherjee","year":"2016","journal-title":"Submitted to isit"},{"key":"ref19","article-title":"When is omniscience a rate-optimal strategy for achieving secret key capacity?","author":"chan","year":"2016","journal-title":"Submitted to ITW"},{"key":"ref4","article-title":"On tightness of mutual dependence upperbound for secret-key capacity of multiple terminals","author":"chan","year":"2008","journal-title":"arXiv preprint arXiv 0805 3200"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1109\/JPROC.2015.2458316","article-title":"Mul-tivariate mutual information inspired by secret-key agreement","volume":"103","author":"chan","year":"0","journal-title":"Proc IEEE"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464805"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034285"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541752"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034157"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592217"},{"key":"ref21","author":"schrijver","year":"2002","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0024-3795(91)90070-D","article-title":"The principal lattice of partitions of a submodular function","volume":"144","author":"narayanan","year":"1990","journal-title":"Linear Algebra and its Applications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589419"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref25","first-page":"1759","article-title":"Minimum average cost clustering","author":"nagano","year":"2010","journal-title":"NIPS"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541752.pdf?arnumber=7541752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:29Z","timestamp":1774986749000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541752","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}