Computer Science and Mathematics of Security
Oriol Farràs Ventura
Michael Bamiloshin studied in the University of Ilorin, Nigeria, where he obtained a Bachelor of Science degree in Mathematics. Following this, he proceeded to the University of L'Aquila, Italy, and then the University of Silesia, Poland, obtaining a double Masters degree in Mathematical Engineering from both schools. His master's thesis was titled “Secret Sharing Schemes and Hierarchical Access Structures”. His work on this topic piqued his interest in cryptography, secret sharing and secure Multiparty Computation (MPC) and eventually led to him joining the CRISES Research Group in the URV, where he is currently working as a PhD student. Apart from his research work, he is also assisting in teaching the Cryptography and Information Security course in the Department of Computer Engineering and Mathematics.
Project: Characterizing access structures with efficient secret sharing schemes
Secret sharing schemes are growing in their importance as a cryptographic primitive. For example, we find their use in building Secure Multiparty Computation protocols. Over the years, there has been a concerted effort to give a characterization to those access structures that admit efficient secret sharing schemes, but it is no easy task. We continue in that path by applying new techniques in the search for lower bounds on the share size of access structures.