Fast hash-based signing protocol for message stream authentication
| Název práce v češtině: | Rychlý podpisový protokol pro autentizaci proudu zpráv založený na podpisech využívajících hešovací funkce |
|---|---|
| Název v anglickém jazyce: | Fast hash-based signing protocol for message stream authentication |
| Klíčová slova: | proud dat|postkvantová autentizace|protokol|hash|podpisy založené na hešovacích funkcích |
| Klíčová slova anglicky: | message stream|post-quantum authentication|protocol|hash-based signatures |
| Akademický rok vypsání: | 2021/2022 |
| Typ práce: | diplomová práce |
| Jazyk práce: | angličtina |
| Ústav: | Katedra softwarového inženýrství (32-KSI) |
| Vedoucí / školitel: | RNDr. Filip Zavoral, Ph.D. |
| Řešitel: | skrytý - zadáno a potvrzeno stud. odd. |
| Datum přihlášení: | 25.11.2021 |
| Datum zadání: | 25.11.2021 |
| Datum potvrzení stud. oddělením: | 29.03.2022 |
| Datum a čas obhajoby: | 06.09.2023 09:00 |
| Datum odevzdání elektronické podoby: | 19.07.2023 |
| Datum odevzdání tištěné podoby: | 24.07.2023 |
| Datum proběhlé obhajoby: | 06.09.2023 |
| Oponenti: | doc. RNDr. Jan Kofroň, Ph.D. |
| Zásady pro vypracování |
| Data streaming over the internet poses many interesting challenges for the authentication of the delivered content. Mainly, the high volume and interactive nature of the data requires extreme efficiency of the authentication method, especially if the data should be verified by intermediate infrastructure. At the same time, the possible data loss and outages place high expectations on the resistance to missing or malformed data. The (commonly lacking) possibility to re-negotiate the authentication without a central authority is also advantageous for distributed and failure-resilient systems.
The aim of this thesis is to construct a message stream authentication protocol based on the quantum-resistant and highly efficient few-time hash-based signatures. The limited number of signatures given by a single key (which is the main deficiency of the few-time schemes) will be mitigated by dynamic key scheduling, which will allow the protocol to authenticate many messages while retaining a beneficially high verification performance of hash schemes. The thesis will rationalize the design by rigorous analysis of the scheme security and overhead, by practical measurements on an implemented variant of the protocol, and by discussions (and possible demonstrations) of new applications enabled by the protocol. |
| Seznam odborné literatury |
| Buchmann, J., García, L. C. C., Dahmen, E., Döring, M., & Klintsevich, E. (2006, December). CMSS–an improved Merkle signature scheme. In International Conference on Cryptology in India (pp. 349-363). Springer, Berlin, Heidelberg.
Reyzin, L., & Reyzin, N. (2002, July). Better than BiBa: Short one-time signatures with fast signing and verifying. In Australasian Conference on Information Security and Privacy (pp. 144-153). Springer, Berlin, Heidelberg. Aumasson, J. P., & Endignoux, G. (2018, April). Improving stateless hash-based signatures. In Cryptographers’ Track at the RSA Conference (pp. 219-242). Springer, Cham. Li, B., Wang, Z., Liu, J., & Zhu, W. (2013). Two decades of internet video streaming: A retrospective view. ACM transactions on multimedia computing, communications, and applications (TOMM), 9(1s), 1-20. Feng, C., & Li, B. (2008, October). On large-scale peer-to-peer streaming systems with network coding. In Proceedings of the 16th ACM international conference on Multimedia (pp. 269-278). |