{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:41:44Z","timestamp":1725910904632},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319677286"},{"type":"electronic","value":"9783319677293"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67729-3_16","type":"book-chapter","created":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T01:04:04Z","timestamp":1505523844000},"page":"269-287","source":"Crossref","is-referenced-by-count":1,"title":["Inferring Secrets by Guided Experiments"],"prefix":"10.1007","author":[{"given":"Quoc Huy","family":"Do","sequence":"first","affiliation":[]},{"given":"Richard","family":"Bubel","sequence":"additional","affiliation":[]},{"given":"Reiner","family":"H\u00e4hnle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alvim, M., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring information leakage using generalized gain functions. In: 2012 IEEE 25th Computer Security Foundations Symposium (CSF), pp. 265\u2013279, June 2012","DOI":"10.1109\/CSF.2012.26"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-54792-8_7","volume-title":"Principles of Security and Trust","author":"MS Alvim","year":"2014","unstructured":"Alvim, M.S., Scedrov, A., Schneider, F.B.: When not all bits are equal: worth-based information flow. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 120\u2013139. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54792-8_7"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Kopf, B., Rybalchenko, A.: Automatic discovery and quantification of information leaks. In: 30th Symposium on Security and Privacy, pp. 141\u2013153 (2009)","DOI":"10.1109\/SP.2009.18"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10288-011-0165-9","volume":"9","author":"T Benoist","year":"2011","unstructured":"Benoist, T., Estellon, B., Gardi, F., Megel, R., Nouioua, K.: Localsolver 1.x: a black-box local-search solver for 0\u20131 programming. 4OR 9, 299\u2013316 (2011)","journal-title":"4OR"},{"issue":"3","key":"16_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/JCS-2007-15302","volume":"15","author":"D Clark","year":"2007","unstructured":"Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. J. Comput. Secur. 15(3), 321\u2013371 (2007)","journal-title":"J. Comput. Secur."},{"issue":"5","key":"16_CR6","doi-asserted-by":"crossref","first-page":"655","DOI":"10.3233\/JCS-2009-0353","volume":"17","author":"MR Clarkson","year":"2009","unstructured":"Clarkson, M.R., Myers, A.C., Schneider, F.B.: Quantifying information flow with beliefs. J. Comput. Secur. 17(5), 655\u2013701 (2009)","journal-title":"J. Comput. Secur."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-32004-3_20","volume-title":"Security in Pervasive Computing","author":"\u00c1 Darvas","year":"2005","unstructured":"Darvas, \u00c1., H\u00e4hnle, R., Sands, D.: A theorem proving approach to analysis of secure information flow. In: Hutter, D., Ullmann, M. (eds.) SPC 2005. LNCS, vol. 3450, pp. 193\u2013209. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-32004-3_20"},{"key":"16_CR8","series-title":"IFIP Advances in Information and Communication Technology. SEC 2015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18467-8_27","volume-title":"ICT Systems Security and Privacy Protection","author":"QH Do","year":"2015","unstructured":"Do, Q.H., Bubel, R., H\u00e4hnle, R.: Exploit generation for information flow leaks in object-oriented programs. In: Federrath, H., Gollmann, D. (eds.) ICT Systems Security and Privacy Protection. IFIPAICT, vol. 455. Springer, Cham (2015). doi: 10.1007\/978-3-319-18467-8_27"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Do, Q.H., Bubel, R., H\u00e4hnle, R.: Inferring secrets by guided experiments. Technical report, TU Darmstadt (2017)","DOI":"10.1007\/978-3-319-67729-3_16"},{"key":"16_CR10","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17689-5_5","volume-title":"Numerical Analysis and Optimization","author":"DM Gay","year":"2015","unstructured":"Gay, D.M.: The AMPL modeling language: an aid to formulating and solving optimization problems. In: Al-Baali, M., Grandinetti, L., Purnama, A. (eds.) Numerical Analysis and Optimization. PROMS, vol. 134. Springer, Cham (2015). doi: 10.1007\/978-3-319-17689-5_5"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-09099-3_7","volume-title":"Tests and Proofs","author":"M Hentschel","year":"2014","unstructured":"Hentschel, M., H\u00e4hnle, R., Bubel, R.: Visualizing unbounded symbolic execution. In: Seidl, M., Tillmann, N. (eds.) TAP 2014. LNCS, vol. 8570, pp. 82\u201398. Springer, Cham (2014). doi: 10.1007\/978-3-319-09099-3_7"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Heusser, J., Malacaria, P.: Quantifying information leaks in software. In: Proceedings of the 26th Annual Computer Security Applications Conference, pp. 261\u2013269. ACM (2010)","DOI":"10.1145\/1920261.1920300"},{"issue":"7","key":"16_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.tcs.2014.04.022","volume":"538","author":"V Klebanov","year":"2014","unstructured":"Klebanov, V.: Precise quantitative information flow analysis\u2013a symbolic approach. Theor. Comput. Sci. 538, 124\u2013139 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Basin, D.: An information-theoretic model for adaptive side-channel attacks. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007, pp. 286\u2013296. ACM (2007)","DOI":"10.1145\/1315245.1315282"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: Proceedings of the 3rd ACM SIGPLAN Workshop on Programming Languages and Analysis for Security, pp. 135\u2013146. ACM (2008)","DOI":"10.1145\/1375696.1375713"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Meng, Z., Smith, G.: Calculating bounds on information leakage using two-bit patterns. In: Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages, Analysis for Security, PLAS 2011, pp. 1:1\u20131:12. ACM (2011)","DOI":"10.1145\/2166956.2166957"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-04897-0_6","volume-title":"Engineering Secure Software and Systems","author":"TM Ngo","year":"2014","unstructured":"Ngo, T.M., Huisman, M.: Quantitative security analysis for programs with low input and noisy output. In: J\u00fcrjens, J., Piessens, F., Bielova, N. (eds.) ESSoS 2014. LNCS, vol. 8364, pp. 77\u201394. Springer, Cham (2014). doi: 10.1007\/978-3-319-04897-0_6"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Pasareanu, C.S., Phan, Q., Malacaria, P.: Multi-run side-channel analysis using symbolic execution and Max-SMT. In: IEEE 29th Computer Security Foundations Symposium, CSF 2016, pp. 387\u2013400. IEEE Computer Society (2016)","DOI":"10.1109\/CSF.2016.34"},{"issue":"6","key":"16_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2382756.2382791","volume":"37","author":"Q-S Phan","year":"2012","unstructured":"Phan, Q.-S., Malacaria, P., Tkachuk, O., P\u0103s\u0103reanu, C.S.: Symbolic quantitative information flow. SIGSOFT Softw. Eng. Notes 37(6), 1\u20135 (2012)","journal-title":"SIGSOFT Softw. Eng. Notes"},{"key":"16_CR21","volume-title":"Cryptography and Data Security","author":"DE Robling Denning","year":"1982","unstructured":"Robling Denning, D.E.: Cryptography and Data Security. Addison-Wesley, Boston (1982)"},{"issue":"5","key":"16_CR22","doi-asserted-by":"crossref","first-page":"517","DOI":"10.3233\/JCS-2009-0352","volume":"17","author":"A Sabelfeld","year":"2009","unstructured":"Sabelfeld, A., Sands, D.: Declassification: dimensions and principles. J. Comput. Secur. 17(5), 517\u2013548 (2009)","journal-title":"J. Comput. Secur."},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-00596-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"G Smith","year":"2009","unstructured":"Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 288\u2013302. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00596-1_21"},{"issue":"1","key":"16_CR24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00453-006-1231-0","volume":"48","author":"S Verdoolaege","year":"2007","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using Barvinok\u2019s rational functions. Algorithmica 48(1), 37\u201366 (2007)","journal-title":"Algorithmica"},{"issue":"6","key":"16_CR25","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.3233\/JCS-2011-0437","volume":"19","author":"H Yasuoka","year":"2011","unstructured":"Yasuoka, H., Terauchi, T.: On bounding problems of quantitative information flow. J. Comput. Secur. 19(6), 1029\u20131082 (2011)","journal-title":"J. Comput. Secur."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67729-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T11:18:33Z","timestamp":1570101513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67729-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319677286","9783319677293"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67729-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}