Advertisement

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited

  • Ivan DamgårdEmail author
  • Jesper Buus Nielsen
  • Michael Nielsen
  • Samuel Ranellucci
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10401)

Abstract

We propose a new protocol, nicknamed TinyTable, for maliciously secure 2-party computation in the preprocessing model. One version of the protocol is useful in practice and allows, for instance, secure AES encryption with latency about 1 ms and amortized time about 0.5 \(\upmu \)s per AES block on a fast cloud set-up. Another version is interesting from a theoretical point of view: we achieve a maliciously and unconditionally secure 2-party protocol in the preprocessing model for computing a Boolean circuit, where both the communication complexity and preprocessed data size needed is O(s) where s is the circuit size, while the computational complexity is \(O(k^\epsilon s)\) where k is the statistical security parameter and \(\epsilon <1\) is a constant. For general circuits with no assumption on their structure, this is the best asymptotic performance achieved so far in this model.

Notes

Acknowledgements

The first and third authors were supported by advanced ERC grant MPCPRO.

References

  1. [BDOZ11]
    Bendlin, R., Damgård, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169–188. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-20465-4_11 CrossRefGoogle Scholar
  2. [Bea91]
    Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420–432. Springer, Heidelberg (1992). doi: 10.1007/3-540-46766-1_34 Google Scholar
  3. [CDvdG87]
    Chaum, D., Damgård, I.B., Graaf, J.: Multiparty computations ensuring privacy of each party’s input and correctness of the result. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 87–119. Springer, Heidelberg (1988). doi: 10.1007/3-540-48184-2_7 Google Scholar
  4. [DK10]
    Damgård, I., Keller, M.: Secure multiparty AES. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 367–374. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-14577-3_31 CrossRefGoogle Scholar
  5. [DLT14]
    Damgård, I., Lauritsen, R., Toft, T.: An empirical study and some improvements of the MiniMac protocol for secure computation. In: Abdalla, M., Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 398–415. Springer, Cham (2014). doi: 10.1007/978-3-319-10879-7_23 Google Scholar
  6. [DPSZ12]
    Damgård, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643–662. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-32009-5_38 CrossRefGoogle Scholar
  7. [DZ13]
    Damgård, I., Zakarias, S.: Constant-overhead secure computation of boolean circuits using preprocessing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 621–641. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-36594-2_35 CrossRefGoogle Scholar
  8. [DZ16]
    Damgård, I., Zakarias, R.W.: Fast oblivious AES a dedicated application of the MiniMac protocol. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 245–264. Springer, Cham (2016). doi: 10.1007/978-3-319-31517-1_13 CrossRefGoogle Scholar
  9. [FKOS15]
    Frederiksen, T.K., Keller, M., Orsini, E., Scholl, P.: A unified approach to MPC with preprocessing using OT. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 711–735. Springer, Heidelberg (2015). doi: 10.1007/978-3-662-48797-6_29 CrossRefGoogle Scholar
  10. [IKM+13]
    Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600–620. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-36594-2_34 CrossRefGoogle Scholar
  11. [Kel]
    Keller, M. Private CommunicationGoogle Scholar
  12. [NNOB12]
    Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681–700. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-32009-5_40 CrossRefGoogle Scholar
  13. [TS]
    Tillich, S., Smart, N.: Circuits of Basic Functions Suitable For MPC and FHE. https://www.cs.bris.ac.uk/Research/CryptographySecurity/MPC/

Copyright information

© International Association for Cryptologic Research 2017

Authors and Affiliations

  • Ivan Damgård
    • 1
    Email author
  • Jesper Buus Nielsen
    • 1
  • Michael Nielsen
    • 1
  • Samuel Ranellucci
    • 2
    • 3
  1. 1.Department of Computer ScienceAarhus UniversityAarhusDenmark
  2. 2.George Mason UniversityFairfaxUSA
  3. 3.University of MarylandCollege ParkUSA

Personalised recommendations