Péter Ligeti is an applied mathematician, habilitated associate professor at the Faculty of Informatics of Eötvös Loránd University. He has been researching and teaching combinatorial optimization and cryptography from 2007. He participated in several research and development projects as researcher and sub-programme coordinator. He was an author of 42 papers with 173 citations.

Publications

  1. M. Gyarmati, P. Ligeti, Smallest graphs achieving the Stinson bound, IEEE Tr. Inf. Th. 66 (7) (2020) pp. 4609-4612.
  2. K. Harsányi, P. Ligeti, Exact information ratios for secret sharing on small graphs with girth at least 5, Journal of Mathematical Cryptology 13 (2) (2019) pp. 107-116.
  3. L. Csirmaz, P. Ligeti, Secret sharing on large girth graphs, Cryptography and Communications, 11 (3) (2019) pp. 399-410.
  4. L. Csirmaz, P. Ligeti, G. Tardos, Erdős-Pyber theorem for hypergraphs and secret sharing, Graphs and Combinatorics 31 (5) (2015) pp. 1335-1346.
  5. P. Kasza, P. Ligeti, Á. Nagy, Siren: Secure Data Sharing Over P2P and F2F Network, Studia Scientarium Mathematicarum Hungarica, 52 (2) (2015) pp. 257-264.