Distributed threats like botnets are among the most serious threats in the Internet. Due to their distributed nature, these attacks are difficult to detect in an early stage without the collaboration of several network operators. However, the exchange of monitoring data between different parties turns out to be difficult in practice, due to the desire of operators not to disclose network internals and legal data protection requirements. Secure Multi-Party Computation (SMC) for privacy-preserving sharing of network monitoring data can be a solution to the problem. As real-time performance of SMC is important for this application, we investigate ways to speed up SMC.

The focus and contribution of our work is a new model for SMC that enables to increase the performance of certain SMC primitives significantly. We introduce an assisting server which operates on dedicated, intermediate data values in plaintext. The overall rationale behind our approach is that the performance gains outweigh the slight decrease in security introduced by revealing intermediate computation results to the assisting server. We propose a new primitive for checking the equality between two values, equal  + , based on our new model. Through prototypical implementation we compare equal  +  with existing algorithms. Further, we evaluate equal  +  in the context of a cooperative network monitoring application, link-counting. Our results demonstrate that certain SMC applications can be computed much faster with our approach. Finally, we discuss the security implications of the new model.


Secret Sharing Trusted Third Party Secret Sharing Scheme Homomorphic Encryption Communication Round 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: A system for secure multi-party computation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS 2008, pp. 257–266. ACM (2008)Google Scholar
  2. 2.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1–10. ACM (1988)Google Scholar
  3. 3.
    Bogetoft, P., Christensen, D.L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325–343. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Proceedings of the 6th ACM Conference on Computer and Communications Security, CCS 1999, pp. 120–127. ACM (1999)Google Scholar
  5. 5.
    Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285–304. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Damgård, I., Geisler, M., Krøigaard, M., Nielsen, J.B.: Asynchronous Multiparty Computation: Theory and Implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160–179. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Desikan, P., Srivastava, J.: Analyzing network traffic to detect e-mail spamming machines. In: Proceedings of the 2004 ICDM Workshop on Privacy and Security Aspects of Data Mining, PSDM 2004 (2004)Google Scholar
  8. 8.
    Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: A review and open problems. In: New Security Paradigms Workshop, pp. 11–20 (2001)Google Scholar
  9. 9. Demons: Decentralized, cooperative, and privacy-preserving monitoring for trustworthiness,
  10. 10.
    Gennaro, R., Rabin, M.O., Rabin, T.: Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1998, pp. 101–111 (1998)Google Scholar
  11. 11.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169–178. ACM (2009)Google Scholar
  12. 12.
    Goldreich, O., Micali, S.M., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computation, STOC 1987, pp. 218–229. ACM (1987)Google Scholar
  13. 13.
    Gu, G., Perdisci, R., Zhang, J., Lee, W.: Botminer: Clustering analysis of network traffic for protocol- and structure-independent botnet detection. In: Proceedings of the 17th USENIX Security Symposium, pp. 139–154. USENIX Association (2008)Google Scholar
  14. 14.
    Martin, B., Strasser, M., Many, D., Dimitropoulos, X.: Sepia: Privacy-preserving aggregation of multi-domain network events and statistics. In: USENIX Security Symposium. USENIX (2010)Google Scholar
  15. 15.
    Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343–360. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  16. 16.
    Roughan, M., Zhang, Y.: Privacy-preserving performance measurements. In: Proceedings of the 2006 SIGCOMM Workshop on Mining Network Data, MineNet 2006, pp. 329–334. ACM (2006)Google Scholar
  17. 17.
    Schatzmann, D., Burkhart, M., Spyropoulos, T.: Inferring Spammers in the Network Core. In: Moon, S.B., Teixeira, R., Uhlig, S. (eds.) PAM 2009. LNCS, vol. 5448, pp. 229–238. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Vaidya, J., Clifton, C.: Leveraging the ”multi” in secure multi-party computation. In: Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, WPES 2003, pp. 53–59. ACM (2003)Google Scholar
  19. 19.
    Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 160–164 (1982)Google Scholar
  20. 20.
    Yao, A.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 162–167 (1986)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Jens-Matthias Bohli
    • 1
  • Wenting Li
    • 1
  • Jan Seedorf
    • 1
  1. 1.NEC Laboratories EuropeHeidelbergGermany

Personalised recommendations