Advertisement

Correlated-Source Extractors and Cryptography with Correlated-Random Tapes

  • Vipul Goyal
  • Yifan SongEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11476)

Abstract

In this paper, we consider the setting where a party uses correlated random tapes across multiple executions of a cryptographic algorithm. We ask if the security properties could still be preserved in such a setting. As examples, we introduce the notion of correlated-tape zero knowledge, and, correlated-tape multi-party computation, where, the zero-knowledge property, and, the ideal/real model security must still be preserved even if a party uses correlated random tapes in multiple executions.

Our constructions are based on a new type of randomness extractor which we call correlated-source extractors. Correlated-source extractors can be seen as a dual of non-malleable extractors, and, allow an adversary to choose several tampering functions which are applied to the randomness source. Correlated-source extractors guarantee that even given the output of the extractor on the tampered sources, the output on the original source is still uniformly random. Given (seeded) correlated-source extractors, and, resettably-secure computation protocols, we show how to directly get a positive result for both correlated-tape zero-knowledge and correlated-tape multi-party computation in the CRS model. This is tight considering the known impossibility results on cryptography with imperfect randomness.

Our main technical contribution is an explicit construction of a correlated-source extractor where the length of the seed is independent of the number of tamperings. Additionally, we also provide a (non-explicit) existential result for correlated source extractors with almost optimal parameters.

References

  1. [ABP15]
    Abdalla, M., Benhamouda, F., Passelègue, A.: An algebraic framework for pseudorandom functions and applications to related-key security. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 388–409. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-662-47989-6_19CrossRefGoogle Scholar
  2. [ACM+14]
    Austrin, P., Chung, K.-M., Mahmoody, M., Pass, R., Seth, K.: On the impossibility of cryptography with tamperable randomness. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 462–479. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-44371-2_26CrossRefGoogle Scholar
  3. [ACRT97]
    Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P., Trevisan, L.: Weak random sources, hitting sets, and BPP simulations. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 264–272, October 1997Google Scholar
  4. [BACD+18]
    Ben-Aroya, A., Chattopadhyay, E., Doron, D., Li, X., Ta-Shma, A.: A new approach for constructing low-error, two-source extractors. In: Proceedings of the 33rd Computational Complexity Conference, CCC 2018, Germany, pp. 3:1–3:19. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)Google Scholar
  5. [BGGL01]
    Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: Proceedings 2001 IEEE International Conference on Cluster Computing, pp. 116–125, October 2001Google Scholar
  6. [BP13]
    Bitansky, N., Paneth, O.: On the impossibility of approximate obfuscation and applications to resettable cryptography. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 241–250. ACM, New York (2013)Google Scholar
  7. [CG88]
    Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230–261 (1988)MathSciNetCrossRefGoogle Scholar
  8. [CG14a]
    Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 440–464. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-642-54242-8_19CrossRefzbMATHGoogle Scholar
  9. [CGGM00]
    Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 235–244. ACM, New York (2000)Google Scholar
  10. [CGL16]
    Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 285–298. ACM, New York (2016)Google Scholar
  11. [CL16]
    Chattopadhyay, E., Li, X.: Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 158–167, October 2016Google Scholar
  12. [Coh15]
    Cohen, G.: Local correlation breakers and applications to three-source extractors and mergers. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 845–862, October 2015Google Scholar
  13. [Coh16a]
    Cohen, G.: Making the most of advice: new correlation breakers and their applications. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 188–196, October 2016Google Scholar
  14. [Coh16b]
    Cohen, G.: Non-malleable extractors - new tools and improved constructions. In: Raz, R. (ed.) 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 50, pp. 8:1–8:29. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016)Google Scholar
  15. [Coh16c]
    Cohen, G.: Non-malleable extractors with logarithmic seeds. Electron. Colloquium Comput. Complex. (ECCC) 23, 30 (2016)Google Scholar
  16. [COP+14]
    Chung, K.-M., Ostrovsky, R., Pass, R., Venkitasubramaniam, M., Visconti, I.: 4-round resettably-sound zero knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 192–216. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-642-54242-8_9CrossRefGoogle Scholar
  17. [COPV13]
    Chung, K.M., Ostrovsky, R., Pass, R., Visconti, I.: Simultaneous resettability from one-way functions. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 60–69, October 2013Google Scholar
  18. [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
  19. [CRS14]
    Cohen, G., Raz, R., Segev, G.: Nonmalleable extractors with short seeds and applications to privacy amplification. SIAM J. Comput. 43(2), 450–476 (2014)MathSciNetCrossRefGoogle Scholar
  20. [CZ16]
    Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 670–683. ACM, New York (2016)Google Scholar
  21. [DGS09]
    Deng, Y., Goyal, V., Sahai, A.: Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 251–260, October 2009Google Scholar
  22. [DLWZ14]
    Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and nonmalleable extractors via character sums. SIAM J. Comput. 43(2), 800–830 (2014)MathSciNetCrossRefGoogle Scholar
  23. [DOPS04]
    Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: Annual Symposium on Foundations of Computer Science, pp. 196–205 (2004)Google Scholar
  24. [DRS04]
    Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523–540. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-24676-3_31CrossRefGoogle Scholar
  25. [DW09]
    Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 601–610. ACM, New York (2009)Google Scholar
  26. [GM11]
    Goyal, V., Maji, H.K.: Stateless cryptographic protocols. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 678–687, October 2011Google Scholar
  27. [GO94]
    Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1–32 (1994)MathSciNetCrossRefGoogle Scholar
  28. [GS09]
    Goyal, V., Sahai, A.: Resettably secure computation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 54–71. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-01001-9_3CrossRefGoogle Scholar
  29. [GS19]
    Goyal, V., Song, Y.: Correlated-source extractors and cryptography with correlated-random tapes. Cryptology ePrint Archive (2019)Google Scholar
  30. [GUV09]
    Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56(4), 20:1–20:34 (2009)MathSciNetCrossRefGoogle Scholar
  31. [KLRZ08]
    Kalai, Y.T., Li, X., Rao, A., Zuckerman, D.: Network extractor protocols. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 654–663, October 2008Google Scholar
  32. [Li12a]
    Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 688–697, October 2012Google Scholar
  33. [Li12b]
    Li, X.: Design extractors, non-malleable condensers and privacy amplification. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 837–854. ACM, New York (2012)Google Scholar
  34. [Li15]
    Li, X.: Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 502–531. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-662-46494-6_21CrossRefGoogle Scholar
  35. [Li16]
    Li, X.: Improved two-source extractors, and affine extractors for polylogarithmic entropy. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 168–177, October 2016Google Scholar
  36. [Li17]
    Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 1144–1156. ACM, New York (2017)Google Scholar
  37. [MW97]
    Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307–321. Springer, Heidelberg (1997).  https://doi.org/10.1007/BFb0052244CrossRefGoogle Scholar
  38. [SSZ95]
    Saks, M., Srinivasan, A., Zhou, S.: Explicit dispersers with polylog degree. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC 1995, pp. 479–488. ACM, New York (1995)Google Scholar
  39. [VV85]
    Vazirani, U.V., Vazirani, V.V.: Random polynomial time is equal to slightly-random polynomial time. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 417–428, October 1985Google Scholar
  40. [Zuc96]
    Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4), 367–391 (1996)MathSciNetCrossRefGoogle Scholar

Copyright information

© International Association for Cryptologic Research 2019

Authors and Affiliations

  1. 1.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations