@article {16778,
	title = {Partial Pre-Image Attack on Proof-of-Work based Blockchains},
	journal = {Blockchain: Research and Applications},
	year = {2024},
	abstract = {Blockchain (BC) is the type of distributed ledger technology that consists of a growing list of records, called blocks, that are securely linked together using cryptography. Each BC-based solution deploys a specific consensus algorithm that guarantees the consistency of the ledger over time. The most famous, and yet claimed to be the most secure, is the Proof-of-Work (PoW) consensus algorithm. In this paper,we revisit the fundamental calculations and assumptions of this algorithm, originally presented in the Bitcoin white paper. We break down its claimed calculations, in order to better understand the underlying assumptions of the proposal. We also propose a novel formalization model of the PoW mining problem using the Birthday paradox. We utilize this model to formalize and analyze Partial Pre-Image attacks on PoW-based BCs, with formal analysis that confirmed the experimental results and the previously proposed implications. We build on those analyses and propose new concepts for benchmarking the security of PoW-based systems, including Critical Difficulty and Critical Difficulty per given portion. Our calculations resulted in several important findings including the profitability of launching Partial Pre-Image attacks on PoW-based BCs, once the mining puzzle difficulty reaches a given threshold. Specifically, for any compromised portion of the network (q < 0.5; honest majority assumption still holds), the attack was formally proven profitable, once the PoW mining puzzle difficulty reaches 56 leading zeros.},
	keywords = {Blockchain, Hash functions, Partial pre-image attack, Proof-of-Work, Security},
	doi = {10.1016/j.bcra.2024.100194},
	url = {https://www.sciencedirect.com/science/article/pii/S2096720924000071},
	author = {Baniata, Hamza and Kert{\'e}sz, Attila}
}
@article {MTMT:33082972,
	title = {Premorbid screening of healthy students may carry latent liability for schizophrenia or bipolar affective disorder with neurocognitive and neurophenomenological methods},
	journal = {EUROPEAN PSYCHIATRY},
	volume = {65},
	year = {2022},
	pages = {S683-S683},
	issn = {0924-9338},
	doi = {10.1192/j.eurpsy.2022.1758},
	url = {https://m2.mtmt.hu/api/publication/33082972},
	author = {Szendi, Istv{\'a}n and Bagi, Anita and Szal{\'o}ki, Szilvia and Hallgat{\'o}, Emese and Domj{\'a}n, N{\'o}ra and Kanka, Andor and G{\'a}l, Bernadett Ildik{\'o} and Karcher, {\'E}va and P{\'a}sztor, H and Jenei, T and B{\'o}na, Orsolya and Kov{\'a}cs, Csenge and Pejin, Andrea and Dar{\'o}czy, Judit and Di{\'o}si, {\'A} and Pajkossy, P{\'e}ter and Polner, Bertalan Krist{\'o}f and Demeter, Gyula and Racsm{\'a}ny, Mih{\'a}ly and Baradits, M{\'a}t{\'e} and B{\'u}z{\'a}s, And{\'a}s and D{\'e}r, Andr{\'a}s and Gingl, Zolt{\'a}n and Tibor Gyim{\'o}thy}
}
@article {16780,
	title = {PriFoB: A Privacy-aware Fog-enhanced Blockchain-based system for Global Accreditation and Credential Verification},
	journal = {Journal of Network and Computer Applications},
	volume = {205},
	year = {2022},
	abstract = {Trusted online credential management solutions are needed for instant and practical verification. Most of the available frameworks targeting this field violate the privacy of end-users or lack sufficient solutions in terms of security and Quality-of-Service (QoS). In this paper, we propose a Privacy-aware Fog-enhanced Blockchain-based online credential management solution, namely PriFoB. Our proposed solution adopts a public permissioned Blockchain model with different reliable encryption schemes, standardized Zero-Knowledge-Proofs (ZKPs) and Digital Signatures (DSs) within a Fog{\textendash}Blockchain integrated framework, which is also GDPR compliant. We deploy both the Proof-of-Authority (PoA) and the Signatures-of-Work (SoW) consensus algorithms for efficient and secure handling of Verifiable Credentials (VCs) and global accreditation of VC issuers, respectively. Furthermore, we propose a novel three-dimensional DAG-based model of the Distributed Ledger (3DDL), and provide a ready-to-deploy PriFoB implementation. We discuss insights regarding the utilization and the potential of PriFoB, and evaluate it in terms of security, privacy, latency, throughput and power utilization. We analyze its performance in different layers of a Fog-enabled cloud architecture with simulation and emulation, and we show that PriFoB outperforms several Blockchain-based solutions utilizing Ethereum, Hyperledger Fabric, Hyperledger Besu and Hyperledger Indy platforms.},
	keywords = {Blockchain, Credential Verification, fog computing, Global accreditation, Privacy, Self Sovereign Identity (SSI)},
	issn = {1084-8045},
	doi = {https://doi.org/10.1016/j.jnca.2022.103440},
	url = {https://www.sciencedirect.com/science/article/pii/S1084804522000935},
	author = {Hamza Baniata and Attila Kert{\'e}sz}
}
@conference {Baniata2020430,
	title = {PF-BVM: A Privacy-aware fog-enhanced blockchain validation mechanism},
	booktitle = {CLOSER 2020 - Proceedings of the 10th International Conference on Cloud Computing and Services Science},
	year = {2020},
	note = {cited By 1},
	pages = {430-439},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85088384191\&partnerID=40\&md5=88797bf98995c723f4596a2860371160},
	author = {Baniata, H. and Kertesz, A.}
}
@article {MTMT:31336850,
	title = {A public unified bug dataset for java and its assessment regarding metrics and bug prediction},
	journal = {SOFTWARE QUALITY JOURNAL},
	volume = {28},
	year = {2020},
	pages = {1447-1506},
	abstract = {Bug datasets have been created and used by many researchers to build and validate novel bug prediction models. In this work, our aim is to collect existing public source code metric-based bug datasets and unify their contents. Furthermore, we wish to assess the plethora of collected metrics and the capabilities of the unified bug dataset in bug prediction. We considered 5 public datasets and we downloaded the corresponding source code for each system in the datasets and performed source code analysis to obtain a common set of source code metrics. This way, we produced a unified bug dataset at class and file level as well. We investigated the diversion of metric definitions and values of the different bug datasets. Finally, we used a decision tree algorithm to show the capabilities of the dataset in bug prediction. We found that there are statistically significant differences in the values of the original and the newly calculated metrics; furthermore, notations and definitions can severely differ. We compared the bug prediction capabilities of the original and the extended metric suites (within-project learning). Afterwards, we merged all classes (and files) into one large dataset which consists of 47,618 elements (43,744 for files) and we evaluated the bug prediction model build on this large dataset as well. Finally, we also investigated cross-project capabilities of the bug prediction models and datasets. We made the unified dataset publicly available for everyone. By using a public unified dataset as an input for different bug prediction related investigations, researchers can make their studies reproducible, thus able to be validated and verified.},
	keywords = {Bug dataset, Bug prediction, Code metrics, Static code analysis},
	issn = {0963-9314},
	doi = {10.1007/s11219-020-09515-0},
	url = {https://m2.mtmt.hu/api/publication/31336850},
	author = {Ferenc, Rudolf and T{\'o}th, Zolt{\'a}n G{\'a}bor and Lad{\'a}nyi, Gergely and Siket, Istv{\'a}n and Tibor Gyim{\'o}thy}
}
@article {MTMT:3328346,
	title = {Prediction models for performance, power, and energy efficiency of software executed on heterogeneous hardware},
	journal = {JOURNAL OF SUPERCOMPUTING},
	volume = {75},
	year = {2019},
	pages = {4001-4025},
	abstract = {Heterogeneous computer environments are becoming commonplace so it is increasingly important to understand how and where we could execute a given algorithm the most efficiently. In this paper we propose a methodology that uses both static source code metrics, and dynamic execution time, power, and energy measurements to build gain ratio prediction models. These models are trained on special benchmarks that have both sequential and parallel implementations and can be executed on various computing elements, e.g., on CPUs, GPUs, or FPGAs. After they are built, however, they can be applied to a new system using only the system{\textquoteright}s static source code metrics which are much more easily computable than any dynamic measurement. We found that while estimating a continuous gain ratio is a much harder problem, we could predict the gain category (e.g., {\textquotedblleft}slight improvement{\textquotedblright} or {\textquotedblleft}large deterioration{\textquotedblright}) of porting to a specific configuration significantly more accurately than a random choice, using static information alone. We also conclude based on our benchmarks that parallelized implementations are less maintainable, thereby supporting the need for automatic transformations.},
	issn = {0920-8542},
	doi = {10.1007/s11227-018-2252-6},
	url = {https://m2.mtmt.hu/api/publication/3328346},
	author = {B{\'a}n, D{\'e}nes and Ferenc, Rudolf and Siket, Istv{\'a}n and Kiss, {\'A}kos and Tibor Gyim{\'o}thy}
}
@article {ban2018prediction,
	title = {Prediction Models for Performance, Power, and Energy Efficiency of Software Executed on Heterogeneous Hardware},
	journal = {Journal of Supercomputing},
	year = {2018},
	note = {(Accepted for publication.)},
	pages = {25},
	publisher = {springer},
	author = {B{\'a}n, D{\'e}nes and Rudolf Ferenc and Siket, Istv{\'a}n and {\'A}kos Kiss and Tibor Gyim{\'o}thy}
}
@conference {Pflanzner2016282,
	title = {Performance analysis of an openstack private cloud},
	booktitle = {CLOSER 2016 - Proceedings of the 6th International Conference on Cloud Computing and Services Science},
	volume = {2},
	year = {2016},
	note = {cited By 1},
	pages = {282-289},
	keywords = {select:cloud},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979544396\&partnerID=40\&md5=92478a567bf7de658d9b6c70ec903b24},
	author = {Pflanzner, T. and Tornyai, R. and Gibizer, B. and Schmidt, A. and Attila Kert{\'e}sz}
}
@article {Kertesz201641,
	title = {A Pliant-based Virtual Machine Scheduling Solution to Improve the Energy Efficiency of IaaS Clouds},
	journal = {Journal of Grid Computing},
	volume = {14},
	number = {1},
	year = {2016},
	note = {cited By 0},
	pages = {41-53},
	doi = {10.1007/s10723-015-9336-9},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84928623040\&doi=10.1007\%2fs10723-015-9336-9\&partnerID=40\&md5=d9b31d1217fd1528c28baa3fdff354be},
	author = {Attila Kert{\'e}sz and J D Dombi and Benyi, A.}
}
@conference {hodovan2016pardd,
	title = {Practical Improvements to the Minimizing Delta Debugging Algorithm},
	booktitle = {Proceedings of the 11th International Joint Conference on Software Technologies (ICSOFT 2016) {\textendash} Volume 1: ICSOFT-EA},
	year = {2016},
	pages = {241{\textendash}248},
	address = {Lisbon, Portugal},
	keywords = {select:itsec2},
	author = {Hodov{\'a}n, Ren{\'a}ta and {\'A}kos Kiss}
}
@article {NSTWNH2016,
	title = {A programoz{\'a}s oktat{\'a}s{\'a}nak motiv{\'a}ci{\'o}i a k{\"o}zoktat{\'a}sban},
	journal = {INFODIDACT 2016 Informatika Szakm{\'o}dszertani Konferencia elektronikus kiadv{\'a}nya (DVD)},
	year = {2016},
	pages = {1{\textendash}7},
	address = {Zam{\'a}rdi, Hungary},
	author = {N{\'e}meth, Tam{\'a}s and S{\'a}rk{\'a}ny, Rita and Tornai, Henrietta and Wiandt, Zs{\'o}fia and N{\'e}meth-Szabados, Kl{\'a}ra Vikt{\'o}ria and Holl{\'o}, Csaba}
}
@conference {TGF16,
	title = {A Public Bug Database of {GitHub} Projects and Its Application in Bug Prediction},
	booktitle = {Proceedings of the 16th International Conference on Computational Science and Its Applications (ICCSA 2016)},
	year = {2016},
	pages = {625{\textendash}638},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Beijing, China},
	abstract = {Detecting defects in software systems is an evergreen topic, since there is no real world software without bugs. Many different bug locating algorithms have been presented recently that can help to detect hidden and newly occurred bugs in software. Papers trying to predict the faulty source code elements or code segments in the system always use experience from the past. In most of the cases these studies construct a database for their own purposes and do not make the gathered data publicly available. Public datasets are rare; however, a well constructed dataset could serve as a benchmark test input. Furthermore, open-source software development is rapidly increasing that also gives an opportunity to work with public data. In this study we selected 15 Java projects from GitHub to construct a public bug database from. We matched the already known and fixed bugs with the corresponding source code elements (classes and files) and calculated a wide set of product metrics on these elements. After creating the desired bug database, we investigated whether the built database is usable for bug prediction. We used 13 machine learning algorithms to address this research question and finally we achieved F-measure values between 0.7 and 0.8. Beside the F-measure values we calculated the bug coverage ratio on every project for every machine learning algorithm. We obtained very high and promising bug coverage values (up to 100\%).},
	keywords = {Bug database, Bug prediction},
	doi = {10.1007/978-3-319-42089-9_44},
	url = {https://link.springer.com/chapter/10.1007\%2F978-3-319-42089-9_44},
	author = {T{\'o}th, Zolt{\'a}n and Gyimesi, P{\'e}ter and Rudolf Ferenc}
}
@article {USH15,
	title = {Performance Comparison of Query-based Techniques for Anti-pattern Detection},
	journal = {Information and Software Technology},
	volume = {65},
	number = {C},
	year = {2015},
	month = {sep},
	pages = {147{\textendash}165},
	abstract = {Context Program queries play an important role in several software evolution tasks like program comprehension, impact analysis, or the automated identification of anti-patterns for complex refactoring operations. A central artifact of these tasks is the reverse engineered program model built up from the source code (usually an Abstract Semantic Graph, ASG), which is traditionally post-processed by dedicated, hand-coded queries. Objective Our paper investigates the costs and benefits of using the popular industrial Eclipse Modeling Framework (EMF) as an underlying representation of program models processed by four different general-purpose model query techniques based on native Java code, OCL evaluation and (incremental) graph pattern matching. Method We provide in-depth comparison of these techniques on the source code of 28 Java projects using anti-pattern queries taken from refactoring operations in different usage profiles. Results Our results show that general purpose model queries can outperform hand-coded queries by 2{\textendash}3 orders of magnitude, with the trade-off of an increased in memory consumption and model load time of up to an order of magnitude. Conclusion The measurement results of usage profiles can be used as guidelines for selecting the appropriate query technologies in concrete scenarios.},
	keywords = {Anti-patterns, Columbus, EMF-IncQuery, OCL, Performance measurements, refactoring},
	issn = {0950-5849},
	doi = {10.1016/j.infsof.2015.01.003},
	url = {http://www.sciencedirect.com/science/article/pii/S0950584915000051?via\%3Dihub},
	author = {Ujhelyi, Zolt{\'a}n and Sz{\H o}ke, G{\'a}bor and Horv{\'a}th, {\'A}kos and Csisz{\'a}r, Norbert Istv{\'a}n and L{\'a}szl{\'o} Vid{\'a}cs and Varr{\'o}, D{\'a}niel and Rudolf Ferenc}
}
@conference {BFS15,
	title = {Prediction Models for Performance, Power, and Energy Efficiency of Software Executed on Heterogeneous Hardware},
	booktitle = {Proceedings of the 13th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2015)},
	year = {2015},
	month = {aug},
	pages = {178{\textendash}183},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Helsinki, Finland},
	abstract = {Heterogeneous environments are becoming commonplace so it is increasingly important to understand how and where we could execute a given algorithm the most efficiently. In this paper we propose a methodology that uses both static source code metrics and dynamic execution time, power and energy measurements to build configuration prediction models. These models are trained on special benchmarks that have both sequential and parallel implementations and can be executed on various computing elements, e.g., on CPUs or GPUs. After they are built, however, they can be applied to a new system using only the system{\textquoteright}s static metrics which are much more easily computable than any dynamic measurement. We found that we could predict the optimal execution configuration fairly accurately using static information alone.},
	keywords = {configuration selection, Green computing, heterogeneous architecture, performance optimization, power-aware execution},
	doi = {10.1109/Trustcom.2015.629},
	url = {http://ieeexplore.ieee.org/document/7345645/},
	author = {D{\'e}nes B{\'a}n and Rudolf Ferenc and Istv{\'a}n Siket and {\'A}kos Kiss}
}
@article {16348,
	title = {A probabilistic quality model for c$\#$ - an industrial case study},
	journal = {ACTA CYBERNETICA - SZEGED},
	volume = {21},
	year = {2013},
	pages = {135{\textendash}147},
	issn = {0324-721X},
	author = {P Heged{\H u}s}
}
@conference {16310,
	title = {Prediction of Software Development Modification Effort Enhanced by a Genetic Algorithm},
	year = {2012},
	author = {{\'A}rp{\'a}d Besz{\'e}des and {\'A}. Z. V{\'e}gh and Gerg{\H o} Balogh}
}
@conference {16307,
	title = {Predictive Complex Event Processing},
	booktitle = {Proceedings of the 5th Balkan Conference in Informatics},
	year = {2012},
	pages = {26{\textendash}31},
	publisher = {ACM Press},
	organization = {ACM Press},
	address = {New York},
	author = {F{\"u}l{\"o}p, L.J. and T{\'o}th, G. and L{\'a}szl{\'o} Vid{\'a}cs and {\'A}rp{\'a}d Besz{\'e}des and Demeter, H. and Farkas, L. and Tibor Gyim{\'o}thy and Gerg{\H o} Balogh},
	editor = {M. Ivanovic and Z. Budimac}
}
@conference {16332,
	title = {A Probabilistic Software Quality Model for C$\#$ {\textendash} an Industrial Case Study},
	year = {2012},
	publisher = {Department of Informatics, University of Szeged},
	organization = {Department of Informatics, University of Szeged},
	author = {P Heged{\H u}s}
}
@conference {16301,
	title = {A pszichi{\'a}triai betegek adatv{\'e}delme},
	booktitle = {Pszichi{\'a}triai gondoz{\'a}si k{\'e}zik{\"o}nyv},
	year = {2012},
	pages = {185{\textendash}219},
	publisher = {Oriold {\'e}s T{\'a}rsai Kiad{\'o}},
	organization = {Oriold {\'e}s T{\'a}rsai Kiad{\'o}},
	address = {Budapest},
	author = {Z. Alexin},
	editor = {Enik{\H o} V{\'a}radi}
}
@conference {FNF11a,
	title = {Passive vs. Active Measurement: the Role of Smart Sensors},
	booktitle = {Third International Workshop on Pervasive Computing in Embedded Systems},
	year = {2011},
	pages = {333-337},
	author = {M. Kasza and V. Sz{\H u}cs and {\'A}. Z. V{\'e}gh and T. T{\"o}r{\"o}k}
}
@article {Alexin11a,
	title = {Paternalista adatv{\'e}delem},
	journal = {N{\'e}pszabads{\'a}g},
	year = {2011},
	author = {Z. Alexin}
}
@conference {6080791,
	title = {A probabilistic software quality model},
	booktitle = {Software Maintenance (ICSM), 2011 27th IEEE International Conference on},
	year = {2011},
	month = {sept.},
	pages = {243 -252},
	keywords = {cost estimation, costing, development cost, IEC standards, ISO standards, ISO/IEC 9126 standard, maintainability, probabilistic software quality model, probability, risk estimation, select:quality, software change, software maintenance, software quality, software quality selected},
	issn = {1063-6773},
	doi = {10.1109/ICSM.2011.6080791},
	author = {Tibor Bakota and P Heged{\H u}s and K{\"o}rtv{\'e}lyesi, P and Rudolf Ferenc and Tibor Gyim{\'o}thy}
}
@booklet {ViRa10,
	title = {Peces - Pervasive Computing in Embedded Systems},
	year = {2010},
	note = {ICAI 2010 T{\'a}mogat{\'o}k visszal{\'e}p{\'e}se miatt nem jelent meg},
	author = {V. Bilicki and Z. Rak}
}
@conference {BFG09,
	title = {Predicting Critical Problems from Execution Logs of a Large-Scale Software System},
	booktitle = {Proceedings of the 11th Symposium on Programming Languages and Software Tools and 7th Nordic Workshop on Model Driven Software Engineering (SPLST{\textquoteright}09)},
	year = {2009},
	month = {aug},
	pages = {19-30},
	author = {{\'A}rp{\'a}d Besz{\'e}des and F{\"u}l{\"o}p, L.J. and Tibor Gyim{\'o}thy}
}
@mastersthesis {kiss:pcam,
	title = {Program Code Analysis and Manipulation},
	year = {2009},
	type = {phd},
	author = {{\'A}kos Kiss}
}
@conference {BiDo06,
	title = {Paxos with multiple leaders},
	booktitle = {Volume of Extended Abstracts of the 5th Conference of PhD Students in Computer Science},
	year = {2006},
	pages = {28},
	author = {V. Bilicki and J D Dombi}
}
@conference {ACsGy04,
	title = {Programcsomag inform{\'a}ci{\'o}kinyer{\'e}si kutat{\'a}sok t{\'a}mogat{\'a}s{\'a}ra},
	booktitle = {II. Magyar Sz{\'a}m{\'\i}t{\'o}g{\'e}pes Nyelv{\'e}szeti Konferencia},
	year = {2004},
	month = {dec},
	pages = {41-49},
	author = {Z. Alexin and J. Csirik and Tibor Gyim{\'o}thy}
}
@article {Hollo03,
	title = {A partial enumeration algorithm for solving {PNS} problems},
	journal = {Mathematical and Computer Modelling},
	volume = {38},
	number = {7-9},
	year = {2003},
	pages = {855-864},
	author = {Cs. Holl{\'o}}
}
@conference {SzGy03,
	title = {Precise static slicing of constraint logic programs},
	booktitle = {Kalm{\'a}r Workshop on Logic and Computer Science},
	year = {2003},
	month = {oct},
	pages = {153-164},
	author = {Gy. Szil{\'a}gyi and Tibor Gyim{\'o}thy}
}
@article {ANA02,
	title = {{PACS} at the University of Szeged},
	journal = {Magyar Radiol{\'o}gia},
	volume = {76},
	number = {4},
	year = {2002},
	pages = {161},
	author = {L. Alm{\'a}si and A. Nagy and Z. Alexin and O. Gyuris and A. Kuba and L. Csernay}
}
@article {Hollo02,
	title = {A Procedure Based on Automaton Theory Approach for Solving Modified PNS Problems},
	journal = {Pure Mathematics and Applications},
	volume = {13},
	number = {1-2},
	year = {2002},
	pages = {159-169},
	author = {Cs. Holl{\'o}}
}
@article {SGyA98,
	title = {Parallel execution of object functional queries},
	journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando Eotvos Nominatae Sectio Computarotica},
	volume = {17},
	year = {1998},
	pages = {339-355},
	author = {Schrettner, L. and Tibor Gyim{\'o}thy and Z. Alexin and J. Tocki}
}
@conference {NNyK97a,
	title = {Problems and Solutions: One Year Experience with SZOTE-PACS},
	booktitle = {Proceedings of EuroPACS {\textquoteright}97},
	year = {1997},
	month = {sep},
	pages = {39-42},
	author = {A. Nagy and L. Ny{\'u}l and A. Kuba and Z. Alexin and L. Alm{\'a}si}
}
@conference {SGyA95,
	title = {Parallel execution of object functional queries},
	booktitle = {Fourth Symposium on Programming Languages and Software Tools},
	year = {1995},
	month = {jun},
	pages = {447-459},
	author = {Schrettner, L. and Tibor Gyim{\'o}thy and Z. Alexin and J. Toczki}
}
@conference {SchBo94,
	title = {A Parallel Design Method for Producing Valid Protocols},
	booktitle = {Proc. of 8th Symposium on Microcomputer and Microprocessor Applications},
	year = {1994},
	month = {oct},
	pages = {689-697},
	author = {Schrettner, L. and M. Bohus}
}
@booklet {TGyH87,
	title = {{PROF-LP user{\textquoteright}s guide}},
	year = {1987},
	author = {J. Toczki and Tibor Gyim{\'o}thy and T. Horv{\'a}th and Kocsis, F.}
}
