Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 42
Number of items: 42
  • Open Access
    Dulek, Y., & Speelman, F. (2018). Quantum Ciphertext Authentication and Key Recycling with the Trap Code. In S. Jeffery (Ed.), 13th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2018, July 16-18, 2018, Sydney, Australia Article 1 (Leibniz International Proceedings in Informatics; Vol. 111). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2018.1
  • Alagic, G., Dulek, Y., Schaffner, C., & Speelman, F. (2017). Quantum Fully Homomorphic Encryption with Verification. In T. Takagi, & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017 : proceedings (Vol. 1, pp. 438-467). (Lecture Notes in Computer Science; Vol. 10624). Springer. https://doi.org/10.1007/978-3-319-70694-8_16
  • Buhrman, H., Czekaj, Ł., Grudka, A., Horodecki, M., Horodecki, P., Markiewicz, M., Speelman, F., & Strelchuk, S. (2016). Quantum communication complexity advantage implies violation of a Bell inequality. Proceedings of the National Academy of Sciences of the United States of America, 113(12), 3191-3196. https://doi.org/10.1073/pnas.1507647113
  • Dulek, Y., Schaffner, C., & Speelman, F. (2016). Quantum homomorphic encryption for polynomial-sized circuits. In M. Robshaw, & J. Katz (Eds.), Advances in Cryptology – CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016 : proceedings (Vol. 3, pp. 3-32). (Lecture Notes in Computer Science; Vol. 9816). Springer. https://doi.org/10.1007/978-3-662-53015-3_1
  • Open Access
    Speelman, F. (2016). Position-based quantum cryptography and catalytic computation. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Brody, J., Buhrman, H., Koucký, M., Loff, B., Speelman, F., & Vereshchagin, N. (2016). Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica, 76(3), 749-781. https://doi.org/10.1007/s00453-015-0112-9
  • Open Access
    Buhrman, H., Koucký, M., Loff, B., & Speelman, F. (2016). Catalytic space: Non-determinism and hierarchy. In N. Ollinger, & H. Vollmer (Eds.), 33rd Symposium on Theoretical Aspects of Computer Science: STACS'16, February 17-20, 2016, Orléans, France Article 24 (Leibniz International Proceedings in Informatics; Vol. 47). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2016.24
  • Open Access
    Speelman, F. (2016). Instantaneous non-local computation of low T-depth quantum circuits. In A. Broadbent (Ed.), 11th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2016, September 27-29, 2016, Berlin, Germany Article 9 (Leibniz International Proceedings in Informatics; Vol. 61). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2016.9
  • Open Access
    Briët, J., Buhrman, H., Leung, D., Piovesan, T., & Speelman, F. (2015). Round Elimination in Exact Communication Complexity. In S. Beigi, & R. König (Eds.), 10th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC'15, May 20-22, 2015, Brussels, Belgium (pp. 206-225). (Leibniz International Proceedings in Informatics; Vol. 44). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2015.206
  • Buhrman, H., Cleve, R., Koucký, M., Loff, B., & Speelman, F. (2014). Computing with a full memory: Catalytic space. In STOC '14: proceedings of the 2014 ACM Symposium on Theory of Computing : New York, New York, USA, May 31, 2014-June 3, 2014 (pp. 857-866). ACM. https://doi.org/10.1145/2591796.2591874
Page 4 of 5