{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:38:05Z","timestamp":1770982685866,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["669255"],"award-info":[{"award-number":["669255"]}]},{"name":"ERC","award":["731583"],"award-info":[{"award-number":["731583"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134024","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"2263-2276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["TinyOLE"],"prefix":"10.1145","author":[{"given":"Nico","family":"D\u00f6ttling","sequence":"first","affiliation":[{"name":"Friedrich-Alexander-University Erlangen-N\u00fcrnberg, N\u00fcrnberg, Germany"}]},{"given":"Satrajit","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Tobias","family":"Nilges","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Roberto","family":"Trifiletti","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"e_1_3_2_2_2_1","volume-title":"Perfectly-Secure MPC with Linear Communication Complexity TCC 2008 (LNCS), Ran Canetti (Ed.)","volume":"4948","author":"Beerliov\u00e1-Trub\u00edniov\u00e1 Zuzana","year":"2008","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt 2008. Perfectly-Secure MPC with Linear Communication Complexity TCC 2008 (LNCS), Ran Canetti (Ed.), Vol. Vol. 4948. Springer, Heidelberg, 213--230."},{"key":"e_1_3_2_2_3_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation EUROCRYPT 2011 (LNCS), Kenneth G. Paterson (Ed.)","volume":"6632","author":"Bendlin Rikke","year":"2011","unstructured":"Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias 2011. Semi-homomorphic Encryption and Multiparty Computation EUROCRYPT 2011 (LNCS), Kenneth G. Paterson (Ed.), Vol. Vol. 6632. Springer, Heidelberg, 169--188."},{"key":"e_1_3_2_2_4_1","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols 42nd FOCS","author":"Canetti Ran","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols 42nd FOCS. IEEE Computer Society Press, 136--145."},{"key":"e_1_3_2_2_5_1","volume-title":"Birgit Pfitzmann (Ed.)","author":"Cramer Ronald","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Jesper Buus Nielsen. 2001. Multiparty Computation from Threshold Homomorphic Encryption EUROCRYPT 2001 (LNCS), Birgit Pfitzmann (Ed.), Vol. Vol. 2045. Springer, Heidelberg, 280--299."},{"key":"e_1_3_2_2_6_1","volume-title":"Don Coppersmith (Ed.)","author":"Cr\u00e9peau Claude","unstructured":"Claude Cr\u00e9peau, Jeroen van de Graaf, and Alain Tapp. 1995. Committed Oblivious Transfer and Private Multi-Party Computation CRYPTO'95 (LNCS), Don Coppersmith (Ed.), Vol. Vol. 963. Springer, Heidelberg, 110--123."},{"key":"e_1_3_2_2_7_1","volume-title":"Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography EUROCRYPT 2010 (LNCS), Henri Gilbert (Ed.)","volume":"6110","author":"Damg\u00e5rd Ivan","year":"2010","unstructured":"Ivan Damg\u00e5rd, Yuval Ishai, and Mikkel Kr\u00f8igaard. 2010. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography EUROCRYPT 2010 (LNCS), Henri Gilbert (Ed.), Vol. Vol. 6110. Springer, Heidelberg, 445--465."},{"key":"e_1_3_2_2_8_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias 2012. Multiparty Computation from Somewhat Homomorphic Encryption CRYPTO 2012 (LNCS), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. Vol. 7417. Springer, Heidelberg, 643--662."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32284-6_7"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_32"},{"key":"e_1_3_2_2_12_1","volume-title":"David B. Shmoys (Ed.)","author":"Genkin Daniel","unstructured":"Daniel Genkin, Yuval Ishai, Manoj Prabhakaran, Amit Sahai, and Eran Tromer 2014. Circuits resilient to additive attacks with applications to secure computation 46th ACM STOC, David B. Shmoys (Ed.). ACM Press, 495--504."},{"key":"e_1_3_2_2_13_1","volume-title":"Jesper Buus Nielsen, and Tobias Nilges","author":"Ghosh Satrajit","year":"2017","unstructured":"Satrajit Ghosh, Jesper Buus Nielsen, and Tobias Nilges 2017. Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Application of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017. To appear."},{"key":"e_1_3_2_2_14_1","volume-title":"Alfred Aho (Ed.)","author":"Goldreich Oded","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority 19th ACM STOC, Alfred Aho (Ed.). ACM Press, 218--229."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_16_1","volume-title":"Founding Cryptography on Oblivious Transfer - Efficiently CRYPTO 2008 (LNCS), David Wagner (Ed.)","volume":"5157","author":"Ishai Yuval","year":"2008","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently CRYPTO 2008 (LNCS), David Wagner (Ed.), Vol. Vol. 5157. Springer, Heidelberg, 572--591."},{"key":"e_1_3_2_2_17_1","volume-title":"Secure Arithmetic Computation with No Honest Majority TCC 2009 (LNCS), Omer Reingold (Ed.)","volume":"5444","author":"Ishai Yuval","year":"2009","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. 2009. Secure Arithmetic Computation with No Honest Majority TCC 2009 (LNCS), Omer Reingold (Ed.), Vol. Vol. 5444. Springer, Heidelberg, 294--314."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_27"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"e_1_3_2_2_22_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012","unstructured":"Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation CRYPTO 2012 (LNCS), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. Vol. 7417. Springer, Heidelberg, 681--700."},{"key":"e_1_3_2_2_23_1","volume-title":"Protocols for Secure Computations (Extended Abstract) 23rd FOCS","author":"Chi-Chih Yao Andrew","unstructured":"Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract) 23rd FOCS. IEEE Computer Society Press, 160--164."}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134024","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:02Z","timestamp":1750212662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134024"}},"subtitle":["Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":22,"alternative-id":["10.1145\/3133956.3134024","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134024","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}