Peter Michael Reichstein Rasmussen

Peter Michael Reichstein Rasmussen

PhD Student

ORCID: 0000-0001-9219-8410

Publication year:
All
1 - 2 out of 2Page size: 10
  1. 2020
  2. Published

    Expander graphs are non-malleable codes

    Rasmussen, Peter Michael Reichstein & Sahai, A., 2020, 1st Conference on Information-Theoretic Cryptography, ITC 2020. Kalai, Y. T., Smith, A. D. & Wichs, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-10 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  3. Published

    Fast hashing with strong concentration bounds

    Aamand, A., Houen, Jakob Bæk Tejs, Knudsen, M. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

ID: 135855095