{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:38:57Z","timestamp":1755999537745},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319260952"},{"type":"electronic","value":"9783319260969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26096-9_33","type":"book-chapter","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T11:18:35Z","timestamp":1448363915000},"page":"325-341","source":"Crossref","is-referenced-by-count":2,"title":["Information Leakage Due to Revealing Randomly Selected Bits"],"prefix":"10.1007","author":[{"given":"Arash","family":"Atashpendar","sequence":"first","affiliation":[]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[]},{"given":"Peter Y. A.","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,25]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-41717-7_14","volume-title":"Security Protocols XXI","author":"PYA Ryan","year":"2013","unstructured":"Ryan, P.Y.A., Christianson, B.: Enhancements to prepare-and-measure based QKD protocols. In: Christianson, B., Malcolm, J., Stajano, F., Anderson, J., Bonneau, J. (eds.) Security Protocols 2013. LNCS, vol. 8263, pp. 123\u2013133. Springer, Heidelberg (2013)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-48452-3_9","volume-title":"Combinatorial Pattern Matching","author":"DS Hirschberg","year":"1999","unstructured":"Hirschberg, D.S.: Bounds on the number of string subsequences. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 115\u2013122. Springer, Heidelberg (1999)"},{"issue":"1","key":"33_CR3","first-page":"123","volume":"1","author":"DS Hirschberg","year":"2000","unstructured":"Hirschberg, D.S., Regnier, M.: Tight bounds on the number of string subsequences. J. Discrete Algorithms 1(1), 123\u2013132 (2000)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0019-9958(69)90442-2","volume":"15","author":"L Calabi","year":"1969","unstructured":"Calabi, L., Hartnett, W.: Some general results of coding theory with applications to the study of codes for the correction of synchronization errors. Inf. Control 15(3), 235\u2013249 (1969)","journal-title":"Inf. Control"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1006\/jcta.2000.3081","volume":"93","author":"VI Levenshtein","year":"2001","unstructured":"Levenshtein, V.I.: Efficient reconstruction of sequences from their subsequences or supersequences. J. Comb. Theory Ser. A 93(2), 310\u2013332 (2001)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(76)90140-0","volume":"16","author":"PJ Chase","year":"1976","unstructured":"Chase, P.J.: Subsequence numbers and logarithmic concavity. Discrete Math. 16(2), 123\u2013140 (1976)","journal-title":"Discrete Math."},{"issue":"1","key":"33_CR7","doi-asserted-by":"crossref","first-page":"R8","DOI":"10.37236\/1761","volume":"11","author":"A Flaxman","year":"2004","unstructured":"Flaxman, A., Harrow, A.W., Sorkin, G.B.: Strings with maximally many distinct subsequences and substrings. Electron. J. Comb. 11(1), R8 (2004)","journal-title":"Electron. J. Comb."},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-48224-5_13","volume-title":"Automata, Languages and Programming","author":"P Flajolet","year":"2001","unstructured":"Flajolet, P., Guivarc\u2019h, Y., Szpankowski, W., Vall\u00e9e, B.: Hidden pattern statistics. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 152\u2013165. Springer, Heidelberg (2001)"},{"key":"33_CR9","first-page":"101","volume":"6","author":"M Middendorf","year":"1994","unstructured":"Middendorf, M.: Supersequences, runs, and cd grammar systems. Dev. Theor. Comput. Sci. 6, 101\u2013114 (1994)","journal-title":"Dev. Theor. Comput. Sci."},{"key":"33_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words, vol. 105. Cambridge University Press, Cambridge (2005)"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11780441_15","volume-title":"Combinatorial Pattern Matching","author":"S Rahmann","year":"2006","unstructured":"Rahmann, S.: Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 153\u2013164. Springer, Heidelberg (2006)"},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2008.08.035","volume":"409","author":"C Elzinga","year":"2008","unstructured":"Elzinga, C., Rahmann, S., Wang, H.: Algorithms for subsequence combinatorics. Theoret. Comput. Sci. 409(3), 394\u2013404 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/08-PS141","volume":"6","author":"M Mitzenmacher","year":"2009","unstructured":"Mitzenmacher, M., et al.: A survey of results for deletion channels and related synchronization channels. Probab. Surv. 6, 1\u201333 (2009)","journal-title":"Probab. Surv."},{"issue":"1","key":"33_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TIT.2002.806155","volume":"49","author":"TG Swart","year":"2003","unstructured":"Swart, T.G., Ferreira, H.C.: A note on double insertion\/deletion correcting codes. IEEE Trans. Inf. Theory 49(1), 269\u2013273 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Liron, Y., Langberg, M.: A characterization of the number of subsequences obtained via the deletion channel. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 503\u2013507. IEEE (2012)","key":"33_CR15","DOI":"10.1109\/ISIT.2012.6284240"},{"issue":"1","key":"33_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mob. Comput. Commun. Rev. 5(1), 3\u201355 (2001)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"U Maurer","year":"1997","unstructured":"Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"RS Renner","year":"2005","unstructured":"Renner, R.S., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"issue":"3","key":"33_CR19","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"UM Maurer","year":"1993","unstructured":"Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory 39(3), 733\u2013742 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Cachin, C.: Entropy measures and unconditional security in cryptography. Ph.D. thesis, Swiss Federal Institute of Technology Zurich (1997)","key":"33_CR20"},{"issue":"2","key":"33_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s001459900023","volume":"10","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.M.: Linking information reconciliation and privacy amplification. J. Cryptology 10(2), 97\u2013110 (1997)","journal-title":"J. Cryptology"},{"issue":"6","key":"33_CR22","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Renyi, A.: On measures of entropy and information. In: Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 547\u2013561 (1961)","key":"33_CR23"},{"unstructured":"MacKay, D.J.: Information theory, inference, and learning algorithms, vol. 7. Citeseer (2003)","key":"33_CR24"},{"issue":"2","key":"33_CR25","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"CH Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, pp. 106\u2013112. ACM (1977)","key":"33_CR26","DOI":"10.1145\/800105.803400"},{"key":"33_CR27","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2012","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (2012)"},{"unstructured":"Atashpendar, A., Ryan, P.Y.A.: Qkd and information leakage simulator, September 2014. http:\/\/www.qkdsimulator.com","key":"33_CR28"}],"container-title":["Lecture Notes in Computer Science","Security Protocols XXIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26096-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T16:03:18Z","timestamp":1599840198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26096-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319260952","9783319260969"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26096-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}