Document Open Access Logo

Some Open Problems in Information-Theoretic Cryptography

Author Vinod Vaikuntanathan

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2017.5.pdf
  • Filesize: 308 kB
  • 7 pages

Document Identifiers

Author Details

Vinod Vaikuntanathan

Cite AsGet BibTex

Vinod Vaikuntanathan. Some Open Problems in Information-Theoretic Cryptography. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 5:1-5:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSTTCS.2017.5

Abstract

Information-theoretic cryptography is full of open problems with a communication-complexity flavor. We will describe several such problems that arise in the study of private information retrieval, secure multi-party computation, secret sharing, private simultaneous messages (PSM) and conditional disclosure of secrets (CDS). In all these cases, there is a huge (exponential) gap between the best known upper and lower bounds. We will also describe the connections between these problems, some old and some new.
Keywords
  • Cryptography
  • Information-Theoretic Security
  • Private Information Retrieval
  • Secret Sharing
  • Multiparty Computation

Metrics

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

References

  1. Benny Applebaum, Barak Arkis, Pavel Raykov, and Prashant Nalini Vasudevan. Conditional disclosure of secrets: Amplification, closure, amortization, lower-bounds, and separations. IACR Cryptology ePrint Archive, 2017:164, 2017. URL: http://eprint.iacr.org/2017/164.
  2. László Babai, Peter G. Kimmel, and Satyanarayana V. Lokam. Simultaneous messages vs. communication. In STACS, pages 361-372, 1995. Google Scholar
  3. Amos Beimel. Secret-sharing schemes: A survey. In Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings, pages 11-46, 2011. Google Scholar
  4. Amos Beimel, Yuval Ishai, Ranjit Kumaresan, and Eyal Kushilevitz. On the cryptographic complexity of the worst functions. In TCC, pages 317-342, 2014. Google Scholar
  5. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 1-10, 1988. Google Scholar
  6. C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, page 175, 1984. Google Scholar
  7. Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-dnf formulas on ciphertexts. In Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pages 325-341, 2005. Google Scholar
  8. Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 97-106. IEEE Computer Society, 2011. URL: http://dx.doi.org/10.1109/FOCS.2011.12.
  9. Christian Cachin, Silvio Micali, and Markus Stadler. Computationally private information retrieval with polylogarithmic communication. In Jacques Stern, editor, Advances in Cryptology - EUROCRYPT'99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding, volume 1592 of Lecture Notes in Computer Science, pages 402-414. Springer, 1999. URL: http://dx.doi.org/10.1007/3-540-48910-X_28.
  10. David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 11-19, 1988. Google Scholar
  11. Benny Chor, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan. Private information retrieval. J. ACM, 45(6):965-981, 1998. URL: http://dx.doi.org/10.1145/293347.293350.
  12. László Csirmaz. The size of a share must be large. J. Cryptology, 10(4):223-231, 1997. Google Scholar
  13. Deepesh Data, Manoj Prabhakaran, and Vinod M. Prabhakaran. On the communication complexity of secure computation. In Juan A. Garay and Rosario Gennaro, editors, Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II, volume 8617 of Lecture Notes in Computer Science, pages 199-216. Springer, 2014. URL: http://dx.doi.org/10.1007/978-3-662-44381-1_12.
  14. Deepesh Data, Vinod M. Prabhakaran, and Manoj M. Prabhakaran. Communication and randomness lower bounds for secure computation. IEEE Trans. Information Theory, 62(7):3901-3929, 2016. URL: http://dx.doi.org/10.1109/TIT.2016.2568207.
  15. Zeev Dvir and Sivakanth Gopi. 2-server PIR with sub-polynomial communication. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 577-584, 2015. Google Scholar
  16. Uriel Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pages 554-563, 1994. Google Scholar
  17. William Gasarch. Web page on private information retrieval. URL: http://www.cs.umd.edu/~gasarch/TOPICS/pir/pir.html.
  18. Romain Gay, Iordanis Kerenidis, and Hoeteck Wee. Communication complexity of conditional disclosure of secrets and attribute-based encryption. In CRYPTO (II), pages 485-502, 2015. Google Scholar
  19. Craig Gentry. Fully homomorphic encryption using ideal lattices. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pages 169-178. ACM, 2009. URL: http://dx.doi.org/10.1145/1536414.1536440.
  20. Craig Gentry and Zulfikar Ramzan. Single-database private information retrieval with constant communication rate. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science, pages 803-815. Springer, 2005. URL: http://dx.doi.org/10.1007/11523468_65.
  21. 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.
  22. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pages 218-229, 1987. Google Scholar
  23. Yuval Ishai and Eyal Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pages 294-304, 2000. Google Scholar
  24. Yuval Ishai and Eyal Kushilevitz. On the hardness of information-theoretic multiparty computation. In Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pages 439-455, 2004. Google Scholar
  25. Mitsuru Ito, Akira Saito, and Takao Nishizeki. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72(9):56-64, 1989. Google Scholar
  26. Jonathan Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 80-86, 2000. Google Scholar
  27. Eyal Kushilevitz and Rafail Ostrovsky. Replication is NOT needed: SINGLE database, computationally-private information retrieval. In 38th Annual Symposium on Foundations of Computer Science, FOCS'97, Miami Beach, Florida, USA, October 19-22, 1997, pages 364-373. IEEE Computer Society, 1997. URL: http://dx.doi.org/10.1109/SFCS.1997.646125.
  28. Helger Lipmaa. An oblivious transfer protocol with log-squared communication. In Jianying Zhou, Javier Lopez, Robert H. Deng, and Feng Bao, editors, Information Security, 8th International Conference, ISC 2005, Singapore, September 20-23, 2005, Proceedings, volume 3650 of Lecture Notes in Computer Science, pages 314-328. Springer, 2005. URL: http://dx.doi.org/10.1007/11556992_23.
  29. Tianren Liu, Vinod Vaikuntanathan, and Hoeteck Wee. Conditional disclosure of secrets via non-linear reconstruction. In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I, pages 758-790, 2017. Google Scholar
  30. Tianren Liu, Vinod Vaikuntanathan, and Hoeteck Wee. Towards breaking the exponential barrier for general secret sharing. Cryptology ePrint Archive, Report 2017/1062, 2017. URL: https://eprint.iacr.org/2017/1062.
  31. Eran Mann. Private access to distributed information. In Master’s thesis, Technion - Israel Institute of Technology, 1998. Google Scholar
  32. Adi Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979. URL: http://dx.doi.org/10.1145/359168.359176.
  33. C. Shannon. A mathematical theory of communication. Bell system technical journal, 27, 1948. Google Scholar
  34. Stephanie Wehner and Ronald de Wolf. Improved lower bounds for locally decodable codes and private information retrieval. In Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pages 1424-1436, 2005. Google Scholar
  35. A. D. Wyner. The wire-tap channel. The Bell System Technical Journal, 54(8):1355-1387, Oct 1975. URL: http://dx.doi.org/10.1002/j.1538-7305.1975.tb02040.x.
  36. Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pages 160-164, 1982. Google Scholar
  37. Sergey Yekhanin. LDCs and PIRs. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2007. URL: http://hdl.handle.net/1721.1/42242.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact