An efficient and provably secure key agreement scheme for satellite communication systems.
Ontology highlight
ABSTRACT:
SUBMITTER: Zhang Y
PROVIDER: S-EPMC8075218 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. The security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.
| S-EPMC5706749 | biostudies-literature
Project description:The approach of instantiating authenticated group key exchange (GAKE) protocol from the multikey encapsulation mechanism (mKEM) has an important advantage of achieving classical requirement of GAKE security in one communication round. In spite of the limitations of this approach, for example, lack of forward secrecy, it is very useful in group environments when maximum communication efficiency is desirable. To enrich this mKEM-based GAKE construction, we suggest an efficient solution to convert this static GAKE framework into a partially dynamic scheme. Furthermore, to address the associated lack of forward-secrecy, we propose two variants of this generic construction which can also provide a means of forward secrecy at the cost of extra communication round. In addition, concerning associated implementation cost of deploying this generic GAKE construction in elliptic curve cryptosystem, we compare the possible instantiations of this model from existing mKEM algorithms in terms of the number of elliptic curve scalar multiplications.
| S-EPMC4588352 | biostudies-other
Project description:The Internet of Vehicles (IoV) counts for much in advancing intelligent transportation by connecting people, vehicles, infrastructures, and cloud servers (CS). However, the open-access wireless channels within the IoV are susceptible to malicious attacks. Therefore, an authentication key agreement protocol becomes essential to ensure secure vehicular communications and protect vehicle privacy. Nevertheless, although the vehicles in the group are compromised, they can still update the group key and obtain the communication content in the existing group key agreement protocols. Therefore, it is still challenging to guarantee post-compromise forward security (PCFS). Dynamic key rotation is a common approach to realizing PCFS, which brings a heavy computation and communication burden. To address these issues, an efficient and robust continuous group key agreement (ER-CGKA) scheme with PCFS is designed for IoV. The propose-and-commit flow is employed to support asynchronous group key updates. Besides, the computation cost and communication overhead are significantly reduced based on the TreeKEM architecture. Furthermore, we adopt the threshold mechanism to resist the collusion attacks of malicious vehicles, which enhances the ER-CGKA scheme's robustness. Security analysis indicates that the proposed scheme satisfies all the fundamental security requirements of the IoV and achieves PCFS. The performance evaluation results show that our ER-CGKA scheme demonstrates a reduction in the computation cost of 18.82% (Client) and 33.18% (CS) approximately, and an increase in communication overhead of around 55.57% since pseudonyms are utilized to achieve conditional privacy-preserving. Therefore, our ER-CGKA scheme is secure and practical.
| S-EPMC11361688 | biostudies-literature
Project description:Code-based cryptography is one of few alternatives supposed to be secure in a post-quantum world. Meanwhile, identity-based identification and signature (IBI/IBS) schemes are two of the most fundamental cryptographic primitives, so several code-based IBI/IBS schemes have been proposed. However, with increasingly profound researches on coding theory, the security reduction and efficiency of such schemes have been invalidated and challenged. In this paper, we construct provably secure IBI/IBS schemes from code assumptions against impersonation under active and concurrent attacks through a provably secure code-based signature technique proposed by Preetha, Vasant and Rangan (PVR signature), and a security enhancement Or-proof technique. We also present the parallel-PVR technique to decrease parameter values while maintaining the standard security level. Compared to other code-based IBI/IBS schemes, our schemes achieve not only preferable public parameter size, private key size, communication cost and signature length due to better parameter choices, but also provably secure.
| S-EPMC5557532 | biostudies-literature
Project description:In recent years, with the increase in degenerative diseases and the aging population in advanced countries, demands for medical care of older or solitary people have increased continually in hospitals and healthcare institutions. Applying wireless sensor networks for the IoT-based telemedicine system enables doctors, caregivers or families to monitor patients' physiological conditions at anytime and anyplace according to the acquired information. However, transmitting physiological data through the Internet concerns the personal privacy of patients. Therefore, before users can access medical care services in IoT-based medical care system, they must be authenticated. Typically, user authentication and data encryption are most critical for securing network communications over a public channel between two or more participants. In 2016, Liu and Chung proposed a bilinear pairing-based password authentication scheme for wireless healthcare sensor networks. They claimed their authentication scheme cannot only secure sensor data transmission, but also resist various well-known security attacks. In this paper, we demonstrate that Liu-Chung's scheme has some security weaknesses, and we further present an improved secure authentication and data encryption scheme for the IoT-based medical care system, which can provide user anonymity and prevent the security threats of replay and password/sensed data disclosure attacks. Moreover, we modify the authentication process to reduce redundancy in protocol design, and the proposed scheme is more efficient in performance compared with previous related schemes. Finally, the proposed scheme is provably secure in the random oracle model under ECDHP.
| S-EPMC5551096 | biostudies-other
Project description:Efficient authentication and key agreement protocols between two entities are required in many application areas. In particular, for client-server type of architectures, the client is mostly represented by a constrained device and thus highly efficient protocols are needed. We propose in this paper two protocols enabling the construction of a mutual authenticated key ensuring anonymity and unlinkability of the client and resisting the most well known attacks. The main difference between the two proposed protocols is in the storage requirements on the server side. The innovation of our protocols relies on the fact that, thanks to the usage of the sponge construction, available in the newly proposed SHA3 standard with underlying Keccak design, the computation cost can be reduced to only one hash operation on the client side in case of the protocol with storage and two hash operations for the protocol without storage and thus leads to a very efficient solution.
| S-EPMC7218714 | biostudies-literature
Project description:In heterogeneous wireless networks, the industrial Internet of Things (IIoT) is an essential contributor to increasing productivity and effectiveness. However, in various domains, such as industrial wireless scenarios, small cell domains, and vehicular ad hoc networks, an efficient and stable authentication algorithm is required (VANET). Specifically, IoT vehicles deal with vast amounts of data transmitted between VANET entities in different domains in such a large-scale environment. Also, crossing from one territory to another may have the connectivity services down for a while, leading to service interruption because it is pervasive in remote areas and places with multipath obstructions. Hence, it is vulnerable to specific attacks (e.g., replay attacks, modification attacks, man-in-the-middle attacks, and insider attacks), making the system inefficient. Also, high processing data increases the computation and communication cost, leading to an increased workload in the system. Thus, to solve the above issues, we propose an online/offline lightweight authentication scheme for the VANET cross-domain system in IIoT to improve the security and efficiency of the VANET. The proposed scheme utilizes an efficient AES-RSA algorithm to achieve integrity and confidentiality of the message. The offline joining is added to avoid remote network intrusions and the risk of network service interruptions. The proposed work includes two different significant goals to achieve first, then secure message on which the data is transmitted and efficiency in a cryptographic manner. The Burrows Abdi Needham (BAN logic) logic is used to prove that this scheme is mutually authenticated. The system's security has been tested using the well-known AVISPA tool to evaluate and verify its security formally. The results show that the proposed scheme outperforms the ID-CPPA, AAAS, and HCDA schemes by 53%, 55%, and 47% respectively in terms of computation cost, and 65%, 83%, and 40% respectively in terms of communication cost.
| S-EPMC8670398 | biostudies-literature
Project description:We propose a quantum secure group communication protocol for the purpose of sharing the same message among multiple authorized users. Our protocol can remove the need for key management that is needed for the quantum network built on quantum key distribution. Comparing with the secure quantum network based on BB84, we show our protocol is more efficient and securer. Particularly, in the security analysis, we introduce a new way of attack, i.e., the counterfactual quantum attack, which can steal information by "invisible" photons. This invisible photon can reveal a single-photon detector in the photon path without triggering the detector. Moreover, the photon can identify phase operations applied to itself, thereby stealing information. To defeat this counterfactual quantum attack, we propose a quantum multi-user authorization system. It allows us to precisely control the communication time so that the attack can not be completed in time.
| S-EPMC5832868 | biostudies-other
Project description:We introduce a two-loop power control that allows an efficient use of the overall power resources for commercial wireless networks based on cross-layer optimization. This approach maximizes the network's utility in the outer-loop as a function of the averaged signal to interference-plus-noise ratio (SINR) by considering adaptively the changes in the network characteristics. For this purpose, the concavity property of the utility function was verified with respect to the SINR, and an iterative search was proposed with guaranteed convergence. In addition, the outer-loop is in charge of selecting the detector that minimizes the overall power consumption (transmission and detection). Next the inner-loop implements a feedback power control in order to achieve the optimal SINR in the transmissions despite channel variations and roundtrip delays. In our proposal, the utility maximization process and detector selection and feedback power control are decoupled problems, and as a result, these strategies are implemented at two different time scales in the two-loop framework. Simulation results show that substantial utility gains may be achieved by improving the power management in the wireless network.
| S-EPMC3934094 | biostudies-other
Project description:Biomolecular cryptography exploiting specific biomolecular interactions for data encryption represents a unique approach for information security. However, constructing protocols based on biomolecular reactions to guarantee confidentiality, integrity and availability (CIA) of information remains a challenge. Here we develop DNA origami cryptography (DOC) that exploits folding of a M13 viral scaffold into nanometer-scale self-assembled braille-like patterns for secure communication, which can create a key with a size of over 700 bits. The intrinsic nanoscale addressability of DNA origami additionally allows for protein binding-based steganography, which further protects message confidentiality in DOC. The integrity of a transmitted message can be ensured by establishing specific linkages between several DNA origamis carrying parts of the message. The versatility of DOC is further demonstrated by transmitting various data formats including text, musical notes and images, supporting its great potential for meeting the rapidly increasing CIA demands of next-generation cryptography.
| S-EPMC6884444 | biostudies-literature