Search Results

1 - 10 of 12 items :

  • "Secure multiparty computation" x
Clear All
Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees

of Security - 7th International Symposium, FPS 2014, Montreal, QC, Canada, November 3-5, 2014. Revised Selected Papers , volume 8930 of Lecture Notes in Computer Science , pages 294–310. Springer, 2014. [39] J. Launchbury, I. S. Diatchki, T. 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

Open access
Preprocessing Based Verification of Multiparty Protocols with Honest Majority

secure multiparty 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

Open access
Students and Taxes: a Privacy-Preserving Study Using Secure Computation

Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, and Tomas Toft. Secure Multiparty Computation Goes Live. In Proceedings of FC 2009, pages 325-343, 2009. [9] Koji Chida, Gembu Morohashi, Hitoshi Fuji, Fumihiko Magata, Akiko Fujimura, Koki Hamada, Dai Ikarashi, and Ryuichi Yamamoto. Implementation and evaluation of an efficient secure computation system using ‘R’ for healthcare statistics. Journal of the American Medical Informatics Association, 04, 2014. [10] Ivan Damgård, Kasper Damgård, Kurt Nielsen, Peter Sebastian

Open access
Privacy-Preserving Interdomain Routing at Internet Scale

. Wigderson. Completeness theorems for non-cryptographic fault-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

Open access
Efficient Server-Aided 2PC for Mobile Phones

, Martin Geisler, Thomas Jakobsen, Mikkel Kroigaard, 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

Open access
Privacy-Preserving Search of Similar Patients in Genomic Data

:629, 2012. A link to the library: . [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. . article. [Online; accessed June-2018]. [GMW87] Oded Goldreich, Silvio Micali, and Avi

Open access
Secure and scalable match: overcoming the universal circuit bottleneck using group programs

multiparty computation. In CRYPTO , pages 572–590, 2007. [12] A. K. Datta, M. Gradinariu, M. Raynal, and G. Simon. Anonymous publish/subscribe in p2p networks. In IPDPS , page 74, 2003. [13] U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation (extended abstract). In STOC , pages 554–563, 1994. [14] C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC , pages 169–178, 2009. [15] O. Goldreich. The Foundations of Cryptography - Volume 1, Basic Techniques . Cambridge University Press, 2001. [16] O

Open access
Circumventing Cryptographic Deniability with Remote Attestation

, and M. Waidner, “Server-supported signatures,” in ESORICS’96: 4th European Symposium on Research in Computer Security , ser. Lecture Notes in Computer Science, E. Bertino, H. Kurth, G. Martella, and E. Montolivo, Eds., vol. 1146. Springer, Heidelberg, Sep. 1996, pp. 131–143. [10] R. Bahmani, M. Barbosa, F. Brasser, B. Portela, A.-R. Sadeghi, G. Scerri, and B. Warinschi, “Secure multiparty computation from SGX,” in FC 2017: 21st International Conference on Financial Cryptography and Data Security , ser. Lecture Notes in Computer Science, A. Kiayias, Ed., vol

Open access
Private Evaluation of Decision Trees using Sublinear Cost

. Pinkas. Privacy preserving data mining. Journal of Cryptology , 15(3):177–206, 2002. [47] Y. Lindell and B. Pinkas. Secure multiparty computation for privacy-preserving data mining. IACR Cryptology ePrint Archive , 2008:197, 2008. [48] Y. Lindell and B. Pinkas. A proof of security of yao’s protocol for two-party computation. J. Cryptol. , 22(2):161–188, Apr. 2009. [49] C. Liu, X. S. Wang, K. Nayak, Y. Huang, and E. Shi. Oblivm: A programming framework for secure computation. In SP , pages 359–376, 2015. [50] D. Malkhi, N. Nisan, B. Pinkas

Open access
PrivateRide: A Privacy-Enhanced Ride-Hailing Service

Security , 1994. [18] . Last visited: Nov. 2016. [19] R. Canetti. Studies in secure multiparty computation and applications . PhD thesis, The Weizmann Institute of Science, 1996. [20] D. Chaum. Blind signatures for untraceable payments. In Proc. of the 3rd Cryptology Conference , 1983. [21] D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. In Proc. of the 10th Cryptology Conference , 1990. [22] L. Chen, A. Mislove, and C. Wilson. Peeking Beneath the Hood of Uber. In Proc

Open access