Author:
Cohen Ran,Shelat Abhi,Wichs Daniel
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference93 articles.
1. M. Ajtai. Generating hard instances of the short basis problem. In Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP), pages 1–9, 1999.
2. J. Alwen and C. Peikert. Generating shorter bases for hard random lattices. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science STACS, pages 75–86, 2009.
3. P. Ananth, A. R. Choudhuri, A. Goel, and A. Jain. Round-optimal secure multiparty computation with honest majority. In Advances in Cryptology – CRYPTO 2018, part II, pages 395–424, 2018.
4. P. Ananth, S. Badrinarayanan, A. Jain, N. Manohar, and A. Sahai. From FE combiners to secure MPC and back. In Proceedings of the 17th Theory of Cryptography Conference, TCC 2019, part I, pages 199–228, 2019.
5. G. Asharov, A. Jain, A. López-Alt, E. Tromer, V. Vaikuntanathan, and D. Wichs. Multiparty computation with low communication, computation and interaction via threshold FHE. In Advances in Cryptology – EUROCRYPT 2012, pages 483–501, 2012.