{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:32:18Z","timestamp":1740720738789,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169335"},{"type":"electronic","value":"9783642169342"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16934-2_50","type":"book-chapter","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T14:15:39Z","timestamp":1288966539000},"page":"685-700","source":"Crossref","is-referenced-by-count":1,"title":["Leakage Quantification of Cryptographic Operations"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wibmer","sequence":"first","affiliation":[]},{"given":"Debmalya","family":"Biswas","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Kerschbaum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Ryan, P.Y.A., McLean, J., Millen, J., Gilgor, V.: Noninterference, who needs it? In: Proceedings of the IEEE Computer Security Foundations Workshop, pp. 237\u2013238 (2001)","DOI":"10.1109\/CSFW.2001.930149"},{"key":"50_CR2","unstructured":"SecureSCM project, http:\/\/www.securescm.org\/"},{"issue":"11","key":"50_CR3","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a Secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computations. In: Proceedings of the Annual Symposium on Theory of Computing (STOC), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proceedings of the Conference on Mathematical Foundations of Programming Semantics (MFPS), pp. 75\u201391 (2009)","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F., Biswas, D., de Hoogh, S.: Performance comparison of secure comparison protocols. In: Proceedings of the International Workshop on Business Processes Security (BPS), pp. 133\u2013136 (2009)","DOI":"10.1109\/DEXA.2009.37"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-78663-4_25","volume-title":"Trustworthy Global Computing","author":"G. Smith","year":"2008","unstructured":"Smith, G.: Adversaries and information leaks (Tutorial). In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol.\u00a04912, pp. 383\u2013400. Springer, Heidelberg (2008)"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2005","unstructured":"Kiltz, E., Leander, G., Malone-Lee, J.: Secure Computation of the Mean and Related Statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 283\u2013302. Springer, Heidelberg (2005)"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-03549-4_6","volume-title":"Financial Cryptography and Data Security","author":"T. Toft","year":"2009","unstructured":"Toft, T.: Solving Linear Programs Using Multiparty Computation. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 90\u2013107. Springer, Heidelberg (2009)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Malacaria, P.: Assessing security threats of looping constructs. In: Proceedings of the Annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages (POPL), pp. 225\u2013235 (2007)","DOI":"10.1145\/1190216.1190251"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal\u00a027, 379\u2013423 (1948)","journal-title":"Bell System Technical Journal"},{"issue":"6","key":"50_CR13","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ic.2008.12.007","volume":"207","author":"M. Boreale","year":"2009","unstructured":"Boreale, M.: Quantifying information leakage in process calculi. Information and Computation\u00a0207(6), 699\u2013725 (2009)","journal-title":"Information and Computation"},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-44495-5_7","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J.O. Pliam","year":"2000","unstructured":"Pliam, J.O.: On the incomparability of entropy and marginal guesswork in Brute-force attacks. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 67\u201379. Springer, Heidelberg (2000)"},{"key":"50_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-75336-0_18","volume-title":"Trustworthy Global Computing","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2006. LNCS, vol.\u00a04661, pp. 281\u2013300. Springer, Heidelberg (2007)"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Probability of error in information-hiding protocols. In: Proceedings of the IEEE Computer Security Foundations Symposium (CSF), pp. 341\u2013354 (2007)","DOI":"10.1109\/CSF.2007.27"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16934-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T16:28:24Z","timestamp":1740673704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16934-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169335","9783642169342"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16934-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}