Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 41
Number of items: 41
  • Open Access
    Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., & Schaffner, C. (2014). Position-based quantum cryptography: Impossibility and constructions. SIAM Journal on Computing, 43(1), 150-178. https://doi.org/10.1137/130913687
  • Open Access
    Buhrman, H., Fehr, S., & Schaffner, C. (2014). On the Parallel Repetition of Multi-Player Games: The No-Signaling Case. In S. T. Flammia, & A. W. Harrow (Eds.), 9th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2014, May 21-23, 2014, National University of Singapore, Singapore (pp. 24-35). (Leibniz International Proceedings in Informatics; Vol. 27). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2014.24
  • Buhrman, H., van der Gulik, P. T. S., Klau, G. W., Schaffner, C., Speijer, D., & Stougie, L. (2013). A Realistic Model Under Which the Genetic Code is Optimal. Journal of molecular evolution, 77(4), 170-184. https://doi.org/10.1007/s00239-013-9571-2
  • Buhrman, H., Fehr, S., Schaffner, C., & Speelman, F. (2013). The Garden-Hose Model. In ITCS'13: proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science : January 9-12, 2013, Berkeley, California, USA (pp. 145-157). Association for Computing Machinery. https://doi.org/10.1145/2422436.2422455
  • Open Access
    Bouman, N. J., Fehr, S., González-Guillén, C., & Schaffner, C. (2013). An all-but-one entropic uncertainty relation, and application to password-based identification. In K. Iwama, Y. Kawano, & M. Murao (Eds.), Theory of Quantum Computation, Communication, and Cryptography: 7th Conference, TQC 2012, Tokyo, Japan, May 17-19, 2012: revised selected papers (pp. 29-44). (Lecture Notes in Computer Science; Vol. 7582). Springer. https://doi.org/10.1007/978-3-642-35656-8_3
  • Open Access
    Fehr, S., Gelles, R., & Schaffner, C. (2013). Security and Composability of Randomness Expansion from Bell Inequalities. Physical Review A, 87(1), Article 012335. https://doi.org/10.1103/PhysRevA.87.012335
  • Open Access
    Buhrman, H., Christandl, M., & Schaffner, C. (2012). Complete insecurity of quantum protocols for classical two-party computation. Physical Review Letters, 109(16), 160501. https://doi.org/10.1103/PhysRevLett.109.160501
  • Tomamichel, M., Schaffner, C., Smith, A., & Renner, R. (2011). Leftover Hashing Against Quantum Side Information. IEEE Transactions on Information Theory, 57(8), 5524-5535. https://doi.org/10.1109/TIT.2011.2158473
  • Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011). Random Oracles in a Quantum World. In D. H. Lee, & X. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011 : proceedings (pp. 41-69). (Lecture Notes in Computer Science; Vol. 7073). Springer. https://doi.org/10.1007/978-3-642-25385-0_3
  • Open Access
    Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., & Schaffner, C. (2011). Position-based quantum cryptography: impossibility and constructions. In P. Rogaway (Ed.), Advances in Cryptology – CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011: proceedings (pp. 429-446). (Lecture Notes in Computer Science; Vol. 6841). Springer. https://doi.org/10.1007/978-3-642-22792-9_24
Page 4 of 5