My main research field is theoretical cryptography. I wrote my PhD in secret sharing. I studied secure multiparty compuation protocols and privacy protection algorithms.
List of my publications:
Gyarmati, Máté, Secret sharing on regular bipartite access structures, DESIGNS CODES AND CRYPTOGRAPHY 91 pp. 1851-1971. , 121 p. (2023)
Gyarmati, Máté ; Ligeti, Péter, On the information ratio of graphs without high-degree neighbors, DISCRETE APPLIED MATHEMATICS 304 pp. 55-62. , 8 p. (2021)
Gyarmati, Máté ; Ligeti, Peter, Smallest graphs achieving the Stinson bound, IEEE TRANSACTIONS ON INFORMATION THEORY 66 : 7 pp. 4609-4612. , 4 p. (2020)
Gyarmati, Máté ; Ligeti, Péter, On the information ratio of graphs with many leaves, TATRA MOUNTAINS MATHEMATICAL PUBLICATIONS 73 : & pp. 97-108. , 12 p. (2019)