Tugçe KalkavanAhmet Hasan KoltuksuzKalkavan, TugceKoltuksuz, Ahmet2025-10-062013978146736420197814673641952378-82322472-858610.1109/ICAICT.2013.67227592-s2.0-84894166190https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894166190&doi=10.1109%2FICAICT.2013.6722759&partnerID=40&md5=8b48bf2ecf94b43e2fb6a2c6fdcf3b6dhttps://gcris.yasar.edu.tr/handle/123456789/10132https://doi.org/10.1109/ICAICT.2013.6722759The purpose of this research is to develop more secure and faster identification of dishonest nodes for key sharing systems. Mathematical background of finding dishonest node express simple and efficient technique that can be used in the key sharing systems. With the distributed key generation each node has equal responsibility for creating distributed private key thus the identification of dishonest node becomes possible. With the identification of dishonest mode comes the recognition of legitimate and/or illegitimate parties as well. © 2013 IEEE. © 2014 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessDistributed Key Generation, Private-key Generator, Proactive Verifiable Secret Sharing, Verifiable Secret Sharing, Distributed Key Generation, Key Sharing, Node Identifications, Private-key, Verifiable Secret Sharing, Information TechnologyDistributed key generation, Key sharing, Node identifications, Private-key, Verifiable secret sharing, Information technologyDistributed Key GenerationPrivate-Key GeneratorProactive Verifiable Secret SharingVerifiable Secret SharingConference Object