Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network.

ABSTRACT: Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.

SUBMITTER: Yang B

PROVIDER: S-EPMC5539482 | biostudies-other | 2017 Jun

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Composable security of CV-MDI-QKD with secret key rate and data processing.

Project description:We provide a rigorous security proof of continuous-variable measurement-device-independent quantum key distribution which incorporates finite-size effects and composable terms. In order to use realistic and optimized parameters and be able to derive results close to experimental expectations, we run protocol simulations supported by a Python library, including all the protocol operations, from simulating the quantum communication till the extraction of the final key.

| S-EPMC10356849 | biostudies-literature

Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing.

Project description:Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir's (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (?90?km).

| S-EPMC4929494 | biostudies-other

ER-CGKA: Efficient and robust continuous group key agreement scheme with post-compromise forward security for IoV.

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

Multicomponent reactions provide key molecules for secret communication.

Project description:A convenient and inherently more secure communication channel for encoding messages via specifically designed molecular keys is introduced by combining advanced encryption standard cryptography with molecular steganography. The necessary molecular keys require large structural diversity, thus suggesting the application of multicomponent reactions. Herein, the Ugi four-component reaction of perfluorinated acids is utilized to establish an exemplary database consisting of 130 commercially available components. Considering all permutations, this combinatorial approach can unambiguously provide 500,000 molecular keys in only one synthetic procedure per key. The molecular keys are transferred nondigitally and concealed by either adsorption onto paper, coffee, tea or sugar as well as by dissolution in a perfume or in blood. Re-isolation and purification from these disguises is simplified by the perfluorinated sidechains of the molecular keys. High resolution tandem mass spectrometry can unequivocally determine the molecular structure and thus the identity of the key for a subsequent decryption of an encoded message.

| S-EPMC5897361 | biostudies-literature

Deep Reinforcement Learning-Based Online One-to-Multiple Charging Scheme in Wireless Rechargeable Sensor Network.

Project description:Wireless rechargeable sensor networks (WRSN) have been emerging as an effective solution to the energy constraint problem of wireless sensor networks (WSN). However, most of the existing charging schemes use Mobile Charging (MC) to charge nodes one-to-one and do not optimize MC scheduling from a more comprehensive perspective, leading to difficulties in meeting the huge energy demand of large-scale WSNs; therefore, one-to-multiple charging which can charge multiple nodes simultaneously may be a more reasonable choice. To achieve timely and efficient energy replenishment for large-scale WSN, we propose an online one-to-multiple charging scheme based on Deep Reinforcement Learning, which utilizes Double Dueling DQN (3DQN) to jointly optimize the scheduling of both the charging sequence of MC and the charging amount of nodes. The scheme cellularizes the whole network based on the effective charging distance of MC and uses 3DQN to determine the optimal charging cell sequence with the objective of minimizing dead nodes and adjusting the charging amount of each cell being recharged according to the nodes' energy demand in the cell, the network survival time, and MC's residual energy. To obtain better performance and timeliness to adapt to the varying environments, our scheme further utilizes Dueling DQN to improve the stability of training and uses Double DQN to reduce overestimation. Extensive simulation experiments show that our proposed scheme achieves better charging performance compared with several existing typical works, and it has significant advantages in terms of reducing node dead ratio and charging latency.

| S-EPMC10143104 | biostudies-literature

A Lightweight Internet Sharing Scheme for Sectional Medical Images according to Existing Hospital Network Facilities and Basic Information Security Rules.

Project description:BackgroundWith the outbreak of COVID-19, large-scale telemedicine applications can play an important role in the epidemic areas or less developed areas. However, the transmission of hundreds of megabytes of Sectional Medical Images (SMIs) from hospital's Intranet to the Internet has the problems of efficiency, cost, and security. This article proposes a novel lightweight sharing scheme for permitting Internet users to quickly and safely access the SMIs from a hospital using an Internet computer anywhere but without relying on a virtual private network or another complex deployment.MethodsA four-level endpoint network penetration scheme based on the existing hospital network facilities and information security rules was proposed to realize the secure and lightweight sharing of SMIs over the Internet. A "Master-Slave" interaction to the interactive characteristics of multiplanar reconstruction and maximum/minimum/average intensity projection was designed to enhance the user experience. Finally, a prototype system was established.ResultsWhen accessing SMIs with a data size ranging from 251.6 to 307.04 MB with 200 kBps client bandwidth (extreme test), the network response time to each interactive request remained at approximately 1 s, the original SMIs were kept in the hospital, and the deployment did not require a complex process; the imaging quality and interactive experience were recognized by radiologists.ConclusionsThis solution could serve Internet medicine at a low cost and may promote the diversified development of mobile medical technology. Under the current COVID-19 epidemic situation, we expect that it could play a low-cost and high-efficiency role in remote emergency support.

| S-EPMC7737442 | biostudies-literature

Information Security Scheme Based on Computational Temporal Ghost Imaging.

Project description:An information security scheme based on computational temporal ghost imaging is proposed. A sequence of independent 2D random binary patterns are used as encryption key to multiply with the 1D data stream. The cipher text is obtained by summing the weighted encryption key. The decryption process can be realized by correlation measurement between the encrypted information and the encryption key. Due to the instinct high-level randomness of the key, the security of this method is greatly guaranteed. The feasibility of this method and robustness against both occlusion and additional noise attacks are discussed with simulation, respectively.

| S-EPMC5550463 | biostudies-other

A secure cross-domain interaction scheme for blockchain-based intelligent transportation systems

Project description: Not available

| S-EPMC10703034 | biostudies-literature

On the (relation between) efficiency and secret key rate of QKD.

Project description:The processes of evaluation and comparison play a vital role in the development of a scientific field. In the field of quantum cryptography (especially quantum key distribution, QKD), the so-called secret key rate is used for characterizing the performance of a protocol (scheme). However the current definition of this quantity is incomplete. It does not consider the classical communication process taking place in a QKD protocol. There exists a quantity that involves all the procedures (resources) in a communication process: it is the efficiency (total efficiency). This paper reports a definition of this parameter. Also the relation between the total efficiency and key rate is found. By means of this relation, the total secret key rate of a QKD protocol is expressed. An application of the total key rate is demonstrated: the original twin-field QKD (TF-QKD) is evaluated in terms of this rate. The paper also shows a comparison between the total key rate and the standard key rate of a TF-QKD.

| S-EPMC10864355 | biostudies-literature

Utilization of social health security scheme among the households of Illam district, Nepal

Project description:Background Nepal has implemented the social health security program in certain health facilities to improve access to quality health services. The aim of the study is to understand the utilization pattern of social health security schemes and community’s perception of the social health security program. Method A descriptive cross-sectional mixed-method study was conducted among 300 households of Illam district who had enrolled in the social health security scheme. A multi-stage random sampling method was used. A semi-structured questionnaire was used to collect quantitative data whereas focus group discussions (FGDs) were conducted for qualitative data. Descriptive analysis, bivariate and multivariate analysis was done. FGDs were transcribed and thematic analysis was done. Findings The utilization rate of social health security scheme was 88.7%. Factors associated with the utilization of program included: presence of under-five children and chronic illness in households, sex and age group. Focus group discussion revealed that people were aware of social health insurance and pleased with program implemented by government. However, the hospitals under the social health insurance were not able to meet their expectations. Conclusion Although the utilization of social health security scheme was high, people were dissatisfied with the service provided by the hospital under the social health security scheme. Therefore, the social health insurance board should closely monitor the hospitals and develop a feedback mechanism from the users.

| S-EPMC9089892 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data