@article{MTMT:34038962,
	title = {Industry-Scale Orchestrated Federated Learning for Drug Discovery},
	url = {https://m2.mtmt.hu/api/publication/34038962},
	author = {Oldenhof, Martijn and Ács, Gergely and Pejó, Balázs and Schuffenhauer, Ansgar and Holway, Nicholas and Sturm, Noé and Dieckmann, Arne and Fortmeier, Oliver and Boniface, Eric and Mayer, Clément and Gohier, Arnaud and Schmidtke, Peter and Niwayama, Ritsuya and Kopecky, Dieter and Mervin, Lewis and Rathi, Prakash Chandra and Friedrich, Lukas and Formanek, András and Antal, Peter and Rahaman, Jordon and Zalewski, Adam and Heyndrickx, Wouter and Oluoch, Ezron and Stößel, Manuel and Vančo, Michal and Endico, David and Gelus, Fabien and De Boisfossé, Thaïs and Darbier, Adrien and Nicollet, Ashley and Blottière, Matthieu and Telenczuk, Maria and Nguyen, Van Tien and Martinez, Thibaud and Boillet, Camille and Moutet, Kelvin and Picosson, Alexandre and Gasser, Aurélien and Djafar, Inal and Simon, Antoine and Arany, Ádám and Simm, Jaak and Moreau, Yves and Engkvist, Ola and Ceulemans, Hugo and Marini, Camille and Galtier, Mathieu},
	doi = {10.1609/aaai.v37i13.26847},
	journal-iso = {AAAI CONF ARTIF INTELLIGENCE},
	journal = {AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE},
	volume = {37},
	unique-id = {34038962},
	issn = {2159-5399},
	abstract = {To apply federated learning to drug discovery we developed a novel platform in the context of European Innovative Medicines Initiative (IMI) project MELLODDY (grant n°831472), which was comprised of 10 pharmaceutical companies, academic research labs, large industrial companies and startups. The MELLODDY platform was the first industry-scale platform to enable the creation of a global federated model for drug discovery without sharing the confidential data sets of the individual partners. The federated model was trained on the platform by aggregating the gradients of all contributing partners in a cryptographic, secure way following each training iteration. The platform was deployed on an Amazon Web Services (AWS) multi-account architecture running Kubernetes clusters in private subnets. Organisationally, the roles of the different partners were codified as different rights and permissions on the platform and administrated in a decentralized way. The MELLODDY platform generated new scientific discoveries which are described in a companion paper.},
	year = {2023},
	eissn = {2374-3468},
	pages = {15576-15584},
	orcid-numbers = {Formanek, András/0000-0003-0734-1417}
}

@inproceedings{MTMT:32172981,
	title = {Constrained Quantum Optimization Algorithm},
	url = {https://m2.mtmt.hu/api/publication/32172981},
	author = {EL GAILY, SARA and Imre, Sándor},
	booktitle = {2021 20th International Symposium INFOTEH-JAHORINA (INFOTEH)},
	doi = {10.1109/INFOTEH51037.2021.9400679},
	unique-id = {32172981},
	year = {2021},
	orcid-numbers = {Imre, Sándor/0000-0002-2883-8919}
}

@misc{MTMT:31361931,
	title = {Energiahatékony útválasztás IoT környezetben},
	url = {https://m2.mtmt.hu/api/publication/31361931},
	author = {Pásztor, Dániel and Ekler, Péter and Levendovszky, János},
	unique-id = {31361931},
	year = {2020},
	orcid-numbers = {Levendovszky, János/0000-0003-1406-442X}
}

@article{MTMT:31335613,
	title = {Real-time Processing System for a Quantum Random Number Generator},
	url = {https://m2.mtmt.hu/api/publication/31335613},
	author = {Solymos, Balázs and Bacsárdi, László},
	doi = {10.36244/ICJ.2020.1.8},
	journal-iso = {INFOCOMM J},
	journal = {INFOCOMMUNICATIONS JOURNAL},
	volume = {12},
	unique-id = {31335613},
	issn = {2061-2079},
	abstract = {Quantum random number generators (QRNG) provide quality random numbers, which are essential for cryptography by utilizing the unpredictable nature of quantum mechanics. Advancements in quantum optics made multiple different architectures for these possible. As part of a project aiming to realize a QRNG service, we developed a system capable of providing real-time monitoring and long term data collection while still fulfilling regular processing duties for these devices. In most cases, hardware validation is done by simply running a battery of statistical tests on the final output. Our goal, however, was to create a system allowing more flexible use of these tests, realizing a tool that can also prove useful during the construction of our entropy source for detecting and correcting unique imperfections. We tested this flexibility and the system’s ability to adequately perform the required tasks with simulated sources while further examining the usability of available verification tools within this new custom framework.},
	year = {2020},
	eissn = {2061-2125},
	pages = {53-59},
	orcid-numbers = {Bacsárdi, László/0000-0002-7337-317X}
}

@inproceedings{MTMT:32470358,
	title = {Invitation-oriented TGDH: Key management for dynamic groups in an asynchronous communication model},
	url = {https://m2.mtmt.hu/api/publication/32470358},
	author = {Lám, I. and Szebeni, S. and Buttyán, Levente},
	booktitle = {41st International Conference on Parallel Processing Workshops, ICPPW 2012},
	doi = {10.1109/ICPPW.2012.40},
	unique-id = {32470358},
	abstract = {In this paper, we propose a suite of group key management protocols that allows a group of users to agree on a shared group key, which can be used to protect a shared file system stored remotely in the cloud. Our protocols support the refreshment of the group key at each group membership modification. Compared to other similar solutions, the key novelty of our protocols is that they require asynchronous communication channels, and only constant number of exponentiations on average, worst case logarithmic number of exponentiations even if membership modifications are controlled by arbitrary user. Moreover, our scheme is fully decentralized, and its design is led by a practical, invitation-oriented approach. © 2012 IEEE.},
	keywords = {INFORMATION THEORY; Technical presentations; asynchronous communication; Exponentiations; group key; Key management; Group memberships; Similar solution; self-balancing; File systems; Dynamic groups; Dynamic groups; group-key agreement; self-balancing key-tree; Asynchronous communication model; Group key management protocols},
	year = {2012},
	pages = {269-276}
}

@inproceedings{MTMT:32470356,
	title = {Tresorium: Cryptographic file system for dynamic groups over untrusted cloud storage},
	url = {https://m2.mtmt.hu/api/publication/32470356},
	author = {Lám, I. and Szebeni, S. and Buttyán, Levente},
	booktitle = {41st International Conference on Parallel Processing Workshops, ICPPW 2012},
	doi = {10.1109/ICPPW.2012.44},
	unique-id = {32470356},
	abstract = {In this paper, we present Tresorium, a cryptographic file system designed for cloud based data storage. In Tresorium, files are encrypted before they are uploaded to the cloud storage providers, therefore, not even the cloud storage providers can access the users' data. Yet, Tresorium allows the sharing files within a group of users by using an underlying group key agreement protocol. A key feature of Tresorium is that it handles changes in group membership and modification of files in an extremely efficient manner, thanks to the usage of so called key-lock-boxes and a lazy re-encryption approach. Finally, Tresorium supports an ACL-like abstraction, so it is easy to use. We describe Tresorium, and analyze its security and performance. We also present some simulation results that clearly show the efficiency of the proposed system. © 2012 IEEE.},
	keywords = {data storage; Key feature; Cryptography; Digital storage; Security and performance; Collaborative work; Collaborative work; Group memberships; Cryptographic File System; Dynamic groups; Dynamic groups; Untrusted Cloud; Cryptographic file systems; Group Key Agreement protocols; Re-encryption},
	year = {2012},
	pages = {296-303}
}

@article{MTMT:2690255,
	title = {Acceptance-rejection methods for generating random variates from matrix exponential distributions and rational arrival processes},
	url = {https://m2.mtmt.hu/api/publication/2690255},
	author = {Horváth, Gábor and Telek, Miklós},
	doi = {10.1145/2185395.2185413},
	journal-iso = {SIGMETR PERFORM EVAL REV},
	journal = {SIGMETRICS PERFORMANCE EVALUATION REVIEW},
	volume = {39},
	unique-id = {2690255},
	issn = {0163-5999},
	year = {2012},
	eissn = {1557-9484},
	pages = {27-27},
	orcid-numbers = {Horváth, Gábor/0000-0003-3097-1273; Telek, Miklós/0000-0001-9600-6084}
}

@inproceedings{MTMT:2689865,
	title = {A Multi-layer Fluid Queue with Boundary Phase Transitions and Its Application to the Analysis of Multi-type Queues with General Customer Impatience},
	url = {https://m2.mtmt.hu/api/publication/2689865},
	author = {Horváth, Gábor and Van Houdt, Benny},
	booktitle = {Proceedings - 2012 9th International Conference on Quantitative Evaluation of Systems, QEST 2012},
	doi = {10.1109/QEST.2012.12},
	unique-id = {2689865},
	year = {2012},
	pages = {23-32},
	orcid-numbers = {Horváth, Gábor/0000-0003-3097-1273}
}

@{MTMT:2688378,
	title = {A hőmérséklet és a csapadék hatása a bükk növekedésére},
	url = {https://m2.mtmt.hu/api/publication/2688378},
	author = {Manninger, Miklós and Edelényi, Márton and Pödör, Zoltán and Jereb, László Tibor},
	booktitle = {Magyar Meteorológiai Társaság XXXIV. Vándorgyűlés és VII. Erdő és Klíma Konferencia},
	unique-id = {2688378},
	year = {2012},
	pages = {45-46},
	orcid-numbers = {Pödör, Zoltán/0000-0001-5557-5643; Jereb, László Tibor/0000-0002-1613-4981}
}

@article{MTMT:2688291,
	title = {Efficient analysis of the queue length moments of the MMAP/MAP/1 preemptive priority queue},
	url = {https://m2.mtmt.hu/api/publication/2688291},
	author = {Horváth, Gábor},
	doi = {10.1016/j.peva.2012.08.003},
	journal-iso = {PERFORM EVALUATION},
	journal = {PERFORMANCE EVALUATION},
	volume = {69},
	unique-id = {2688291},
	issn = {0166-5316},
	keywords = {Matrix geometric methods; Queue length moments; Marked MAP; Preemptive priority queue},
	year = {2012},
	eissn = {1872-745X},
	pages = {684-700},
	orcid-numbers = {Horváth, Gábor/0000-0003-3097-1273}
}