Key Scheme Research Articles

Efficient provable dual receiver hybrid and light weight public key schemes based on the discrete logarithm problem without pairings

AbstractDual‐receiver proxy re‐encryption is a cryptographic technique that enables secure data sharing among multiple authorized users or entities. It has gained significant attention for its ability to manage access permissions, data confidentiality, and streamline communication channels. These schemes have been widely used in various applications, including healthcare systems, cloud computing, Internet of Things (IoT) systems, collaborative environments, and secure communication channels. This paper aims to propose two proxy re‐encryption schemes for dual receivers without pairings. The first is dual receiver lightweight proxy re‐encryption without pairings (DR‐LWPRE‐WP), which uses a public key scheme to reduce computational complexity. The second is dual receiver hybrid proxy re‐encryption without pairings (DR‐HPRE‐WP), which incorporates public key and symmetric key schemes. Both schemes offer protection against selected plaintext attacks based on the decisional Diffie‐Hellman principle. The DR‐LWPRE‐WP scheme reduces computation by approximately 53% compared to pairing‐based schemes, making it suitable for lightweight applications like the Internet of Things. The computational efficacy of these schemes offers significant benefits for resource‐constrained environments and practical implementations.

Бенжамен Констан как философ религиозного чувства

The paper deals with Benjamin Constant’s philosophy of religious sentiment. Constant is known primarily as political philosopher defender of Liberalism; at the same time, during his life Constant was interested in religion. The paper follows development of Constant’s views till his Athenaeum Lectures of 1818 and mature opus magnum “On Religion” (5 vols., 1824–1831). Constant’s philosophy of religious sentiment in many traits differs of the similar projects that were elaborated in the German-speaking space. Constant visited Germany for a long time, accordingly, he was acquainted with German-speaking philosophy and theology (Semler, Kant, Schleiermacher and many others); however, it did not shape Constant’s worldview. Rather, Constant used German ideas to answer on his own questions. Hence, Constant’s views are original in some traits. Firstly, unlike German colleagues he does not concentrate on epistemology of religious sentiment, but on the political and ideological aspects of religious feeling. Secondly, Constant opposes the sentiment itself to its forms changing in history as well as illustrates the latter by materials of ethnology and anthropology. Thirdly, this opposition represents the key scheme of phenomenology of religion, that is why Constant influenced not German but Dutch researchers, more precisely C. P. Tiele and G. van der Leeuw. Fourthly, Constant unlike German thinkers due to his explicite liberal views strongly criticizes church institutions. In general, despite of considerable distance between Constant’s and his German collеagues philosophers’ views, Constant is one of the closest to the German philosophy French thinkers. Constant's philosophy of religion is known primarily because of his political fame.

Research on the risk assessment of the power grid enterprises’ agency power purchase business in China: A hybrid multi-attribute decision-making framework based on FUCOM-F and GRA-MARCOS

To steadily promote the reform of sales electricity prices, China has innovatively proposed to carry out grid enterprises’ agency power purchase business (GEAPPB) as a transitional scheme for industrial and commercial users to enter the power market in the future. However, because the GEAPPB covers a wide range of users and involves complex business processes, the risks throughout the process of the GEAPPB will affect the organization and operation of the business. This paper proposes a GEAPPB risk assessment technique. First, a risk evaluation index system containing 10 indicators is designed based on the characteristics and development process of GEAPPB. Second, a risk assessment model based on the fuzzy full consistency method (FUCOM-F) and gray relational analysis (GRA)-improved MARCOS is constructed. Finally, seven grid enterprises in China are taken as examples to verify the validity and scientificity of the model. The results show that improving the accuracy of power forecasting, optimizing the agency power purchase strategy, and strengthening demand response management are the key schemes to reduce the risk of GEAPPB. Compared with the other three evaluation models, the proposed model has good applicability and effectiveness for the risk evaluation of GEAPPB.

Exploration of Quantum Cryptography Security Applications for Industrial Control Systems

Abstract The exploration of security applications of quantum cryptography for industrial control systems is a key research effort aimed at enhancing the security of industrial control systems through quantum cryptography. In this paper, we study the security threats faced by industrial control systems, including network attacks, data leakage, and system tampering, and propose to utilize quantum key distribution and quantum invisible state transfer algorithms to ensure the secure transmission of industrial control system data. The simulation test environment of the upper and lower computers of the industrial control system is built. The quantum encryption and decryption algorithms are deployed in the embedded environment and PCs to test the effectiveness of quantum cryptography to enhance the advanced encryption standard key scheme. The experimental results show that the quantum cryptography technology successfully realizes the encryption and decryption of data, and the total time consumed in the whole process is less than 61.8 seconds, which meets the requirements of a real-time industrial control system. Therefore, quantum cryptography is suitable for protecting field-level data in industrial control systems.

A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem

The advancement in communication technology nowadays has increased the number of networked devices exponentially. Thus, network applications begin to cluster terminals to address scalability, privacy, and device connectivity with low routing costs. A recently introduced NP-hard problem called the Clustered Minimum Routing Cost Tree (CluMRCT) problem is assessed to be a fundamental key in designing an efficient network with low routing costs. Lately, some evolutionary multitasking meta-heuristics have been proposed to tackle multiple CluMRCT problems concurrently. However, these previous studies still have some limitations, such as only being applicable to complete graphs or there is no mechanism for effective knowledge transfer between problems when solving them simultaneously. To overcome these limitations, this paper proposes a novel multi-population multitasking evolutionary framework to address the problem. The individual representation is developed based on Network random key scheme and can be applied to both sparse and complete graphs. Moreover, our proposal can adaptively exploit positive knowledge transfer by adjusting the number of individuals migrating from other populations to a particular task. Then, the proposed algorithm is experimented on various data types and compared with other state-of-the-art algorithms. The experimental results show the proposal's effectiveness in most cases of the dataset, followed by detailed comparison, evaluation, and analysis.

Assessing The Performance Of Zakat And Samurdhi Scheme In Alleviating Poverty Among The Muslim Community In Sri Lanka

Poverty is one of the most hotly debated subjects in international development. It is also discussed in all economic development and governmental policymaking. Every country in the world adopts poverty alleviation strategies since poverty has been negatively impacting on economic growth. Despite this global trend, Sri Lanka has its own unique strategies that set it apart. The Samurdhi is one of the key schemes to reduce poverty in society regardless of faith or ethnicity in Sri Lanka. Notably, Muslims in Sri Lanka get benefits from Samurdhi and Zakāt programmes which play a major role in poverty reduction especially among Muslim community. on this background, this study aims to analyse the performance of both Zakāt and Samurdhi schemes in poverty alleviation among the Muslim community in the study area. This study is based on qualitative research paradigm and employs both primary and secondary data. Primary data were collected through the unstructured interviews, conducted with the coordinators, animators, and beneficiaries of both programs. All interview scripts were analysed using the Thematic Content Analysis (TCA) method. The study concluded with the argument that both schemes (Samurdhi and Zakāt) immensely contributed to poverty alleviation in the study area, especially among the Muslim community. However, Samurdhi scheme is more effective than the zakat programme during the study period (2019-2022) as Samurdhi scheme was implemented with the support of the government and annually government is allocating fund separately. Apart from this, no government funds were allocated for the proper implementation of the zakat programme via the Zakāt foundations. It is noteworthy that Zakāt system has been functioning by the donations from wealthy Muslims. Meanwhile, Zakāt scheme was effectively implemented in certain areas of Akkaraipattu. However, comparatively Zakāt scheme was not implemented effectively among beneficiaries in the whole study area.

Secrecy Capacity Region of the AWGN MAC with External Eavesdropper and Feedback.

For the point-to-point additive white Gaussian noise (AWGN) channel with an eavesdropper and feedback, it has already been shown that the secrecy capacity can be achieved by a secret key-based feedback scheme, where the channel feedback is used for secret sharing, and then encrypting the transmitted message by the shared key. By secret sharing, any capacity-achieving coding scheme for the AWGN channel without feedback can be secure by itself, which indicates that the capacity of the same model without the secrecy constraint also affords an achievable secrecy rate to the AWGN channel with an eavesdropper and feedback. Then it is natural to ask: is the secret key-based feedback scheme still the optimal scheme for the AWGN multiple-access channel (MAC) with an external eavesdropper and channel feedback (AWGN-MAC-E-CF), namely, achieving the secrecy capacity region of the AWGN-MAC-E-CF? In this paper, we show that the answer to the aforementioned question is no, and propose the optimal feedback coding scheme for the AWGN-MAC-E-CF, which combines an existing linear feedback scheme for the AWGN MAC with feedback and the secret key scheme in the literature. This paper provides a way to find optimal coding schemes for AWGN multi-user channels in the presence of an external eavesdropper and channel feedback.

Construction Method of Casino based on Ethereum

There are a lot of things that humans cannot do, and one of them is being fair, especially when he is running a casino. However, Ethereum can. Constructing a casino that is regulated by Ethereum can give us the first fair casino in the world. With the help of some technics of cryptography, which are public/secret key schemes and one-way functions, the secrecy and privacy in the gambling of each player can be ensured while still making the game fair by the blockchain. During the construction, Ethereum is also found to be fit for the casino’s other aspects such as propaganda and payment. By successfully constructing such a casino, a way of converting the fixity of blockchain into fairness is proposed in the area that needs it and lacks it the most, which is a casino. Following down this road, any area that lacks fairness can exploit Ethereum or block-chain to find a way to achieve fairness.

A Coalesce Security System of PDM and SDM Based on a Flexible Configuration of Multi-Channel Keys

The purpose of this study is to present a security system that combines PDM and SDM and is based on the flexible configuration of multi-channel keys. The proposed system will utilize three distinct approaches to accommodate a variety of rate and security needs. In order to enhance resource use and fulfill rate requirements, the three-channel PD-OFDM has been proposed. Key co-transmission schemes containing two sub-schemes for deal with different levels of encryption. Experimental results show that the proposed system can transmit 126.88 Gb/s OFDM signals in the unencrypted three-channel PD-OFDM scheme, 95.16 Gb/s OFDM signals in the one-channel key scheme and 63.44 Gb/s OFDM signals in the two-channel key scheme across 2 km 7-core fiber. Both security and speed requirements are considered to achieve a flexible system configuration.

Tapping Eavesdropper Designs Against Physical Layer Secret Key in Point-to-Point Fiber Communications

With the growing demand for service access and data transmission, security issues in optical fiber systems have become increasingly important and the subject of increased research. Physical layer secret key generation (PL-SKG), which leverages the random but common channel properties at legitimate parties, has been shown to be a secure, low-cost, and easily deployed technique as opposed to computational-based cryptography, quantum, and chaos key methods that rely on precise equipment. However, the eavesdropper (Eve) potential for current PL-SKG in fiber communications has been overlooked by most studies to date. Unlike wireless communications, where the randomness comes from the spatial multi-paths that cannot be all captured by Eves, in fiber communications, all the randomness (from transmitted random pilots or channel randomness) is contained in the signals transmitted inside the fiber. This, therefore, enables a tapping Eve to reconstruct the common features of legitimate users from its received signals, and further decrypt the featured-based secret keys. To implement this idea, we designed two Eve schemes against polarization mode distortion (PMD) based PL-SKG and the two-way cross multiplication based PL-SKG. The simulation results show that our proposed Eves can successfully reconstruct the legitimate common feature and the secret key relied upon, leading to secret key rate (SKR) reductions of between three and four orders of magnitude in the PL-SKG schemes studied. As a result, we reveal and demonstrate a novel eavesdropping potential to provide challenges for current physical layer secret key designs. We hope to provide more insightful vision and critical evaluation on the design of new physical layer secret key schemes in optical fiber links, to provide more comprehensively secure, and intelligent optical networks.

Genetic diversity of fig (Ficus carica L.) germplasm from the Mediterranean basin as revealed by SSR markers

Fig (Ficus carica L.) tree is cultivated worldwide and is highly appreciated for its fruit, which is consumed fresh or dried, having high nutritional and pharmaceutical value and for these reasons there is an increasing interest for its cultivation. In the present study, an ex situ collection of 60 fig accessions (41 indigenous Greek and 19 from other Mediterranean countries) was established and its diversity was analyzed using eight simple sequence repeat (SSR) loci. Greek fig genotypes showed relatively low allelic variation (the average number of SSR alleles per locus was 3.75), an excess of heterozygosity (mean He = 0.489 and Ho = 0.557), and extensive outbreeding (mean F index − 0.151). Cluster analysis showed that the established fig population exhibited weak genetic structure, with most of the genetic variation (89%) being present within individual members of the clusters. Both cluster and principal coordinate analysis confirmed that there is little correlation between genetic makeup and geographical origin of the fig accessions. Polymorphism information content with an average of 0.421 was reasonably informative. An identification key scheme for fig cultivars that will be useful in cultivar discrimination and intellectual property protection was developed. This work will contribute to a sustainable fig production regionally and worldwide, through the establishment and conservation of a reference fig collection, providing germplasm for future breeding efforts.

Quantum Guess and Determine Attack on Stream Ciphers

Abstract To guarantee the security of symmetric key schemes against quantum adversary, developing quantum cryptanalytic techniques becomes a major worldwide challenge in the post-quantum world. In this paper, we present a general framework of classical guess and determine attack on stream ciphers, and then convert it into quantum guess and determine attack. It shows that, for a given stream cipher with a key size of $k$ bits and an internal state size of $n$ bits, if a basic guess and determine attack with a time complexity below $O ( {{{2}^{{3k}/{2}}}}/{n} )$ is available, there is a quantum guess and determine attack with multiple data that can recover all $n$ internal state bits of the cipher with complexity below $O ( {{2^{k / 2}}} )$. As applications, we present quantum guess and determine attacks on the SNOW-like stream ciphers. The results show that all of SNOW 1.0 with 128-bit key, SNOW 2.0 with 128-bit key and SOSEMANUK are insecure against quantum guess and determine attack. The resource requirements for implementing a quantum guess and determine attack on SNOW 3G are evaluated as a case study. To the best of our knowledge, this is the first time that the general quantum guess and determine attack is formally proposed and applied to the SNOW-like stream ciphers.

Pre-Distribution Encryption Key Scheme for Communicating between IoT Device Layer and Fog Layer

The issue of security in fog has several challenges and one of which is to create a secure channel that connects fog layer to the end devices. Therefore, efficient and secure key distribution is very important to create this channel. One solution is key pre-distribute that the keys generation and distribution between nodes are before the network establishment. This article presents an algorithm for key pre-distribution in fog networks that focuses on the relationship between end devices and the fog layer. The proposed scheme is a hybrid scheme that uses the K-MEANS algorithm for nodes hierarchical clustering. Then the residual design is used to generate the key chain and BIBD design is used for key pre-distribution in headers. The proposed method is completely independent of the mobility model of and its communication and computation overheads are of the order of O(q). Also, the network connectivity is above 0.8 and close to the BIBD design, which is a fully connected KPS, and the probability of capturing the entire network in case of capturing the nodes is almost equal to 0. In the proposed method for a network with size N, the size of the key chain is

Bézier Coefficients Matrix for ElGamal Elliptic Curve Cryptosystem

It is well-known that cryptography is a branch of secrecy in science and mathematics, which usually preserves the confidentiality and authenticity of the information, where its growth is parallel with the rapid evolution of the internet and communication. As one of the prominent public key cryptosystems, the Elliptic Curve Cryptosystem (ECC) offers efficiency and complex mathematical operations with a smaller bit compared to other types of public key schemes. Throughout the evolution of cryptography, ElGamal Elliptic Curve Cryptosystem (ElGamal ECC) revolved from ElGamal public key scheme for user efficiency and privacy. In this study, an improved method will be introduced using ElGamal ECC as the foundation with the incorporation of the Bézier curve coefficient matrix, where the ElGamal ECC value is considered as the control point of the Bézier curve during the encryption and decryption processes. The proposed method is designed to develop a robust ciphertext system algorithm for better efficiency and to increase the level of protection in ElGamal ECC. In this paper, the performance of the proposed method is compared with the normal ElGamal ECC. The results of this study show that the proposed method offers no significant difference in terms of the implementation time during the encryption and decryption process. However, it does offer extra layers of protection when operated with complex mathematical operations.

Brakerski‐Gentry‐Vaikuntanathan fully homomorphic encryption cryptography for privacy preserved data access in cloud assisted Internet of Things services using glow‐worm swarm optimization

AbstractHealth monitoring sensors are widely available to monitor patients' health remotely. The collected sensor data are sent to cloud storage and processed in a remote health monitoring system. The Internet of Things (IoT) with cloud support offers a promising answer to data exploding concerns for the ability to constrain specific gadgets. However, IoT faces many security issues when sharing data between two users because of the cloud's leverage nature. In the case of a private cloud, simple encryption techniques can ensure security. But, in the case of a public cloud, maintaining data privacy is a significant issue. To overcome this concern, an optimized Brakerski‐Gentry‐Vaikuntanathan fully homomorphic encryption (BGV‐FHE) encryption method for secured data mutuality is proposed in this article. In this method, IoT medical data are initially acquired and then encrypted using two key schemes, and the data are stored in cloud storage. The main objective of these key schemes is to select optimal key parameters. Key parameters are chosen using the glow‐worm swarm optimization and used for the encryption phase. Storing data in the cloud using a public key provides access to requested users. Meanwhile, sensitive data are encrypted using a private key and cannot be accessed unless authenticated. This proposed approach has two levels of encryption, and thus it is an efficient data secured protocol for cloud resources. Implementing the optimized BGV‐FHE scheme based encryption scheme in Python, two datasets result in an accuracy level of 77% and 91%, respectively.

A Provable Secure Session Key Distribution Protocol Based on NSSK for In-Vehicle CAN Network

Many CAN-based session key sharing approaches are based on the group key scheme, which can easily lead advanced adversaries to infiltrate all ECUs (electronic control units) in the network if the sharing key is leaked. To address the above problem, we propose a provable secure session key distribution protocol based on the improved NSSK (Needham–Schroeder shared key) protocol for the in-vehicle CAN network. We applied the mechanisms of message authentication and digital signature to fix the defects of the original NSSK regarding its lack of resistance to the Denning–Sacco attack. Then, we analyzed the provable security of the proposed protocol on the random oracle model and verified the security goals of the protocol by using the simulation tools AVISPA and Tamarin Prover; the results reflect that the protocol met the security requirements for key distribution such as session key secrecy, injective agreement, and known key secrecy. Finally, we compared our new protocol with other key distribution protocols in CAN bus communication to evaluate the performance of the new protocol in actual scenarios. The result shows that the protocol is secure against many payload-based attacks and is practical for in-vehicle CAN networks.

Подходы к оценке природного капитала: зарубежный опыт

The concept of natural capital goes beyond nature as a source of raw materials for production and reflects the role of the environment and ecosystems in maintaining human well-being. National accounts do not consider the costs of depletion or degradation of natural resources and the entire economic contribution of nature, which is essential for ensuring sustainable development, so it became necessary to develop special accounting systems for natural capital. The author uncovers evolution of the formation and features of «public» and «private» approaches to the accounting of natural capital in the system of corresponding accounts. The key scheme of both approaches is the way from individual spatial economic, social and environmental data to complex information through the structure of accounts that record the quantity and quality of ecosystem assets and ecosystem services provided by them in physical and monetary terms during the reported periods. The article presents cases for assessing the natural capital at timber industry enterprises and the experience of the UK in measuring the value of various ecosystem services as a leading country. The analysis revealed the problems and trends in the development of the environmental and economic accounting system. A scheme of accounting the forest capital in the regional conditions of information supply is offered.

LPWAN Key Exchange: A Centralised Lightweight Approach.

The Internet of Things (IoT) is one of the fastest emerging technologies in the industry. It includes diverse applications with different requirements to provide services to users. Secure, low-powered, and long-range transmissions are some of the most vital requirements in developing IoT applications. IoT uses several communication technologies to fulfill transmission requirements. However, Low Powered Wide Area Networks (LPWAN) transmission standards have been gaining attention because of their exceptional low-powered and long-distance transmission capabilities. The features of LPWAN transmission standards make them a perfect candidate for IoT applications. However, the current LPWAN standards lack state-of-the-art security mechanism s because of the limitations of the IoT devices in energy and computational capacity. Most of the LPWAN standards, such as Sigfox, NB-IoT, and Weightless, use static keys for node authentication and encryption. LoRaWAN is the only LPWAN technology providing session key mechanisms for better security. However, the session key mechanism is vulnerable to replay attacks. In this paper, we propose a centralized lightweight session key mechanism for LPWAN standards using the Blom–Yang key agreement (BYka) mechanism. The security of the session key mechanism is tested using the security verification tool Scyther. In addition, an energy consumption model is implemented on the LoRaWAN protocol using the NS3 simulator to verify the energy depletion in a LoRaWAN node because of the proposed session key mechanisms. The proposed session key is also verified on the Mininet-WiFi emulator for its correctness. The analysis demonstrates that the proposed session key mechanism uses a fewer number of transmissions than the existing session key mechanisms in LPWAN and provides mechanisms against replay attacks that are possible in current LPWAN session key schemes.

Physical Layer Security Design for Polar Code Construction

In contrast to the network security that relies on upper-layer encryption for the confidentiality and authenticity of communications, physical layer security (PLS) exploits the uniqueness and randomness of the physical channel to encrypt information and enhance the security of the system. In this paper, we study the PLS of a polar-coded wireless communication system. To be more specific, we leverage the unique properties in polar code construction and propose a channel quality indicator (CQI)-based frozen-bit pattern generation scheme. The transmitter employs the Gaussian approximation algorithm to generate the corresponding frozen bit pattern according to the instantaneous CQI of the legitimate link. At the receiver, by leveraging the full channel reciprocity in the time-division duplex (TDD) mode, we can map the CQI to the corresponding frozen bit pattern and correctly decode the received bits. By contrast, the eavesdropper was unable to have the knowledge of the legal channel, and hence cannot determine the frozen bit pattern of the polar-coded bit sequence. Our simulation results demonstrate that by adopting the proposed PLS key generation scheme, Eve was hardly able to correctly decode a complete frame, leading to a high block error rate (BLER), while Bob was able to attain a 10−5 BLER.

An Efficient Framework for Securing the Smart City Communication Networks.

Recently, smart cities have increasingly been experiencing an evolution to improve the lifestyle of citizens and society. These emerge from the innovation of information and communication technologies (ICT) which are able to create a new economic and social opportunities. However, there are several challenges regarding our security and expectation of privacy. People are already involved and interconnected by using smart phones and other appliances. In many cities, smart energy meters, smart devices, and security appliances have recently been standardized. Full connectivity between public venues, homes, cares, and some other social systems are on their way to be applied, which are known as Internet of Things. In this paper, we aim to enhance the performance of security in smart city communication networks by using a new framework and scheme that provide an authentication and high confidentiality of data. The smart city system can achieve mutual authentication and establish the shared session key schemes between smart meters and the control center in order to secure a two-way communication channel. In our extensive simulation, we investigated and evaluated the security performance of the smart city communication network with and without our proposed scheme in terms of throughput, latency, load, and traffic received packet per seconds. Furthermore, we implemented and applied a man-in-the-middle (MITM) attack and network intrusion detection system (NIDS) in our proposed technique to validate and measure the security requirements maintaining the constrained resources.