Comment
Author: Admin | 2025-04-28
The USENIX Security Symposium ’10, pp. 223–239. Washington, DC, USA (2010)Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS ’01: 42nd Annual Symposium on Foundations of Computer Science, pp. 136–145 (2001)Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Proceedings of The 3rd Theory of Cryptography Conference, TCC 2006, LNCS, vol. 3876. Springer (2006)Doganay, M.C., Pedersen, T.B., Saygin, Y., Savaş, E., Levi, A.: Distributed privacy preserving \(k\)-means clustering with additive secret sharing. In: Proceedings of the 2008 International Workshop on Privacy and Anonymity in Information Society, PAIS ’08, pp. 3–11 (2008)Even, G., Seidel, P.M., Ferguson, W.E.: A parametric error analysis of Goldschmidt’s division algorithm. J. Comput. Syst. Sci. 70(1), 118–139 (2005)Article MathSciNet MATH Google Scholar Frank, A., Asuncion, A.: UCI Machine Learning Repository (2010). URL http://archive.ics.uci.edu/ml Geisler, M.: Cryptographic Protocols: Theory and Implementation. Ph.D. thesis, Aarhus University (2010)Granlund, T., Montgomery, P.L.: Division by invariant integers using multiplication. In: PLDI ’94: Proceedings of the SIGPLAN ’94 Conference on Programming Language Design and Implementation, pp. 61–72 (1994)Henecka, W., Kögl, S., Sadeghi, A.R., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: CCS ’10: Proceedings of the 17th ACM conference on Computer and Communications Security, pp. 451–462. ACM (2010)Malka, L.: VMCrypt: modular software architecture for scalable secure computation. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) Proceedings of the 18th ACM Conference on Computer and Communications Security. CCS’11. pp. 715–724 (2011)Parhami, B.: Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press, Oxford (2010)Rodeheffer, T.: Software integer division. Microsoft Research Tech, Report MSR-TR-2008-141 (2008) SecureSCM. Technical report D9.1: Secure Computation Models and Frameworks. http://www.securescm.org (2008)Vaidya, J., Clifton, C.: Privacy-preserving \(k\)-means clustering over vertically partitioned data. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, KDD ’03, pp. 206–215 (2003)Download referencesAcknowledgmentsAuthors Dan Bogdanov, Margus Niitsoo and Jan Willemson acknowledge support from the European Regional Development Fund through the Estonian Center of Excellence in Computer Science (EXCS). Authors Dan Bogdanov and Jan Willemson acknowledge support from the European Regional Development Fund through the Software Technology and Applications Competence Centre (STACC) and from the Estonian Science Foundation through grant No. 8124. Author Dan Bogdanov also acknowledges support from the European Social Fund through the Estonian Doctoral School in Information and Communication Technology (IKTDK) and the Doctoral Studies and Internationalisation Programme (DoRa). Author Tomas Toft is supported by Confidential Benchmarking, financed by The Danish Agency for Science, Technology and Innovation; and acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within which part of this work was performed, as well as from the Center for Research in the Foundations of Electronic Market (supported by the Danish Strategic Research Council) within which part of this work was performed.Author informationAuthors and AffiliationsCybernetica, Ülikooli 2, 51003 , Tartu, EstoniaDan Bogdanov & Jan WillemsonInstitute of Computer
Add Comment