Showing papers by "Andrei V. Kelarev published in 2022"
TL;DR: In this paper , the authors survey known results on enhanced power graphs of finite groups and open problems, questions and suggestions for future work are also included, as well as some open problems.
Abstract: We survey known results on enhanced power graphs of finite groups. Open problems, questions and suggestions for future work are also included.
8 citations
2 citations
TL;DR: The paper promises to bring a deep insight into the state-of-the-art Blockchain platforms, namely Ethereum, Hyperledger, and IOTA, to exhibit the respective challenges, constraints, and prospects in terms of performance and scalability.
Abstract: : Blockchain has recently been able to draw wider attention throughout the research commu- 1 nity. Since its emergence, the world has seen the mind-blowing expansion of this new technology, 2 which was initially developed as a pawn of digital currency more than a decade back. A self- 3 administering ledger that ensures extensive data immutability over the peer-to-peer network has 4 made it attractive for cybersecurity applications such as a sensor-enabled system called the Internet of 5 things (IoT). Brand new challenges and questions now demand solutions as huge IoT devices are now 6 online in a distributed fashion to ease our everyday lives. After being motivated by those challenges, 7 the work here has figured out the issues and perspectives an IoT infrastructure can suffer because of 8 the wrong choice of blockchain technology. Though it may look like a typical review, however, unlike 9 that, this paper targets sorting out the specific security challenges of the blockchain-IoT eco-system 10 through critical findings and applicable use-cases. Therefore, the contribution includes directing 11 Blockchain architects, designers, and researchers in the broad domain to select the unblemished 12 combinations of Blockchain-powered IoT applications. In addition, the paper promises to bring 13 a deep insight into the state-of-the-art Blockchain platforms, namely Ethereum, Hyperledger, and 14 IOTA, to exhibit the respective challenges, constraints, and prospects in terms of performance and 15 scalability.
1 citations
TL;DR: Rigorous formal security proofs are given which guarantee that the conditions obtained ensure the preservation of privacy of confidential data in two new classes of aggregated nonlinear queries.
Abstract: An important direction of informatics is devoted to the protection of privacy of confidential information while providing answers to aggregated queries that can be used for analysis of data. Protecting privacy is especially important when aggregated queries are used to combine personal information stored in several databases that belong to different owners or come from different sources. Malicious attackers may be able to infer confidential information even from aggregated numerical values returned as answers to queries over large collections of data. Formal proofs of security guarantees are important, because they can be used for implementing practical systems protecting privacy and providing answers to aggregated queries. The investigation of formal conditions which guarantee protection of private information against inference attacks originates from a fundamental result obtained by Chin and Ozsoyoglu in 1982 for linear queries. The present paper solves similar problems for two new classes of aggregated nonlinear queries. We obtain complete descriptions of conditions, which guarantee the protection of privacy of confidential information against certain possible inference attacks, if a collection of queries of this type are answered. Rigorous formal security proofs are given which guarantee that the conditions obtained ensure the preservation of privacy of confidential data. In addition, we give necessary and sufficient conditions for the protection of confidential information from special inference attacks aimed at achieving a group compromise.
TL;DR: In this article , the authors proposed two solutions to the problem of efficient and privacy-preserving computation of distributed queries with the protection of outcomes from active outsider attackers for a new large class of distributed statistical or numerical queries.
Abstract: Abstract Privacy-enhancing techniques and protocols for data aggregation and analytics in wireless networks require the development of novel methods for efficient and privacy-preserving computation of distributed queries with the protection of outcomes from active attackers. Previous approaches to secure privacy-preserving computation of distributed queries incur significant communication overhead and cannot be applied to big data. This paper proposes two solutions to the problem of efficient and privacy-preserving computation of distributed queries with the protection of outcomes from active outsider attackers for a new large class of distributed statistical or numerical queries. This class contains many useful statistics and is larger than other classes considered in the literature previously. We propose two protocols for the Protection of data from Active Attackers (PAA) in the case of distributed privacy-preserving computation: PAA applying Shamir’s Secret Sharing (PAA-SSS) and PAA applying homomorphic encryption (PAA-HE). The PAA-HE protocol combines the use of ElGamal and Paillier encryption schemes in one system. Theoretical analysis and experimental results show that both protocols outperform alternative approaches. PAA-HE provides stronger protection and is more efficient than PAA-SSS.