Multivariate polynomial commitment schemes
| Thesis title in Czech: | Schémata závazků k polynomům více proměnných |
|---|---|
| Thesis title in English: | Multivariate polynomial commitment schemes |
| Key words: | schémata závazků k polynomům|arguments of knowledge|Slabá Hilbertova věta o nulách|Gröbnerovy báze |
| English key words: | polynomial commitment schemes|arguments of knowledge|Hilbert’s weak Nullstellensatz|Gröbner basis |
| Academic year of topic announcement: | 2022/2023 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| Department: | Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: | Mgr. Pavel Hubáček, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 07.07.2022 |
| Date of assignment: | 07.07.2022 |
| Confirmed by Study dept. on: | 15.07.2022 |
| Date and time of defence: | 14.09.2022 09:00 |
| Date of electronic submission: | 21.07.2022 |
| Date of submission of printed version: | 25.07.2022 |
| Date of proceeded defence: | 14.09.2022 |
| Opponents: | doc. Mgr. et Mgr. Jan Žemlička, Ph.D. |
| Guidelines |
| Student/ka se seznámí s konstrukcemi kryptografických schémat pro závazky k polynomům a jejich aplikacemi a pokusí se rozšířit známé konstrukce pro polynomy jedné proměnné na polynomy více proměnných. |
| References |
| [1] B. Bünz, B. Fisch, A. Szepieniec: Transparent SNARKs from DARK Compilers. EUROCRYPT 2020
[2] D. Boneh, A. Gabizon, J. Drake, B. Fisch: Efficient polynomial commitment schemes for multiple points and polynomials. Cryptology ePrint Archive, 2020/081 [3] A. Kate, G. M. Zaverucha, and I. Goldberg. Constant-size commitments to polynomials and their applications. ASIACRYPT 2010 |