Effectivity and Limitations of Homomorphic Secret Sharing Schemes

• Thesis title in Czech: Efektivita a omezení homomorfních schémat pro sdílení tajemství
• Thesis title in English: Effectivity and Limitations of Homomorphic Secret Sharing Schemes
• Key words: Homomorfné zdieľanie tajomstva|Distribuovaný diskrétny logaritmus|Generický grupový model
• English key words: Homomorphic Secret Sharing|Distributed Discrete Logarithm|Generic group model
• Academic year of topic announcement: 2020/2021
• 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: 11.02.2021
• Date of assignment: 11.02.2021
• Confirmed by Study dept. on: 10.09.2021
• Date and time of defence: 11.02.2022 09:00
• Date of electronic submission: 05.01.2022
• Date of submission of printed version: 10.01.2022
• Date of proceeded defence: 11.02.2022
• Opponents: doc. Mgr. Štěpán Holub, Ph.D.
• Advisors: Ignacio Cascudo

Guidelines

Student/ka nastuduje konstrukce a aplikace schémat pro homomorfní sdílení tajemství [1,2,3] a jejich omezení [4] a pokusí se rozšířit známé výsledky. Možnými směry jsou například nové konstrukce nebo dolní odhady efektivity pro známá schémata.

References

[1] Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro: Foundations of Homomorphic Secret Sharing. ITCS 2018: 21:1-21:21
[2] Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Michele Orrù: Homomorphic Secret Sharing: Optimizations and Applications. CCS 2017: 2105-2122
[3] Elette Boyle, Lisa Kohl, Peter Scholl: Homomorphic Secret Sharing from Lattices Without FHE. EUROCRYPT (2) 2019: 3-33
[4] Itai Dinur, Nathan Keller, Ohad Klein: An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing. J. Cryptol. 33(3): 824-873 (2020)