Search Results

1 - 10 of 21 items :

  • "Secure multiparty computation" x
Clear All

. DuBuisson, and A. Adams-Moran. Efficient lookup-table protocol in secure multiparty computation. In P. Thiemann and R. B. Findler, editors, ICFP , pages 189–200. ACM, 2012. [40] S. Laur, J. Willemson, and B. Zhang. Round-Efficient Oblivious Database Manipulation. In Proceedings of the 14th International Conference on Information Security. ISC’11 , pages 262–277, 2011. [41] H. Lipmaa and T. Toft. Secure equality and greater-than tests with sublinear online complexity. In F. V. Fomin, R. Freivalds, M. Z. Kwiatkowska, and D. Peleg, editors, ICALP (2) , volume 7966 of

computation. In Applied Cryptography and Network Security: 14th International Conference, ACNS 2016. Proceedings (2016), M. Manulis, A.-R. Sadeghi, and S. Schneider, Eds., Springer International Publishing, pp. 327–345. [4] B aum , C., O rsini , E., and S choll , P. Efficient secure multiparty computation with identifiable abort. In Theory of Cryptography - 14th International Conference, TCC 2016-B, 2016, Proceedings, Part I (2016), M. Hirt and A. D. Smith, Eds., vol. 9985 of LNCS , pp. 461–490. [5] B eaver , D. Efficient multiparty protocols using circuit

Conference on Financial Cryptography and Data Security . Springer, 2016, pp. 110–129. [26] S. Jha, L. Kruger, and V. Shmatikov, “Towards practical privacy for genomic computation,” in Security and Privacy, 2008. SP 2008. IEEE Symposium on . IEEE, 2008, pp. 216–230. [27] G. Asharov and Y. Lindell, “A full proof of the bgw protocol for perfectly secure multiparty computation,” Journal of Cryptology , vol. 30, no. 1, pp. 58–151, 2017. [28] M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in

Emerging Technologies: CEDAR’s Analytical-Intuitive Balance’. – Ranjana Das, Brita Ytre-Arne (eds.), The Future of Audiences: a Foresight Analysis of Interfaces and Engagement . Palgrave Macmillan, 25-39. Eriksson, Maria; Fleischer, Rasmus; Johansson, Anna; Snickars, Pelle; Vonderau, Patrick. 2019. Spotify teardown: Inside the black box of streaming music . MIT Press. Habermas, Jürgen. 1968/1972. Knowledge and Human Interests. London: Heinemann Educational Books. Kanger, Laur; Pruulmann-Vengerfeldt, Pille. 2015. ‘Social Need for Secure Multiparty Computation

-preserving applications. In Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, PLAS’14, pages 53-65. ACM, 2014. [7] Dan Bogdanov, Riivo Talviste, and Jan Willemson. Deploying secure multi-party computation for financial data analysis (short paper). In Proceedings of FC 2012, pages 57-64, 2012. [8] Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, and Tomas Toft. Secure Multiparty Computation Goes Live. In

-tolerant distributed computation (extended abstract). In STOC’88 , pages 1–10. ACM, 1988. [15] A. Ben-Efraim, Y. Lindell, and E. Omri. Optimizing semihonest secure multiparty computation for the internet. In CCS’16 , pages 578–590. ACM, 2016. [16] W. Henecka and M. Roughan. STRIP: privacy-preserving vector-based routing. In International Conference on Network Protocols (ICNP’13) , pages 1–10. IEEE, 2013. [17] J. Brickell and V. Shmatikov. Privacy-preserving graph algorithms in the semi-honest model. In ASIACRYPT’05 , volume 3788 of LNCS , pages 236–252. Springer, 2005. [18] M

, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In ACM STOC , 1988. [9] D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In ESORICS , 2008. [10] P. Bogetoft, D. L. Christensen, I. Damgård, M. Geisler, T. P. Jakobsen, M. Krøigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. I. Schwartzbach, and T. Toft. Secure Multiparty Computation Goes Live. In FC , 2009. [11] D. Boneh, E. Boyle, H. Corrigan-Gibbs, N. Gilboa, and Y. Ishai

Malkin, Kobbi Nissim, Martin J. Strauss, and Rebecca N. Wright. Secure multiparty computation of approximations. ACM Trans. Algorithms , 2(3):435–472, 2006. [33] Ellis Fenske, Akshaya Mani, Aaron Johnson, and Micah Sherr. Distributed measurement with private set-union cardinality. In Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors, ACM CCS 17 , pages 2295–2312. ACM Press, October / November 2017. [34] Philippe Flajolet, Eric Fusy, Olivier Gandouet, and Frederic Meunier. Hyperloglog: The analysis of a near-optimal cardinality estimation

, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, et al. Secure multiparty computation goes live. In Financial Cryptography and Data Security, pages 325-343. Springer, 2009. [Bea92] Donald Beaver. Efficient multiparty protocols using circuit randomization. In Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO ’91, pages 420-432, London, UK, UK, 1992. Springer-Verlag. [BG02] Boaz Barak and Oded Goldreich. Universal arguments and their applications. In Computational Complexity, 2002. Proceedings. 17th

://crypto.biu.ac.il/about-scapi . [FIM + 01] Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, and Rebecca N. Wright. Secure multiparty computation of approximations. In ICALP , volume 2076 of Lecture Notes in Computer Science , pages 927–938. Springer, 2001. [GA4] GA4GH. GA4GH Strikes Formal Collaborations with 15 International Genomic Data Initiatives. https://www.ga4gh.org/news/sAhZCeJjS96QHhVPIYwwWA . article. [Online; accessed June-2018]. [GMW87] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with