DC FieldValueLanguage
dc.contributor.authorDavidović, Tatjanaen_US
dc.contributor.authorUrošević, Draganen_US
dc.contributor.authorJakšić Kruger, Tatjanaen_US
dc.contributor.authorMatijević, Lukaen_US
dc.contributor.authorJovanović, Đorđeen_US
dc.contributor.authorTodorović, Milanen_US
dc.contributor.authorRamljak, Dušanen_US
dc.date.accessioned2022-12-09T10:55:46Z-
dc.date.available2022-12-09T10:55:46Z-
dc.date.issued2022-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4921-
dc.description.abstractBlockChain (BC) is a specially designed distributed public data structure, maintained without any third party of absolute trust by the so-called consensus protocol. Besides the financial applications, BC can be utilized in different domains (digital identity, voting, IoT, insurance, healthcare, etc.). BC consists of a list of blocks containing data (referred to as "committed transactions") that are allowed to be added simultaneously. The main issues in maintaining BC are security, privacy, consistency, and reducing the consumption of electrical energy. We aim to contribute toward overcoming these issues by applying Artificial Intelligence (AI) tools. First we optimize usage of resources by developing a new consensus protocol, named Proof-of-Useful-Work (PoUW), based on combinatorial optimization (CO) that enables miners to be doubly rewarded: for creating blocks and solving submitted CO instances. The second contribution aims to improve security in BC by examining the anonymity level of the participants, having in mind that the corresponding transactions are usually publicly available. This task reduces to classification/clustering of transactions according to some criteria.en_US
dc.subjectdistributed databases | consensus protocols | metaheuristics | artificial intelligenceen_US
dc.titleCombinatorial Optimization for Efficient and Trustful Blockchainen_US
dc.typeConference Paperen_US
dc.relation.conference19th International Conference on Operational Research, KOI 2022, Šibenik, Croatia, Sept. 28-30, 2022en_US
dc.relation.publicationBook of Abstractsen_US
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage29-
dc.description.rankM34-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.author.orcid0000-0001-6766-4811-
crisitem.author.orcid0000-0002-4575-6720-
crisitem.author.orcid0000-0003-1222-1292-
crisitem.author.orcid0000-0002-7741-061X-
Show simple item record

Page view(s)

92
checked on May 9, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.