Advances in Science and Technology Vol. 124

Abstract: Rock, paper, scissors (RPS) is a game of crucial decision-making that can be used to test various learning algorithms due to its simplicity. Random Forest is a Rock Paper Scissors Agent that makes predictions using the Random Forest Classification with a bit of random. The randomness on this agent has been limited only while losing (and partially due to window length), displaying the algorithm's true potential. A simulation of various AI agents is developed to compare and analyze against the Random forest algorithm.

Abstract: Collaborative Filtering (CF) examines a consumer's interests and delivers automatic and personalized suggestions for purchasing a variety of products. Sparsity, on the other hand, is one of the approach's primary flaws. This difficulty is inherent in the system due to an ever-increasing quantity of people and things. To address the problem of sparsity, many existing techniques have been given. The user-item rating matrix can only provide minimal information to estimate unknown evaluations in both user-based and item-based instances. In scarce data contexts, they are ineffective. In sparse data situations, many clustering-based methods are useless. In sparse situations, traditional similarity measurements like cosine, pearson correlation, and jaccard similarity are ineffective. Although the system is able to analyze similarity in this scenario, there is a chance that the similarity is unreliable due to insufficient information processed. As the accuracy of prediction drops, this has an impact on the performance of a recommender system. As a result, neighbourhood formation is an important phase in collaborative filtering. As a result, a neighbourhood approach that can perform well in a sparse environment is required. A K Means biclustering fusion based technique is proposed to mitigate the sparsity problem by fusing item-based CF with user-based CF. A Mean absolute difference measure is used to find a neighbouring bicluster that has a significant partial similarity with the active user's preferences, which supports the algorithm in locating quality neighbours. The quality of the neighbours improves the accuracy of your recommendations.

Abstract: Due to the increase in the use of internet web applications in today's world, multiple new ways have been brought in to change existing methods to make them hassle-free and efficient.E-Voting systems are one new change that has been brought over and is also being used in multiple countries as it is both cost and time-efficient when compared to the traditional voting systems. For an E-voting system the user, who in this case is the voter, requires a web browser and server for the user's verification and authentication. Usually, the voter can access a centralized database where he casts his vote and the result for the vote that has been cast is also not shown. Other security issues are also encountered when one uses a centralized database as data manipulation remains a possibility.The main focus of this paper is to develop an E-voting system that is made on a blockchain with a decentralized model to ensure that the whole process is reliable, efficient, flexible, and most importantly transparent.

Abstract: Data integrity and tamper-proofing are of paramount importance in legal documents. To mitigate these issues of data tampering and data corruption in a centralized system, blockchain technology and Non-fungible tokens can be used. Blockchain is used to establish a trust-less system, eliminating the need for a facilitator or a centralized body to validate the correctness of data. Non Fungible Tokens can be used for their properties of immutability. The limitations of traditional NFTs such as data security and data corruption in a centralized and decentralized storage services are also discussed and a new method for data storage is proposed, i.e. On-Chain NFTs and their possible advantages and disadvantages, and how they provide an additional layer of security, making it more reliable than our current Off-Chain Non Fungible Token standards. Three novel approaches have been proposed, along with their respective pros and cons.

Abstract: After mainframes, people computers, the internet, mobile communications, and social media, blockchain has been dubbed the sixth disruptive technology. For system decentralization, it is referred to as a distributed peer-to-peer (P2P) database enabler. There is a scalability issue that is a major roadblock to widespread Blockchain adoption. The goal of this study is to overcome the barriers that are preventing this technology from becoming as widely accepted as it was designed to be. This research provides the groundwork for an improved blockchain by identifying the right balance between block size and block interval, switching to a better consensus mechanism like PoS, and indicating sharding.

Abstract: In large democracy like India with about 83.4 crore voters it is estimated that about 50,000 crore rupees is spent on election and it takes about 6 weeks to conduct election. So the approach of election followed in India is costly both in terms of time and money. In order to reduce the cost of time and money, in last few decades numerous methods have already been developed and one of them is to use online voting system that providers the comfort of voting from remote location. But traditional online system has its own drawbacks like data tampering, privacy breach, etc. Blockchain technology is proposed, that incorporates cryptographic properties. Blockchain technology is simply defined as a decentralized, distributed ledger that maintains the provenance of a digital asset and is considered to be utmost secure. To avoid single point of failure, two step authentication process is used which include OTP verification and Biometric authentication. To ensure the anonymity of the votes, Identity-based ring signature scheme is used.

Abstract: Allograft has emerged as a preeminent province in medical management. In today's contemporary world, many emerging technologies have evolved and are digitally automatized with the help of Artificial intelligence, Cloud, Blockchain, etc, and it brings innovative solutions for the critical problems to make new vogue [7]. practitioners are given the challenge of forcibly acquiring, and companionating health records [18]. The most highly demanded aspects of the interweb are privacy and security, and this is where blockchain plays a predominant role. It has features such as transparency, decentralization, and immutability that make it indispensable. This technology has captivated remarkable attention from researchers as well as government organizations [6]. By using blockchain, electronic medical records (EMR) and donor details can be stored securely. The electronic medical records are hashed through a distributed IFPS file server that is secure and it is immutable. It is done with the aid of user signs acquired digitally at the time of saving, which cannot be redo anymore. This paper aims to/ design a web portal to collect unused medicine and give those to needy people through hospitals or NGOs that will be beneficial to them. It can be done after checking the medicines and it is approved by the admin or hospitals.

Abstract: In this paper we propose a new way to verify eligible voters in a blockchain election. Usually verifying a voter in a list of eligible voters is done using linear search-based algorithms which runs with a worst-case time complexity of O(N) or O(kN). Our system shall use a Merkle tree to implement a search algorithm which runs with a worst-case time complexity of O(Log (N)). Under normal circumstances, when there are 1,000,000 eligible voters, the server would have to scan through 1,000,000 voter address hashes in order to verify a voter. In our system, only 20 hashes will be checked in order to verify a voter. The number of hashes required to calculate the number of hashes needed to process can be found out by getting the logarithm value of the number of hashes, to the base 2 since our Merkle tree has a branching factor of 2. A logarithmic algorithm will exponentially reduce the time and make the eligibility verification process more efficient. Since we are hashing the addresses of the voters before creating the tree, the privacy of the voters shall also be maintained. Instead of using a centralized database for handling the vote requests, we shall use a blockchain database in order to make this system decentralized. Making the system decentralized will make it almost impossible to tamper with the results of the election as once the election is deployed, even the owner of the election that is, the address that deploys the smart contract cannot tamper with the results or the functions in the deployed smart contract.

Abstract: Many new strategies for storing data across different clouds have lately been proposed. Because a single point of attack can’t leak all the information, distributing data among multiple cloud storage providers (CSP) automatically gives users some control over information leaking. However, if data chunks are dispersed in an unstructured way over different clouds, there will be a lot of information leakage. To prevent data loss due to hacking or server failure, the data is uploaded to different servers. To access owners' data, secure files, and prevent data leakage, we employ advanced techniques such as Advanced Encryption Standard (AES) and Fully Homomorphic Encryption (FHE).

Abstract: Cloud computing, a next-generation computing technique, enables extremely flexible, scalable, and cost-effective computing that is available on demand. Organizations can expect increased agility, improved business interaction, and continuity as a result of cloud technologies. However, with increased demand, the need for data confidentiality, integrity, and availability has become one of the most crucial challenges in cloud computing. Various cryptographic approaches are employed in the cloud to guarantee that these needs are met, such as safeguarding against data breaches and malicious attacks. This paper outlines cloud infrastructure, cloud security requirements, and their challenges. We then present an overview of various cryptographic techniques such as AES, DES, RSA, etc. that have been used to ensure cloud security. We also reviewed hybrid algorithms proposed and implemented by various authors and mentioned their advantages and shortcomings.