{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:33:06Z","timestamp":1743111186908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319500102"},{"type":"electronic","value":"9783319500119"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50011-9_32","type":"book-chapter","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T07:10:32Z","timestamp":1479971432000},"page":"418-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Secure Computation Programs with Private Conditionals"],"prefix":"10.1007","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alisa","family":"Pankova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,25]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: CSF 1982, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) STOC 1987, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). doi:10.1007\/3-540-45539-6_22"},{"key":"32_CR4","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - a secure two-party computation system. In: SSYM 2004, USENIX Security Symposium, Berkeley, CA, USA, pp. 287\u2013302. USENIX Association (2004)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-88313-5_13"},{"key":"32_CR6","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: SSYM 2010, USENIX Security Symposium, Washington, DC, USA, pp. 223\u2013239. USENIX Association (2010)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS 2015. The Internet Society (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laud, P., Randmets, J.: Domain-polymorphic programming of privacy-preserving applications. In: Russo, A., Tripp, O. (eds.) PLAS@ECOOP 2014, p. 53. ACM (2014)","DOI":"10.1145\/2637113.2637119"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Nielsen, J.D., Schwartzbach, M.I.: A domain-specific programming language for secure multiparty computation. In: Hicks, M.W. (ed.) PLAS 2007, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1255329.1255333"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Schr\u00f6pfer, A., Kerschbaum, F., M\u00fcller, G.: L1 - an intermediate language for mixed-protocol secure computation. In: COMPSAC 2011, pp. 298\u2013307. IEEE Computer Society (2011)","DOI":"10.1109\/COMPSAC.2011.46"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., Sharma, R., Stefan, D., Zimmerman, J.: Information-flow control for programming on encrypted data. In: Chong, S. (ed.) CSF 2012, pp. 45\u201360. IEEE Computer Society (2012)","DOI":"10.1109\/CSF.2012.30"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-54807-9_15","volume-title":"Compiler Construction","author":"M Franz","year":"2014","unstructured":"Franz, M., Holzer, A., Katzenbeisser, S., Schallhart, C., Veith, H.: CBMC-GC: an ANSI C compiler for secure two-party computations. In: Cohen, A. (ed.) CC 2014. LNCS, vol. 8409, pp. 244\u2013249. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-54807-9_15"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Steele, A., Blanton, M.: PICCO: a general-purpose compiler for private distributed computation. In: Sadeghi, A.-R., Gligor, V.D., Yung, M. (eds.) CCS 2013, pp. 813\u2013826. ACM (2013)","DOI":"10.1145\/2508859.2516752"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Secur. 11, 403\u2013418 (2012). doi:10.1007\/s10207-012-0177-2","journal-title":"Int. J. Inf. Secur."},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32009-5_38"},{"key":"32_CR16","unstructured":"Pruulmann-Vengerfeldt, P., Kamm, L., Talviste, R., Laud, P., Bogdanov, D.: Capability Model, UaESMC Deliverable 1.1, March 2012"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Planul, J., Mitchell, J.C.: Oblivious program execution and path-sensitive non-interference. In: CSF 2013, pp. 66\u201380. IEEE (2013)","DOI":"10.1109\/CSF.2013.12"},{"key":"32_CR18","unstructured":"Kennedy, W.S., Kolesnikov, V., Wilfong, G.: Overlaying circuit clauses for secure computation. Cryptology ePrint Archive, Report 2016\/685 (2016). http:\/\/eprint.iacr.org\/2016\/685"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160\u2013179. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-00468-1_10"},{"key":"32_CR20","series-title":"Wiley Series in Discrete Mathematics & Optimization","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley Series in Discrete Mathematics & Optimization. Wiley, Chichester (1998)"},{"key":"32_CR21","unstructured":"Zahur, S., Evans, D.: Obliv-C: a language for extensible data-oblivious computation. Cryptology ePrint Archive, Report 2015\/1153 (2015). http:\/\/eprint.iacr.org\/2015\/1153"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Rastogi, A., Hammer, M.A., Hicks, M.W.: Wysteria: a programming language for generic, mixed-mode multiparty computations. In: SP 2014, pp. 655\u2013670, IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.48"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.W.: Automating efficient RAM-model secure computation. In: SP 2014, pp. 623\u2013638, IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"32_CR24","unstructured":"GLPK: GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory Pract. Log. Program. 12, 67\u201396 (2012)","journal-title":"Theory Pract. Log. Program."},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10207-014-0271-8","volume":"14","author":"L Kamm","year":"2015","unstructured":"Kamm, L., Willemson, J.: Secure floating point arithmetic and private satellite collision analysis. Int. J. Inf. Secur. 14, 531\u2013548 (2015). doi:10.1007\/s10207-014-0271-8","journal-title":"Int. J. Inf. Secur."},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"8199","DOI":"10.3390\/s130708199","volume":"13","author":"N-H Liu","year":"2013","unstructured":"Liu, N.-H., Chiang, C.-Y., Hsu, H.-M.: Improving driver alertness through music selection using a mobile EEG to detect brainwaves. Sensors 13, 8199\u20138221 (2013)","journal-title":"Sensors"},{"key":"32_CR28","unstructured":"Bogdanov, D., Kamm, L., Laur, S., Sokk, V.: Rmind: a tool for cryptographically secure statistical analysis. Cryptology ePrint Archive, Report 2014\/512 (2014). http:\/\/eprint.iacr.org\/2014\/512"},{"key":"32_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-13257-0_11","volume-title":"Information Security","author":"T Krips","year":"2014","unstructured":"Krips, T., Willemson, J.: Hybrid model of fixed and floating point numbers in secure multiparty computations. In: Chow, S.S.M., Camenisch, J., Hui, L.C.K., Yiu, S.M. (eds.) ISC 2014. LNCS, vol. 8783, pp. 179\u2013197. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-13257-0_11"},{"key":"32_CR30","unstructured":"Laud, P., Pankova, A.: Optimizing secure computation programs with private conditionals (full version). Cryptology ePrint Archive, Report 2016\/942 (2016). http:\/\/eprint.iacr.org\/2016\/942"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50011-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T01:06:08Z","timestamp":1637802368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50011-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319500102","9783319500119"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50011-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"25 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icics2016.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}