Advertisement

UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens

  • Saikrishna BadrinarayananEmail author
  • Abhishek Jain
  • Rafail Ostrovsky
  • Ivan Visconti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11922)

Abstract

We revisit the problem of universally composable (UC) secure multiparty computation in the stateless hardware token model.

  • We construct a three round multi-party computation protocol for general functions based on one-way functions where each party sends two tokens to every other party. Relaxing to the two-party case, we also construct a two round protocol based on one-way functions where each party sends a single token to the other party, and at the end of the protocol, both parties learn the output.

  • One of the key components in the above constructions is a new two-round oblivious transfer protocol based on one-way functions using only one token, which can be reused an unbounded polynomial number of times.

All prior constructions required either stronger complexity assumptions, or larger number of rounds, or a larger number of tokens.

Keywords

Secure computation Hardware tokens. 

References

  1. [AAG+14]
    Agrawal, S., Ananth, P., Goyal, V., Prabhakaran, M., Rosen, A.: Lower bounds in the hardware token model. In: TCC (2014)Google Scholar
  2. [Bea96]
    Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: STOC (1996)Google Scholar
  3. [BGGL01]
    Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: FOCS (2001)Google Scholar
  4. [BJOV18]
    Badrinarayanan, S., Jain, A., Ostrovsky, R., Visconti, I.: Non-interactive secure computation from one-way functions. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 118–138. Springer, Cham (2018).  https://doi.org/10.1007/978-3-030-03332-3_5CrossRefGoogle Scholar
  5. [BP13]
    Bitansky, N., Paneth, O.: On the impossibility of approximate obfuscation and applications to resettable cryptography. In: STOC (2013)Google Scholar
  6. [BP15]
    Bitansky, N., Paneth, O.: On non-black-box simulation and the impossibility of approximate obfuscation. SIAM J. Comput. 44, 1325–1383 (2015)MathSciNetCrossRefGoogle Scholar
  7. [Can01]
    Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)Google Scholar
  8. [CDPW07]
    Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: TCC (2007)Google Scholar
  9. [CGGM00]
    Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC (2000)Google Scholar
  10. [CGS08]
    Chandran, N., Goyal, V., Sahai, A.: New constructions for UC secure computation using tamper-proof hardware. In: EUROCRYPT (2008)Google Scholar
  11. [CJS14]
    Canetti, R., Jain, A., Scafuro, A.: Practical UC security with a global random oracle. In: CCS (2014)Google Scholar
  12. [CKS+14]
    Choi, S.G., Katz, J., Schröder, D., Yerukhimovich, A., Zhou, H.-S.: (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens. In: TCC (2014)Google Scholar
  13. [COP+14]
    Chung, K.-M., Ostrovsky, R., Pass, R., Venkitasubramaniam, M., Visconti, I.: 4-round resettably-sound zero knowledge. In: TCC (2014)Google Scholar
  14. [COPV13]
    Chung, K.-M., Ostrovsky, R., Pass, R., Visconti, I.: Simultaneous resettability from one-way functions. In: FOCS (2013)Google Scholar
  15. [CPS13]
    Chung, K.-M., Pass, R., Seth, K.: Non-black-box simulation from one-way functions and applications to resettable security. In: STOC (2013)Google Scholar
  16. [CPS16]
    Chung, K.-M., Pass, R., Seth, K.: Non-black-box simulation from one-way functions and applications to resettable security. SIAM J. Comput. 45(2), 415–458 (2016)MathSciNetCrossRefGoogle Scholar
  17. [DKM11]
    Döttling, N., Kraschewski, D., Müller-Quade, J.: Unconditional and composable security using a single stateful tamper-proof hardware token. In: TCC (2011)Google Scholar
  18. [DKM12]
    Döttling, N., Kraschewski, D., Müller-Quade, J.: Statistically secure linear-rate dimension extension for oblivious affine function evaluation. In: ICITS (2012)Google Scholar
  19. [DKMN15a]
    Döttling, N., Kraschewski, D., Müller-Quade, J., Nilges, T.: From stateful hardware to resettable hardware using symmetric assumptions. In: ProvSec (2015)Google Scholar
  20. [DKMN15b]
    Döttling, N., Kraschewski, D., Müller-Quade, J., Nilges, T.: General statistically secure computation with bounded-resettable hardware tokens. In: TCC (2015)Google Scholar
  21. [DMMN13]
    Döttling, N., Mie, T., Müller-Quade, J., Nilges, T.: Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens. In: TCC (2013)Google Scholar
  22. [GGM86]
    Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33, 792–807 (1986)MathSciNetCrossRefGoogle Scholar
  23. [GIS+10]
    Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: TCC (2010)Google Scholar
  24. [GKR08]
    Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs, In: CRYPTO (2008)Google Scholar
  25. [HPV16]
    Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Composable security in the tamper-proof hardware model under minimal complexity. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 367–399. Springer, Heidelberg (2016).  https://doi.org/10.1007/978-3-662-53641-4_15CrossRefGoogle Scholar
  26. [HPV17]
    Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Constant round adaptively secure protocols in the tamper-proof hardware model. In: PKC (2017)Google Scholar
  27. [IKO+11]
    Yuval, I., Kushilevitz, E., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: EUROCRYPT (2011)Google Scholar
  28. [IPS08]
    Yuval, I., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: CRYPTO (2008)Google Scholar
  29. [Kat07]
    Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: EUROCRYPT (2007)Google Scholar
  30. [Kil88]
    Kilian, J.: Founding cryptography on oblivious transfer. In: STOC (1988)Google Scholar
  31. [Kol10]
    Kolesnikov, V.: Truly efficient string oblivious transfer using resettable tamper-proof tokens. In: TCC (2010)Google Scholar
  32. [MMN16]
    Mechler, J., Müller-Quade, J., Nilges, T.: Universally composable (non-interactive) two-party computation from untrusted reusable hardware tokens. IACR Cryptol. ePrint Archive 2016, 615 (2016)Google Scholar
  33. [MS08]
    Moran, T., Segev, G.: David and goliath commitments: UC computation for asymmetric parties using tamper-proof hardware. In: EUROCRYPT (2008)Google Scholar
  34. [Nao91]
    Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4, 151–158 (1991)CrossRefGoogle Scholar
  35. [Nil15]
    Nilges, T.: The Cryptographic Strength of Tamper-Proof Hardware. PhD thesis, Karlsruhe Institute of Technology (2015)Google Scholar
  36. [Rom90]
    Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387–394. ACM (1990)Google Scholar
  37. [Yao86]
    Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS (1986)Google Scholar

Copyright information

© International Association for Cryptologic Research 2019

Authors and Affiliations

  • Saikrishna Badrinarayanan
    • 1
    Email author
  • Abhishek Jain
    • 2
  • Rafail Ostrovsky
    • 1
  • Ivan Visconti
    • 3
  1. 1.UCLALos AngelesUSA
  2. 2.JHUBaltimoreUSA
  3. 3.University of SalernoFiscianoItaly

Personalised recommendations