Document Open Access Logo

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

Authors Benny Applebaum, Prashant Nalini Vasudevan



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2019.4.pdf
  • Filesize: 466 kB
  • 14 pages

Document Identifiers

Author Details

Benny Applebaum
  • Tel Aviv University, Tel Aviv, Israel, https://www.eng.tau.ac.il/~bennyap/
Prashant Nalini Vasudevan
  • UC Berkeley, Berkeley, USA, http://people.eecs.berkeley.edu/~prashvas

Cite AsGet BibTex

Benny Applebaum and Prashant Nalini Vasudevan. Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 4:1-4:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ITCS.2019.4

Abstract

In the conditional disclosure of secrets (CDS) problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold n-bit inputs x and y respectively, wish to release a common secret z to Carol (who knows both x and y) if and only if the input (x,y) satisfies some predefined predicate f. Alice and Bob are allowed to send a single message to Carol which may depend on their inputs and some shared randomness, and the goal is to minimize the communication complexity while providing information-theoretic security. Despite the growing interest in this model, very few lower-bounds are known. In this paper, we relate the CDS complexity of a predicate f to its communication complexity under various communication games. For several basic predicates our results yield tight, or almost tight, lower-bounds of Omega(n) or Omega(n^{1-epsilon}), providing an exponential improvement over previous logarithmic lower-bounds. We also define new communication complexity classes that correspond to different variants of the CDS model and study the relations between them and their complements. Notably, we show that allowing for imperfect correctness can significantly reduce communication - a seemingly new phenomenon in the context of information-theoretic cryptography. Finally, our results show that proving explicit super-logarithmic lower-bounds for imperfect CDS protocols is a necessary step towards proving explicit lower-bounds against the class AM, or even AM cap coAM - a well known open problem in the theory of communication complexity. Thus imperfect CDS forms a new minimal class which is placed just beyond the boundaries of the "civilized" part of the communication complexity world for which explicit lower-bounds are known.

Subject Classification

ACM Subject Classification
  • Theory of computation → Communication complexity
  • Theory of computation → Cryptographic protocols
Keywords
  • Conditional Disclosure of Secrets
  • Information-Theoretic Security

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. William Aiello, Yuval Ishai, and Omer Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In Birgit Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding, volume 2045 of Lecture Notes in Computer Science, pages 119-135. Springer, 2001. URL: http://dx.doi.org/10.1007/3-540-44987-6_8.
  2. Benny Applebaum and Barak Arkis. On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. In Amos Beimel and Stefan Dziembowski, editors, Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I, volume 11239 of Lecture Notes in Computer Science, pages 317-344. Springer, 2018. URL: http://dx.doi.org/10.1007/978-3-030-03807-6_12.
  3. Benny Applebaum, Barak Arkis, Pavel Raykov, and Prashant Nalini Vasudevan. Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. In Jonathan Katz and Hovav Shacham, editors, Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I, volume 10401 of Lecture Notes in Computer Science, pages 727-757. Springer, 2017. URL: http://dx.doi.org/10.1007/978-3-319-63688-7_24.
  4. Benny Applebaum, Thomas Holenstein, Manoj Mishra, and Ofer Shayevitz. The Communication Complexity of Private Simultaneous Messages, Revisited. In Jesper Buus Nielsen and Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II, volume 10821 of Lecture Notes in Computer Science, pages 261-286. Springer, 2018. URL: http://dx.doi.org/10.1007/978-3-319-78375-8_9.
  5. Benny Applebaum and Pavel Raykov. From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. In Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II, pages 65-82, 2016. URL: http://dx.doi.org/10.1007/978-3-662-49099-0_3.
  6. Benny Applebaum and Prashant Nalini Vasudevan. Placing conditional disclosure of secrets in the communication complexity universe. Technical Report, 2018. Full version of this paper. URL: https://www.eng.tau.ac.il/~bennyap/publications.html.
  7. Nuttapong Attrapadung. Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More. In Phong Q. Nguyen and Elisabeth Oswald, editors, Advances in Cryptology - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings, volume 8441 of Lecture Notes in Computer Science, pages 557-577. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-642-55220-5_31.
  8. László Babai. Trading Group Theory for Randomness. In Robert Sedgewick, editor, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, pages 421-429. ACM, 1985. URL: http://dx.doi.org/10.1145/22145.22192.
  9. Amos Beimel, Oriol Farràs, Yuval Mintz, and Naty Peter. Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. To appear in TCC 2017, 2017. Google Scholar
  10. Amos Beimel, Yuval Ishai, Ranjit Kumaresan, and Eyal Kushilevitz. On the Cryptographic Complexity of the Worst Functions. In Yehuda Lindell, editor, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings, volume 8349 of Lecture Notes in Computer Science, pages 317-342. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-642-54242-8_14.
  11. Amos Beimel, Eyal Kushilevitz, and Pnina Nissim. The Complexity of Multiparty PSM Protocols and Related Models. To appear in Eurocrypt 2018, 2018. URL: https://eprint.iacr.org/2018/148.
  12. Amos Beimel and Naty Peter. Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. Cryptology ePrint Archive, Report 2018/441, 2018. URL: https://eprint.iacr.org/2018/441.
  13. Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, and Prashant Nalini Vasudevan. On the Power of Statistical Zero Knowledge. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pages 708-719. IEEE Computer Society, 2017. URL: http://dx.doi.org/10.1109/FOCS.2017.71.
  14. Ernest F. Brickell and Daniel M. Davenport. On the Classification of Ideal Secret Sharing Schemes. J. Cryptology, 4(2):123-134, 1991. URL: http://dx.doi.org/10.1007/BF00196772.
  15. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, and Ugo Vaccaro. On the Size of Shares for Secret Sharing Schemes. J. Cryptology, 6(3):157-167, 1993. URL: http://dx.doi.org/10.1007/BF00198463.
  16. Yevgeniy Dodis. Shannon Impossibility, Revisited. In Adam D. Smith, editor, Information Theoretic Security - 6th International Conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012. Proceedings, volume 7412 of Lecture Notes in Computer Science, pages 100-110. Springer, 2012. URL: http://dx.doi.org/10.1007/978-3-642-32284-6_6.
  17. Uriel Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In Frank Thomson Leighton and Michael T. Goodrich, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pages 554-563. ACM, 1994. URL: http://dx.doi.org/10.1145/195058.195408.
  18. Amos Fiat and Moni Naor. Broadcast Encryption. In Douglas R. Stinson, editor, Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, volume 773 of Lecture Notes in Computer Science, pages 480-491. Springer, 1993. URL: http://dx.doi.org/10.1007/3-540-48329-2_40.
  19. Romain Gay, Iordanis Kerenidis, and Hoeteck Wee. Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In Rosario Gennaro and Matthew Robshaw, editors, Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II, volume 9216 of Lecture Notes in Computer Science, pages 485-502. Springer, 2015. URL: http://dx.doi.org/10.1007/978-3-662-48000-7_24.
  20. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting Data Privacy in Private Information Retrieval Schemes. J. Comput. Syst. Sci., 60(3):592-629, 2000. URL: http://dx.doi.org/10.1006/jcss.1999.1689.
  21. Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM, 38(3):691-729, 1991. URL: http://dx.doi.org/10.1145/116825.116852.
  22. Shafi Goldwasser and Michael Sipser. Private Coins versus Public Coins in Interactive Proof Systems. Advances in Computing Research, 5:73-90, 1989. Google Scholar
  23. Mika Göös, Toniann Pitassi, and Thomas Watson. Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. In Tim Roughgarden, editor, Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015, pages 113-122. ACM, 2015. URL: http://dx.doi.org/10.1145/2688073.2688074.
  24. Mika Göös, Toniann Pitassi, and Thomas Watson. The Landscape of Communication Complexity Classes. Computational Complexity, 27(2):245-304, 2018. URL: http://dx.doi.org/10.1007/s00037-018-0166-6.
  25. Yuval Ishai, Eyal Kushilevitz, and Anat Paskin. Secure Multiparty Computation with Minimal Interaction. In Tal Rabin, editor, Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings, volume 6223 of Lecture Notes in Computer Science, pages 577-594. Springer, 2010. URL: http://dx.doi.org/10.1007/978-3-642-14623-7_31.
  26. Yuval Ishai and Hoeteck Wee. Partial Garbling Schemes and Their Applications. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, volume 8572 of Lecture Notes in Computer Science, pages 650-662. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-662-43948-7_54.
  27. Ilan Kremer, Noam Nisan, and Dana Ron. On Randomized One-Round Communication Complexity. Computational Complexity, 8(1):21-49, 1999. URL: http://dx.doi.org/10.1007/s000370050018.
  28. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, 1997. Google Scholar
  29. Tianren Liu and Vinod Vaikuntanathan. Breaking the Circuit-Size Barrier in Secret Sharing. To appear in STOC2018, 2018. URL: https://eprint.iacr.org/2018/333.
  30. Tianren Liu, Vinod Vaikuntanathan, and Hoeteck Wee. Conditional Disclosure of Secrets via Non-linear Reconstruction. In Jonathan Katz and Hovav Shacham, editors, Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I, volume 10401 of Lecture Notes in Computer Science, pages 758-790. Springer, 2017. URL: http://dx.doi.org/10.1007/978-3-319-63688-7_25.
  31. Tianren Liu, Vinod Vaikuntanathan, and Hoeteck Wee. Towards Breaking the Exponential Barrier for General Secret Sharing. To appear in Eurocrypt 2018, 2017. URL: https://eprint.iacr.org/2017/1062.
  32. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci., 57(1):37-49, 1998. URL: http://dx.doi.org/10.1006/jcss.1998.1577.
  33. Ilan Newman. Private vs. Common Random Bits in Communication Complexity. Inf. Process. Lett., 39(2):67-71, 1991. URL: http://dx.doi.org/10.1016/0020-0190(91)90157-D.
  34. Amit Sahai and Salil P. Vadhan. A complete problem for statistical zero knowledge. J. ACM, 50(2):196-249, 2003. URL: http://dx.doi.org/10.1145/636865.636868.
  35. Claude E. Shannon. Communication Theory of Secrecy Systems. Bell Systems Technical Journal, 28:656-715, 1949. Google Scholar
  36. Hung-Min Sun and Shiuh-Pyng Shieh. Secret Sharing in Graph-Based Prohibited Structures. In Proceedings IEEE INFOCOM '97, The Conference on Computer Communications, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, Kobe, Japan, April 7-12, 1997, pages 718-724. IEEE, 1997. URL: http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4979, URL: http://dx.doi.org/10.1109/INFCOM.1997.644525.
  37. Hoeteck Wee. Dual System Encryption via Predicate Encodings. In Yehuda Lindell, editor, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings, volume 8349 of Lecture Notes in Computer Science, pages 616-637. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-642-54242-8_26.
  38. Hoteck Wee. Personal Communication, 2018. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail