Search

This paper proposes a blockchain-based identity authentication (BA) scheme for IoT devices to solve the authentication security problem of IoT devices. The BA scheme uses hashing and digital signature algorithms to achieve integrity and nonrepudiation of authentication messages. Blockchain technology is used to achieve decentralised and distributed storage and management of authentication data. Besides, the BA scheme uses the idea of trust domains and trust credentials to establish a master-slave connection between IoT devices. The BA scheme is then compared with the existing four schemes and analysed from six perspectives to show that the BA scheme has better security. Also, the results show that the BA scheme has reasonable computational and storage overhead. Finally, the advantages of the BA scheme over traditional centralised and existing blockchain-based authentication schemes are compared and analysed. The results show that it can perfectly solve the problem of overreliance on trusted third parties in traditional authentication schemes. [ABSTRACT FROM AUTHOR]

The continuous development of quantum computing necessitates the development of quantum-resistant cryptographic algorithms. In response to this demand, the National Institute of Standards and Technology selected standardized algorithms including Crystals-Dilithium, Falcon, and Sphincs+ for digital signatures. This paper provides a comparative evaluation of these algorithms across key metrics. The results indicate varying strengths and weaknesses for each algorithm, underscoring the importance of context-specific deployments. Our findings indicate that Dilithium offers advantages in low-power scenarios, Falcon excels in signature verification speed, and Sphincs+ provides robust security at the cost of computational efficiency. These results underscore the importance of context-specific deployments in specific and resource-constrained technological applications, like IoT, smart cards, blockchain, and vehicle-to-vehicle communication. [ABSTRACT FROM AUTHOR]

This research paper introduces a novel paradigm that synergizes innovative algorithms, namely efficient data encryption, the Quondam Signature Algorithm (QSA), and federated learning, to effectively counteract random attacks targeting Internet of Things (IoT) systems. The incorporation of federated learning not only fosters continuous learning but also upholds data privacy, bolsters security measures, and provides a robust defence mechanism against evolving threats. The Quondam Signature Algorithm (QSA) emerges as a formidable solution, adept at mitigating vulnerabilities linked to man-in-the-middle attacks. Remarkably, the QSA algorithm achieves noteworthy cost savings in IoT communication by optimizing communication bit requirements. By seamlessly integrating federated learning, IoT systems attain the ability to harmoniously aggregate and analyse data from an array of devices while zealously guarding data privacy. The decentralized approach of federated learning orchestrates local machine-learning model training on individual devices, subsequently amalgamating these models into a global one. Such a mechanism not only nurtures data privacy but also empowers the system to harness diverse data sources, enhancing its analytical capabilities. A thorough comparative analysis scrutinizes varied cost-in-communication schemes, meticulously weighing both encryption and federated learning facets. The proposed approach shines by virtue of its optimization of time complexity through the synergy of offline phase computations and online phase signature generation, hinged on an elliptic curve digital signature algorithm-based online/offline scheme. In contrast, the Slow Block Move (SBM) scheme lags behind, necessitating over 25 rounds, 1500 signature generations, and an equal number of verifications. The proposed scheme, fortified by its marriage of federated learning and efficient encryption techniques, emerges as an embodiment of improved efficiency and reduced communication costs. The culmination of this research underscores the intrinsic benefits of the proposed approach: marked reduction in communication costs, elevated analytical prowess, and heightened resilience against the spectrum of attacks that IoT systems confront. [ABSTRACT FROM AUTHOR]

As Mobile Communication and Internet Systems (MCIS) have rapidly developed, security issues related to MCIS have become increasingly important. Therefore, the development and research of security technologies for mobile communication and internet systems are actively being conducted. Hash-Based Signature (HBS) uses a hash function to construct a digital signature scheme, where its security is guaranteed by the collision resistance of the hash function used. To provide sufficient security in the post-quantum environment, the length of hash should be satisfied for the security requirement. Modern HBS can be classified into stateful and stateless schemes. Two representative stateful and stateless HBS are eXtended Merkle Signature Scheme(XMSS) and SPHINCS + , respectively. In this paper, we propose two HBS schemes: K-XMSS and K-SPHINCS + , which replace internal hash functions of XMSS and SPHINCS + with Korean cryptography algorithms. K-XMSS is a stateful signature, while K-SPHINCS + is its stateless counterpart. We showcase the reference implementation of K-XMSS and K-SPHINCS + employing Lightweight Secure Hash (LSH) and two hash functions based on block ciphers (i.e., CHAM and LEA) as the internal hash function. In addition, K-XMSS and K-SPHINCS + using Advanced Vector Extensions 2 (AVX2) have been provided, demonstrating that they can be optimized for better performance using advanced implementation techniques than previous approaches. [ABSTRACT FROM AUTHOR]

In view of the security problem of embedded device firmware update, this study proposes a multi-check firmware security update scheme based on hash, symmetric and asymmetric encryption algorithms. In this study, the master key pairs, temporary key pairs, shared key and hash chain are designed to protect firmware update from identity authentication, data encryption, integrity check and other aspects, which can effectively prevent illegal users, firmware tampering, firmware data leakage, replay attack, firmware rollback and other attacks. In this study, the concrete implementation of the security update scheme is carried out. The experiment results show that compared with the ISP(In System Programming) and IAP(In Application Pragramming) technologies without any security protection, the scheme achieves the security protection of the whole process of firmware update at the time cost of about 7% and 11%, it provides a safe and reliable update method for embedded device firmware update. [ABSTRACT FROM AUTHOR]

The security of digital signatures depends significantly on the signature key. Therefore, to reduce the impact of leaked keys upon existing signatures and subsequent ones, a digital signature scheme with strong forward security could be an effective solution. Most existing strong forward-secure digital signature schemes rely on traditional cryptosystems, which cannot effectively resist quantum attacks. By introducing lattice-based delegation technology into the key-iteration process, a two-direction and lattice-based key-iteration algorithm with strong forward security is proposed. In the proposed algorithm, a unique key pair is assigned to the signer in every period. Based on the proposed algorithm, a strong forward-secure signature scheme is further put forward, which achieves resistance to quantum attacks. Performance analysis shows that under the security assumption of the SIS problem on the lattice, the proposed strong forward-secure signature scheme is existentially unforgeable under the random oracle model. Ultimately, based on the proposed strong forward-secure signature scheme, a remote identity-authentication scheme that is resistant to quantum attacks is proposed, ensuring post-quantum security in the user-authentication process. [ABSTRACT FROM AUTHOR]

The cryptographic system is the foundation of blockchain security mechanisms. This paper constructs a blockchain security mechanism based on the Chinese national cryptographic SM2 algorithm, involving the generation of public–private key pairs and the signing of block information using key pairs. However, the original SM2 algorithm has a high computational complexity, which cannot meet the requirements of low on-chain delay in blockchain applications. To solve this problem, this paper optimizes the SM2 digital signature algorithm. The scalar multiplication operation in the digital signature algorithm has a large computational complexity, which affects the efficiency of a digital signature. To reduce its computational complexity, this paper improves the traditional window non-adjacent form (w-NAF) algorithm for the scalar multiplication operation and proposes a low computational complexity Fw-NAF algorithm based on the prime number precomputation window, which greatly reduces its computational complexity. [ABSTRACT FROM AUTHOR]

Due to the problems that International Mobile Subscriber Identity is not encrypted during transmission, key disclosure, and high authentication overhead in Evolved Packet System‐Authentication and Key Agreement, the next generation of high‐speed railway Long‐Term Evolution for Railway train ground authentication protocol, this paper describes the improved Secure Remote Password algorithm and two‐way heterogeneous Long‐Term Evolution for Railway authentication key agreement scheme. First, the improved Secure Remote Password algorithm is used to encrypt the message transmission between User Equipment and Mobility Management Entity, solving the problem of International Mobile Subscriber Identity being not encrypted during transmission. Then, a two‐way heterogeneous digital signature method of Public Key Infrastructure and Identity‐Based Cryptosystem is proposed to authenticate and negotiate with the Mobility Management Entity and Home Subscriber Server, which improves the security of the root key and can effectively prevent man in the middle, replay and other attacks. Finally, in the research results, the random oracle model is used to verify, and the results show that our method is superior to the comparison method in security and authentication cost, and can meet the Long‐Term Evolution for Railway communication requirements. [ABSTRACT FROM AUTHOR]

The internet and related technologies have promoted the development of medical and health fields, especially remote diagnosis. As medical images may be stolen in the transmission process, the patient's personal information could be leaked. Aiming at the problem of privacy disclosure of colour medical images, a hybrid domain watermarking scheme based on improved differential evolution (DE) and the singular value block embedding (SVBE) is proposed in this study. Through this scheme, the image containing the patient's information is hidden in the patient's medical carrier image as a watermark. First, redistributed invariant lifting wavelet transform (RILWT), discrete wavelet transform (DWT), and singular value decomposition (SVD) are used to process the colour medical carrier image, and the high‐frequency information in the integer wavelet domain of the watermark is embedded into the processed carrier image using the proposed singular value block embedding method based on the improved differential evolution algorithm. At the same time, to increase the security of the watermark scheme, a digital signature based on the SHA‐384 hash function is designed for verification before watermark extraction. Compared with recent related research, the scheme has strong invisibility and robustness. [ABSTRACT FROM AUTHOR]

Electronics-Health Care is one of the new ideas in the healthcare industry. For analyzing the patient's records, doctors need a centralized record of the patients, which gives useful and enormous information. There will be a threat of leaking of confidential e-health data, which will seriously endanger by modifying the health care data of medical and its individual entities. Protection of the confidential data of patients will be a primary constraint in the health care industry. There is a lot of progressiveness in the human services area as well as there is a lot of usage of the information gathered from various sensors and this information is stored in the cloud. As per the existing security algorithms, there is still some security breach and also it won't get satisfied with integrity and consistency while transferring the data from one vendor to others in the health care system. It also causes high spoofing of IP and side channel hackers. With the increase in the use of the internet, there is an increase in hacking also, especially in the health-care sector, e-commerce, military, and Education. Dealing with the huge volume of information in the electronics-healthcare area requires the processing of patient's information day by day and its memory allocation. Cloud is the best option to store these health records in a distributed manner rather than on a single server. So, whatever the information gathered from it will be encoded on block chain technology and an anonymous digital ring signature will be used to authorize the intended user and maintain the privacy of patient cloud-based data distributed Electronics health record system before sending the information to the cloud storage. In this paper, the protection of Personal data of the patient health data is enhanced with block chain and anonymous ring signatures in the e-healthcare cloud; thus making it suitable for real-time applications. [ABSTRACT FROM AUTHOR]

This work aims to solve the specific problem in the Power Internet of Things (PIoT). PIoT is vulnerable to monitoring, tampering, forgery, and other attacks during frequent data interaction under the background of big data, leading to a severe threat to the power grid's Information Security (ISEC). Cryptosystems can solve ISEC problems, such as confidentiality, data integrity, authentication, identity recognition, data control, and nonrepudiation. Thereupon, this work expounds on cryptography from public-key encryption and digital signature and puts forward the model of network information attack. Then, the security of the two cryptograms is certified against the two cyberattack modes. On this basis, an Identity-based Combined Encryption and Signature (IBCES) ensemble scheme is proposed by combining public-key encryption with the digital signature. Finally, the security of the proposed IBCES's encryption and the signature schemes is verified, and the results prove their feasibility. The results show that the proposed IBCEs are effective and feasible, fully meeting the information confidentiality requirements. Additionally, smart grid against Information Security (ISEC) algorithms must comprehensively consider network resources and computing power. This work creatively combines the two cryptosystems. The proposal breaks the traditional key segmentation principle by applying the same key to different cryptosystems and ensures the independent security of the two cryptosystems. The conclusion provides technical support for future research on cryptography. [ABSTRACT FROM AUTHOR]

The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem. A similar design, used to develop a signature algorithm based on the difficulty of solving a system of many quadratic equations in many variables, is introduced. The significant advantage of the proposed method compared with multivariate-cryptography signature algorithms is that the said system of equations, which occurs as the result of performing the exponentiation operations in the hidden group, has a random look and is specified in a finite field of a higher order. This provides the ability to develop post-quantum signature schemes with significantly smaller public-key sizes at a given level of security. [ABSTRACT FROM AUTHOR]

In this paper, based on multi-arbitrators and the product states, a new quantum signature scheme (QSS) is proposed. In our scheme, two arbitrators are used to share private keys with the signer. The signer encodes the bit message into orthogonal product states, which are locally indistinguishable. Then, to produce the signature, the signer signs the product states with the key-controlled Hadamard operator and Y operator. Our scheme has the good virtues as follows. First, our signature not only has the security property of unforgeability, but also has the property of strong non-repudiation. Second, when signing a message and verifying a signature, the partners do not need to prepare or transmit any entangled particle. Third, the partners do not need to perform the state comparison algorithm. Fourth, the signer does not need to share any private key with the signature verifier. For our scheme, the signer only shares two private keys with the arbitrators. At last, in our scheme, the repudiation can be flexibly solved. Compared with the other schemes with semi-trusted arbitrator, ours has better performances in security, practicability and efficiency. [ABSTRACT FROM AUTHOR]

In recent decades there has been an increasing interest in Elliptic curve cryptography (ECC) and, especially, the Elliptic Curve Digital Signature Algorithm (ECDSA) in practice. The rather recent developments of emergent technologies, such as blockchain and the Internet of Things (IoT), have motivated researchers and developers to construct new cryptographic hardware accelerators for ECDSA. Different types of optimizations (either platform dependent or algorithmic) were presented in the literature. In this context, we turn our attention to ECC and propose a new method for generating ECDSA moduli with a predetermined portion that allows one to double the speed of Barrett's algorithm. Moreover, we take advantage of the advancements in the Artificial Intelligence (AI) field and bring forward an AI-based approach that enhances Schoof's algorithm for finding the number of points on an elliptic curve in terms of implementation efficiency. Our results represent algorithmic speed-ups exceeding the current paradigm as we are also preoccupied by other particular security environments meeting the needs of governmental organizations. [ABSTRACT FROM AUTHOR]

With the explosion of connected devices linked to one another, the amount of transmitted data grows day by day, posing new problems in terms of information security, such as unauthorized access to users' credentials and sensitive information. Therefore, this study employed RSA and ElGamal cryptographic algorithms with the application of SHA-256 for digital signature formulation to enhance security and validate the sharing of sensitive information. Security is increasingly becoming a complex task to achieve. The goal of this study is to be able to authenticate shared data with the application of the SHA-256 function to the cryptographic algorithms. The methodology employed involved the use of C# programming language for the implementation of the RSA and ElGamal cryptographic algorithms using the SHA-256 hash function for digital signature. The experimental result shows that the RSA algorithm performs better than the ElGamal during the encryption and signature verification processes, while ElGamal performs better than RSA during the decryption and signature generation process. [ABSTRACT FROM AUTHOR]

This article will describe how permissionless metadata blockchains could be created to overcome two significant limitations in current cataloging practices: centralization and a lack of traceability. The process would start by creating public and private keys, which could be managed using digital wallet software. After creating a genesis block, nodes would submit either a new record or modifications to a single record for validation. Validation would rely on a Federated Byzantine Agreement consensus algorithm because it offers the most flexibility for institutions to select authoritative peers. Only the top tier nodes would be required to store a copy of the entire blockchain thereby allowing other institutions to decide whether they prefer to use the abridged version or the full version. [ABSTRACT FROM AUTHOR]

We propose a new quantum-safe digital signature algorithm called Multivariate Polynomial Public Key Digital Signature (MPPK/DS). The core of the algorithm is based on the modular arithmetic property that for a given element g, greater than equal to two, in a prime Galois field GF(p) and two multivariate polynomials P and Q, if P is equal to Q modulo p-1, then g to the power of P is equal to g to the power of Q modulo p. MPPK/DS is designed to withstand the key-only, chosen-message, and known-message attacks. Most importantly, making secret the element g disfavors quantum computers' capability to solve the discrete logarithm problem. The security of the MPPK/DS algorithm stems from choosing a prime p associated with the field GF(p), such that p is a sum of a product of an odd prime number q multiplied with a power x of two and one. Given such a choice of a prime, choosing even coefficients of the publicly available polynomials makes it hard to find any private information modulo p-1. Moreover, it makes it exponentially hard to lift the solutions found modulo q to the ring of integers modulo p-1 by properly arranging x and q. However, finding private information modulo the components q and power x of two is an NP-hard problem since it involves solving multivariate equations over the chosen finite field. The time complexity of searching a private key from a public key or signatures is exponential over GF(p). The time complexity of perpetrating a spoofing attack is also exponential for a field GF(p). MPPK/DS can achieve all three NIST security levels with optimized choices of multivariate polynomials and the generalized safe prime p. [ABSTRACT FROM AUTHOR]

Blind signature is an important cryptographic primitive with widespread applications in secure e-commerce, for example to guarantee participants' anonymity. Existing blind signature schemes are mostly based on number-theoretic hard problems, which have been shown to be solvable with quantum computers. The National Institute of Standards and Technology (NIST) began in 2017 to specify a new standard for digital signatures by selecting one or more additional signature algorithms, designed to be secure against attacks carried out using quantum computers. However, none of the third-round candidate algorithms are code-based, despite the potential of code-based signature algorithms in resisting quantum computing attacks. In this paper, we construct a new code-based blind signature (CBBS) scheme as an alternative to traditional number-theoretic based schemes. Specifically, we first extend Santoso and Yamaguchi's three pass identification scheme to a concatenated version (abbreviated as the CSY scheme). Then, we construct our CBBS scheme from the CSY scheme. The security of our CBBS scheme relies on hardness of the syndrome decoding problem in coding theory, which has been shown to be NP-complete and secure against quantum attacks. Unlike Blazy et al.'s CBBS scheme which is based on a zero-knowledge protocol with cheating probability |$2/3$|⁠ , our CBBS scheme is based on a zero-knowledge protocol with cheating probability |$1/2$|⁠. The lower cheating probability would reduce the interaction rounds under the same security level and thus leads to a higher efficiency. For example, to achieve security level |$2^{-82}$|⁠ , the signature size in our CBBS scheme is |$1.63$| MB compared to |$3.1$| MB in Blazy et al.'s scheme. [ABSTRACT FROM AUTHOR]

As emerging next-generation information technologies, blockchains have unique advantages in information transparency and transaction security. They have attracted great attentions in social and financial fields. However, the rapid development of quantum computation and the impending realization of quantum supremacy have had significant impacts on the advantages of traditional blockchain based on traditional cryptography. Here, we propose a blockchain algorithm based on asymmetric quantum encryption and a stake vote consensus algorithm. The algorithm combines a consensus algorithm based on the delegated proof of stake with node behaviour and Borda count (DPoSB) and quantum digital signature technology based on quantum state computational distinguishability with a fully flipped permutation ( QSCD ff ) problem. DPoSB is used to generate blocks by voting, while the quantum signature applies quantum one-way functions to guarantee the security of transactions. The analysis shows that this combination offers better protection than other existing quantum-resistant blockchains. The combination can effectively resist the threat of quantum computation on blockchain technology and provide a new platform to ensure the security of blockchain. [ABSTRACT FROM AUTHOR]

Message recovery is an important property in Nyberg-Rueppel type digital signature algorithms. However, the security of Nyberg-Rueppel type digital signature algorithms depends on the hard problems which might be vulnerable to quantum attacks. Therefore, quantum resistant Nyberg-Rueppel type digital signature algorithms with message recovery property are needed. Since NTRU-based cryptosystems are one of the best studied quantum-resistant schemes, using traditional NTRU encryption scheme has several advantages on the message recovery property. In this paper, we define Nyberg-Rueppel type of NTRU digital signature algorithm. It is carried out by combining NTRU-based encryption and signature algorithms. In the proposed scheme, efficient message recovery property is achieved with the help of NTRU. Then, we compare the computational cost of our Nyberg-Rueppel type signature scheme with the others in terms of the arithmetic complexity. According to the asymptotic complexity results, the proposed scheme has better arithmetic complexity than Nyberg-Rueppel type schemes. We also discuss the security properties of the proposed scheme by modifying attacks on Nyberg-Rueppel type algorithms and lattice-based algorithms. [ABSTRACT FROM AUTHOR]

Spectrum sensing is the key technology of cognitive radio. In this article, we apply blockchain technology in spectrum sensing process and propose a related algorithm based on reputation. The algorithm builds a system model based on smart contract in blockchain and applies blockchain asymmetric encryption algorithm and digital signature technology in the process of secondary users' transmitting local judgments to the secondary user base station. The algorithm can resist spectrum sensing data falsification (SSDF) attack launched by malicious users. This article comprehensively considers the channel error rate, detection probability, secondary user base station budget and remaining energy of the secondary users (SUs) and then establishes the SU's utility function as well as the game model. By solving the Nash equilibrium, the SU determines whether it uploads sensing data. Finally, the SU base station selects registered SUs by calculating and updating their reputation, obtaining the final judgment by voting rule. With simulations, we prove that the algorithm proposed in this article increases the accuracy and security of spectrum sensing and can effectively resist SSDF attack. [ABSTRACT FROM AUTHOR]

This paper concentrates on the hardware implementation of efficient and reconfigurable elliptic curve digital signature algorithm (ECDSA) that is suitable for verifying transactions in Blockchain related applications. Despite ECDSA architecture being computationally expensive, the usage of a dedicated standalone circuit enables speedy execution of arithmetic operations. The prototype put forth supports N-bit elliptic curve cryptography (ECC) group operations, signature generation and verification over a prime field for any elliptic curve. The research proposes new hardware framework for modular multiplication and modular multiplicative inverse which is adopted for group operations involved in ECDSA. Every hardware design offered are simulated using modelsim register transfer logic (RTL) simulator. Field programmable gate array (FPGA) implementation of var- ious modules within ECDSA circuit is compared with equivalent existing techniques that is both hardware and software based to highlight the superiority of the suggested work. The results showcased prove that the designs implemented are both area and speed efficient with faster execution and less resource utilization while maintaining the same level of security. The suggested ECDSA structure could replace the software equivalent of digital signatures in hardware blockchain to thwart software attacks and to provide better data protection. [ABSTRACT FROM AUTHOR]

In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn)[p] × E(Fqnk)[p]? Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak l-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model. [ABSTRACT FROM AUTHOR]

Cryptographic hash functions are widely used primitives with a purpose to ensure the integrity of data. Hash functions are also utilized in conjunction with digital signatures to provide authentication and non-repudiation services. The SHA has been developed over time by the National Institute of Standards and Technology for security, optimal performance, and robustness. The best-known hash standards are SHA-1, SHA-2, and SHA-3. Security is the most notable criterion for evaluating the hash functions. However, the hardware performance of an algorithm serves as a tiebreaker among the contestants when all other parameters (security, software performance, and flexibility) have equal strength. Field Programmable Gateway Array (FPGA) is a reconfigurable hardware that supports a variety of design options, making it the best choice for implementing the hash standards. In this survey, particular attention is devoted to the FPGA optimization techniques for the three hash standards. The study covers several types of optimization techniques and their contributions to the performance of FPGAs. Moreover, the article highlights the strengths and weaknesses of each of the optimization methods and their influence on performance. We are optimistic that the study will be a useful resource encompassing the efforts carried out on the SHAs and FPGA optimization techniques in a consolidated form. [ABSTRACT FROM AUTHOR]

Software defined WiFi network (SD-WiFi) is a new paradigm that addresses issues such as mobility management, load management, route policies, link discovery, and access selection in traditional WiFi networks. Due to the rapid growth of wireless devices, uneven load distribution among the network resources still remains a challenging issue in SD-WiFi. In this paper, we design a novel four-tier software defined WiFi edge architecture (FT-SDWE) to manage load imbalance through an improved handover mechanism, enhanced authentication technique, and upgraded migration approach. In the first tier, the handover mechanism is improved by using a simple AND operator and by shifting the association control to WAPs. Unauthorized user load is mitigated in the second tier, with the help of base stations (BSs) which act as edge nodes (ENs), using elliptic ElGamal digital signature algorithm (EEDSA). In the third tier, the load is balanced in the data plane among the OpenFlow enabled switches by using the whale optimization algorithm (WOA). Moreover, the load in the fourth tier is balanced among the multiple controllers. The global controller (GC) predicts the load states of local controllers (LCs) from the Markov chain model (MCM) and allocates packets to LCs for processing through a binary search tree (BST). The performance evaluation of FT-SDWE is demonstrated using extensive OMNeT++ simulations. The proposed framework shows effectiveness in terms of bandwidth, jitter, response time, throughput, and migration time in comparison to SD-WiFi, EASM, GAME-SM, and load information strategy schemes. [ABSTRACT FROM AUTHOR]

Classification of high-entropy data sources is one of the key problems in the field of information security. Currently, there are many methods for classification of encrypted and compressed sequences; however, they mostly use digital signatures or service information found in the headers of the containers used to store or transfer data. This paper analyzes the state of research in the field of classification of encrypted and compressed data and develops a model of encrypted and compressed sequences. Our experiments demonstrate a high accuracy of the proposed approach, which allows us to conclude that the methods for classifying encrypted and compressed data used in our study have been improved. The approach can be implemented in data leak prevention systems or corporate email systems to analyze the attachments sent outside the controlled perimeter of a government agency or enterprise. Purpose of the research – develop a model of pseudo-random sequences generated by data encryption and compression algorithms that most accurately reflects statistical properties of these sequences. Methods of the research – statistical data analysis, mathematical statistics, and machine learning. Result of the research – An analysis of the studies aimed at solving the problem of classification for encrypted and compressed sequences in the field of information security is carried out. A model of pseudo-random sequences generated by encryption and compression algorithms is developed taking into account their statistical features: distribution of bytes and distribution of subsequences of limited length, which constitute a new probabilistic space. The choice of the statistical features used in the pseudo-random sequence model is justified. Experiments for determining the hyperparameters of the classifier on a dataset generated from encrypted and compressed files without taking their headers into account are carried out. The constraints used in the pseudo-random sequence model, namely, the length of pseudo-random sequences (approximately 600 Kb), are defined. Experiments for determining the effect of the statistical features used in the model on classification accuracy are conducted. The proposed approach allows encrypted and compressed data to be classified with an accuracy of 0.97. [ABSTRACT FROM AUTHOR]

This article proposes options of electronic digital signature algorithms, the cryptographic strength of which is based on the complexity of computing a discrete logarithm in a finite field and the complexity of solving a problem of decomposing a sufficiently large odd number to prime factors, on the hash function used, as well as their cryptanalysis. Unlike existing electronic digital signature algorithms (RSA, El-Gamal) in the proposed new electronic digital signature algorithm signature generation process – s, is carried out using a private parameter - ϕ(N). [ABSTRACT FROM AUTHOR]

Summary: Designing an efficient, short, and secure authentication algorithm for resource‐constrained sensor nodes of wireless sensor networks (WSNs) is a challenging task. Authentication in WSNs is mainly performed by the digital signature algorithm. In this paper, we propose an efficient, short, and secure pairing computation‐free ID‐based authentication algorithm (signature scheme) ESS‐IBAA for WSNs which completely follows the rule of identity‐based cryptosystem. Identity‐based schemes, unlike traditional public‐key infrastructure (PKI)‐based schemes, remove the need for public‐key certificates for public‐key validation. It also removes extra costs associated with the public‐key certificate and traffic management. Further, due to the requirement of low power and fast authentication, bilinear pairing computation‐free identity‐based signature schemes are applicable in WSNs. Keeping this in mind, ESS‐IBAA scheme is proposed, which is pairing computation free and uses a general cryptographic hash function in the place of a costly map‐to‐point hash function. The proposed scheme ESS‐IBAA is secure against existential forgery on adaptive chosen message and ID attack in the random oracle model under the hardness of the elliptic curve discrete logarithm problem (ECDLP). Moreover, comparative performance analysis shows that the proposed scheme ESS‐IBAA is much more efficient in both communication cost and computation cost from the existing related schemes. [ABSTRACT FROM AUTHOR]

A candidate for practical post-quantum digital signature algorithm based on computational difficulty of the hidden discrete logarithm problem is introduced. The used algebraic carrier represents a 4-dimensional finite non-commutative associative algebra defined over the field GF(p), which is caracterized in using a sparse basis vector multiplication table for defining the vector multiplication operation. Structure of the algebra is studied. Three types of the commutative groups are contained in the algebra and formulas for number of groups of every type are obtained. One of the types represents groups of the order (p-1)2, possessing 2-dimensional cyclicity, and one of them is used as a hidden group in the signature scheme developed using a new method for implementing a general criterion of post-quantum resistance proposed earlier. [ABSTRACT FROM AUTHOR]

0-RTT key exchange protocol allows clients to send encrypted protected payloads and the first key exchange protocol message at zero round-trip time,which has the advantages of non-interactive and off-line.In order to reduce the round-trip time of key exchange,this paper proposed a 0-RTT key exchange protocol on lattice based on the idea of penetrating encryption.Firstly,it utilized the one-time signatures algorithm and the hierarchical identity-based key encapsulation mechanism to construct penetrable forward secret key encapsulation scheme,and then used the penetrable forward secret key encapsulation scheme to design a 0-RTT key exchange protocol.The protocol only required the client side to authenticate the server one-way,and could effectively resist the quantum attack and replay attack.Compared with similar protocols,the proposed protocol has penetrable full forward secrecy,reduces the number of communication rounds and improves the communication efficiency. [ABSTRACT FROM AUTHOR]

In public key encryption with keyword search (PEKS), a secure channel is required in order to send trapdoors to the server, whereas in secure-channel free PEKS (SCF-PEKS), no such secure channel is required. In this paper, we propose a generic construction of SCF-PEKS with multiple keywords (SCF-MPEKS) from hidden vector encryption, tag-based encryption, and a one-time signature. Our generic construction provides adaptive security, where the test queries are allowed in the security model, and does not require random oracles. In addition to providing an instantiation of our generic construction, which is the first adaptive secure SCF-MPEKS scheme in the standard model, we implement the SCF-MPEKS scheme by using the PBC library. Moreover, we extend the Boneh-Waters range search technique, and show that the running time of our encryption algorithm is approximately twice as fast as that of the Boneh-Waters encryption algorithm. [ABSTRACT FROM AUTHOR]

Cross-border data sharing for knowledge generation is a challenging research direction since an application may access personal data stored in countries different from the one where the application is accessed from. In this article, we propose a cross-border data sharing platform where a global cloud is built atop multiple security gateways that are set up in different countries. Once an application requests access to data from a particular country or region, the global cloud collects the data stored in local data hubs through that region's security gateway. While transferring the data to the global cloud, the security gateway records this transfer information on a blockchain maintained by the global cloud. When an application reports any misbehavior (e.g., providing wrong data type or incorrect data) against a security gateway, the global cloud verifies the claim by auditing the blockchain and punishes the misbehaving security gateway if the claim is true. In the case of false misbehavior report, the application itself will be punished by the global cloud. Thus, our platform provides an accountable data sharing function using blockchain that relies on a relaxed trust assumption on the data providers. We include five algorithms to handle data access request, data sharing, blockchain transaction, detecting, and punishing misbehaving entities. In the algorithms, we also introduce how the transaction takes place in the platform. Thus, the proposed platform is able to handle misbehaving data sender, data receiver, or any entity participating in the platform. We analyze our platform empirically by showing different graphs, which have been generated by a number of experiments on blockchain environment. We also delineate how the multilayer of signature (Elliptic Curve Digital Signature Algorithm) acts in our platform. [ABSTRACT FROM AUTHOR]

Based on the quantum asymmetric encryption with trapdoor information, a quantum public-key signature scheme is proposed. In our scheme, the signer signs a message with his/her private key, while the verifier verifies the quantum signature with the corresponding quantum public key. The signer's private key and public key are asymmetric, and the signing algorithm and verifying algorithm are asymmetric as well. The security of the private key depends on the unconditionally secure deterministic quantum communication protocol rather than the classical one-way function. All the algorithms in our scheme are public. Hence, our scheme obeys Kerckhoffs's principle. Our scheme is secure against forgery, repudiation, and eavesdropping attacks. On the other hand, in our scheme, the verifier need not perform any quantum swap test. The signer's key pair can be reused due to the secrecy property of the private key. Compared with similar schemes, ours is relatively more secure and efficient. [ABSTRACT FROM AUTHOR]

Post-quantum (or quantum-resistant) cryptography refers to a set of cryptographic algorithms that are thought to remain secure even in the world of quantum computers. These algorithms are usually considered to be inefficient because of their big keys, or their running time. However, if quantum computers became a reality, security professionals will not have any other choice, but to use these algorithms. Lamport signature is a hash based one-time digital signature algorithm that is thought to be quantum-resistant. In this paper we will describe some simulation results related to the efficiency of the Lamport signature. [ABSTRACT FROM AUTHOR]

Elliptic Curve Digital Signature Algorithm (ECDSA) is a public key cryptographic algorithm based on the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP), it is used to ensure users' authentication, data integrity and transactions non-repudiation. However, its weakness is to derive the signer's private key in case he uses the same random number for to generate two signatures for two different messages. Firstly, in this paper we present the ECDSA and analyse its variants proposed in the literature.Also, we propose a new improvement technique for ECDSA of Liao and Shen and ECDSA of Chande and Lee. We intend to do so by introducing the unknown parameters which are used in the verification of the signature. Our aim is to overcome the problem which has not been explained in ECDSA schemes of both Liao and Shen and Chande and Lee. [ABSTRACT FROM AUTHOR]

To provide possibility to design the commutative encryption algorithms on the basis of new versions of the hidden discrete logarithm problem, the term "commutativity" is interpreted in the extended sense. Namely, the encryption algorithm is called commutative, if the double encryption on two different keys produces the ciphertext that can be correctly decrypted using the keys in arbitrary order. The introduced commutative encryption method is characterized in using the single-use random subkeys. This feature defines probabilistic nature of the encryption process. A candidate for post-quantum commutative encryption algorithm is proposed, using the computations in the 6-dimensional finite non-commutative associative algebra with a large set of the right-sided global units. The proposed algorithm is used as the base of the post-quantum no-key protocol. [ABSTRACT FROM AUTHOR]

With rapid development of quantum computing technology in recent years, the cryptanalytic algorithms based on quantum characteristics can be realized in the near future. Therefore, the security of the traditional symmetric or asymmetric cryptography may not be guaranteed as in the past, especially the key-distribution protocols and cryptosystems which are either based on the hard problems of calculating discrete logarithm or factoring. The purpose of this article is to explain how the Grover and Shor algorithms threat the security of the modern cryptography. Meanwhile, the strategy to enhance the security of the symmetric cryptography under the threat of Grover algorithm is also provided. Moreover, the development of the quantum key distribution (QKD) and the post-quantum cryptography (PQC), which will be used to replace the traditional key distribution techniques in the future, is also described. Related suggestions to deal with the threats of the quantum computing are also provided in this article for the references of the network security-related departments to establish the corresponding strategies. [ABSTRACT FROM AUTHOR]

Fault-tolerant aggregate signatures allow the verification algorithm to recognize and verify all the valid individual signatures in an aggregate signature. However, in ordinary aggregate signature schemes, if there is a single faulty individual signature in the valid aggregate, the whole aggregate will be invalid. This will make great difficulties in many applications including secure logging and batch verification in vehicular ad hoc network et al. In this paper, inspired by the finite set theory called uniform (k, n)-set proposed by Cao, we put forward a novel fault-tolerant aggregate signature scheme. Our new scheme is more efficient compared with previous fault-tolerant aggregate signature scheme based on cover-free family. It is noted that our scheme is quite easy to be implemented in the real scenario. [ABSTRACT FROM AUTHOR]

Cryptography in the form of digital signatures can be part of the solution to the threat of spoofing and is going to be implemented on Galileo and other Global Navigation Satellite Systems. Digital signatures incorporated into the data stream authenticate the integrity of the data as well as the origin of the message. Implementing a digital signature on a satellite‐based augmentation system for use in aviation will require the signature to be short and the signing procedure to be cryptographically relevant for the next 30 or more years. With the advent of quantum computing, many state‐of‐the‐art authentication schemes are no longer viable, so an authentication scheme implemented in satellite‐based augmentation system will need to be quantum secure. This paper introduces the cryptographic primitives (foundational problems) necessary to understand the vulnerabilities in modern‐day cryptography due to quantum computing and investigates the use of TESLA (Timed Efficient Stream Loss‐tolerant Algorithm) and EC‐Schnorr (Elliptic Curve‐Schnorr) algorithms in broadcast systems. [ABSTRACT FROM AUTHOR]

Hash functions are a fundamental part of computer security applications such as authentication systems and digital signatures. Many of these applications require a high processing rate; therefore, it is important to explore alternatives that contribute to reduce the computation time of these functions. This paper presents a two-stage pipelined architecture for SHA3-256 hash function that supports single and multi-message processing. Each pipeline stage executes two rounds of the algorithm in one clock cycle. The proposed pipelined architecture has been implemented in Xilinx Virtex-5 and achieves a throughput 27,98 Gbps. This implementation allowed to obtain an improvement in the overall performance of the two-stage pipelined KECCAK function regarding implementations of iterative round and even other implementations multi-stage pipelined. [ABSTRACT FROM AUTHOR]

Abstract Considering that Elliptic Curve Digital Signature Algorithm (ECDSA) implementations need to be efficient, flexible and Side Channel Attack (SCA) resistant, in this paper, a design approach and architecture for ECDSA and the underlined scalar multiplication operation is proposed for GF (2 k ), satisfying the above three directives. To achieve that, in the paper, Binary Edwards Curves (BECs) are adopted as an alternative to traditional Weierstrass Elliptic Curves (ECs) for GF (2 k ) since they offer intrinsic SCA resistance against simple attacks due to their uniformity, operation regularity and completeness. To achieve high performance and flexibility, we propose a hardware/software ECDSA codesign approach where scalar multiplication is implemented in hardware and integrated in the ECDSA functionality through appropriate drivers of an ECDSA software stack. To increase BEC scalar multiplier performance and introduce SCA resistance we adopt and expand a parallelism design strategy/methodology where GF (2 k ) operations of a scalar multiplier round for both point operations performed in this round are reordered and assigned into parallelism layer in order to be executed concurrently. Within this strategy we include hardware and software based SCA countermeasures that rely on masking/randomization and hiding. While scalar randomization is realized by the ECDSA software stack in an easy way, in order to achieve resistance using hardware means, we propose and introduce in every scalar multiplier round, within the parallelism layers, projective coordinates randomization of all the round's output points. So, in our approach, considering that with the proposed parallelism plan in every scalar multiplier round BEC point operations are performed in parallel and that the round's output points are randomized with a different number in each round, we manage to achieve maximum SCA resistance. To validate this resistance, we introduce and realize a leakage assessment process on BEC scalar multipliers for the first time in research literature. This process is based on real measurements collected from a controlled SAKURA X environment with a GF (2233) based scalar multiplier implementation. Using Welch's t -test we investigate possible information leakage of the multiplier's input point and scalar and after an extended analysis we find trivial leakage. Finally, we validate the ECDSA architecture and its scalar multiplier efficiency by implementing it on a Zynq 7000 series FPGA Avnet Zedboard and collecting very promising, well balanced, results on speed and hardware resources in comparison with other works. [ABSTRACT FROM AUTHOR]

Although postquantum cryptography is of growing practical concern, not many works have been devoted to implementation security issues related to postquantum schemes. In this paper, we look in particular at fault attacks against implementations of lattice-based signatures and key exchange protocols. For signature schemes, we are interested both in Fiat–Shamir type constructions (particularly BLISS, but also GLP, PASSSign, and Ring-TESLA) and in hash-and-sign schemes (particularly the GPV-based scheme of Ducas–Prest–Lyubashevsky). For key exchange protocols, we study the implementations of NewHope, Frodo, and Kyber. These schemes form a representative sample of modern, practical lattice-based signatures and key exchange protocols, and achieve a high level of efficiency in both software and hardware. We present several fault attacks against those schemes that recover the entire key recovery with only a few faulty executions (sometimes only one), show that those attacks can be mounted in practice based on concrete experiments in hardware, and discuss possible countermeasures against them. [ABSTRACT FROM AUTHOR]