scholarly journals A Novel Hardware Security Architecture for IoT Device: PD-CRP (PUF Database and Challenge–Response Pair) Bloom Filter on Memristor-Based PUF

2020 ◽  
Vol 10 (19) ◽  
pp. 6692
Author(s):  
Jungwon Lee ◽  
Seoyeon Choi ◽  
Dayoung Kim ◽  
Yunyoung Choi ◽  
Wookyung Sun
Keyword(s):  
Data Transmission ◽  
Hardware Security ◽  
Bloom Filter ◽  
Transmission Error ◽  
Bloom Filters ◽  
Search Performance ◽  
Security Technology ◽  
Security Environment ◽  
Filter Size ◽  
Simulation Results

Because the development of the Internet of Things (IoT) requires technology that transfers information between objects without human intervention, the core of IoT security will be secure authentication between devices or between devices and servers. Software-based authentication may be a security vulnerability in IoT, but hardware-based security technology can provide a strong security environment. Physical unclonable functions (PUFs) are hardware security element suitable for lightweight applications. PUFs can generate challenge–response pairs(CRPs) that cannot be controlled or predicted by utilizing inherent physical variations that occur in the manufacturing process. In particular, the pulsewidth-based memristive PUF (pm-PUF) improves security performance by applying different write pulse widths and bank structures. Bloom filters (BFs) are probabilistic data structures that answer membership queries using small memories. Bloom filters can improve search performance and reduce memory usage and are used in areas such as networking, security, big data, and IoT. In this paper, we propose a structure that applies Bloom filters based on the pm-PUF to reduce PUF data transmission errors. The proposed structure uses two different Bloom filter types that store different information and that are located in front of and behind the pm-PUF, reducing unnecessary access by removing challenges from attacker access. Simulation results show that the proposed structure decreases the data transmission error rate and reuse rate as the Bloom filter size increases; the simulation results also show that the proposed structure improves pm-PUF security with a very small Bloom filter memory.

scholarly journals A Novel Hardware Security Architecture: PD-CRP(PUF Database & Challenge-Response Pair) Bloom Filter on Memristor Based PUF

2020 ◽  
Author(s):  
Jungwon Lee ◽  
Seoyeon Choi ◽  
Dayoung Kim ◽  
Yunyoung Choi ◽  
Wookyung Sun
Keyword(s):  
Data Transmission ◽  
Hardware Security ◽  
Bloom Filter ◽  
Transmission Error ◽  
Bloom Filters ◽  
Search Performance ◽  
Security Technology ◽  
Security Environment ◽  
Filter Size ◽  
Simulation Results

Because the development of the internet of things (IoT) requires technology that transfers information between objects without human intervention, the core of IoT security will be secure authentication between devices or between devices and servers. Software-based authentication may be a security vulnerability in IoT, but hardware-based security technology can provide a strong security environment. A physical unclonable functions (PUFs) are a hardware security element suitable for lightweight applications. PUFs can generate challenge-response pairs(CRPs) that cannot be controlled or predicted by utilizing inherent physical variations that occur in the manufacturing process. In particular, pulse width memristive PUF (PWM-PUF) improves security performance by applying different write pulse widths and bank structures. Bloom filter (BF) is probabilistic data structures that answer membership queries using small memories. Bloom filter can improve search performance and reduce memory usage and are used in areas such as networking, security, big data, and IoT. In this paper, we propose a structure that applies Bloom filters based on the PWM-PUF to reduce PUF data transmission errors. The proposed structure uses two different Bloom filter types that store different information and that are located in front of and behind the PWM-PUF, improving security by removing challenges from attacker access. Simulation results show that the proposed structure decreases the data transmission error rate and reuse rate as the Bloom filter size increases, the simulation results also show that the proposed structure improves PWM-PUF security with a very small Bloom filter memory.

scholarly journals A Novel Prefix Cache with Two-Level Bloom Filters in IP Address Lookup

2020 ◽  
Vol 10 (20) ◽  
pp. 7198
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Moon Sun Shin ◽  
Jinsoo Kim
Keyword(s):  
False Positive ◽  
Bloom Filter ◽  
Bloom Filters ◽  
Experimental Result ◽  
Ip Address ◽  
Positive Ratio ◽  
Ip Addresses ◽  
False Positive Ratio ◽  
Ip Address Lookup ◽  
Filter Size

Prefix caching is one of the notable techniques in enhancing the IP address lookup performance which is crucial in packet forwarding. A cached prefix can match a range of IP addresses, so prefix caching leads to a higher cache hit ratio than IP address caching. However, prefix caching has an issue to be resolved. When a prefix is matched in a cache, the prefix cannot be the result without assuring that there is no longer descendant prefix of the matching prefix which is not cached yet. This is due to the aspect of the IP address lookup seeking to find the longest matching prefix. Some prefix expansion techniques avoid the problem, but the expanded prefixes occupy more entries as well as cover a smaller range of IP addresses. This paper proposes a novel prefix caching scheme in which the original prefix can be cached without expansion. In this scheme, for each prefix, a Bloom filter is constructed to be used for testing if there is any matchable descendant. The false positive ratio of a Bloom filter generally grows as the number of elements contained in the filter increases. We devise an elaborate two-level Bloom filter scheme which adjusts the filter size at each level, to reduce the false positive ratio, according to the number of contained elements. The experimental result shows that the proposed scheme achieves a very low cache miss ratio without increasing the number of prefixes. In addition, most of the filter assertions are negative, which means the proposed prefix cache effectively hits the matching prefix using the filter.

scholarly journals Lighter: fast and memory-efficient error correction without counting

2014 ◽  
Author(s):  
Li Song ◽  
Liliana Florea ◽  
Ben Langmead
Keyword(s):  
Bloom Filter ◽  
The Other ◽  
Bloom Filters ◽  
Efficient Tool ◽  
Sequencing Errors ◽  
Sampling Fraction ◽  
Filter Size ◽  
Comparable Accuracy ◽  
Fast Memory ◽  
Memory Efficient

Lighter is a fast, memory-efficient tool for correcting sequencing errors. Lighter avoids counting k-mers. Instead, it uses a pair of Bloom filters, one holding a sample of the input k-mers and the other holding k-mers likely to be correct. As long as the sampling fraction is adjusted in inverse proportion to the depth of sequencing, Bloom filter size can be held constant while maintaining near-constant accuracy. Lighter is parallelized, uses no secondary storage, and is both faster and more memory-efficient than competing approaches while achieving comparable accuracy.

A Dicode Signaling Scheme for Capacitively Coupled Interface

2011 ◽  
Vol 497 ◽  
pp. 296-305
Author(s):  
Yasushi Yuminaka ◽  
Kyohei Kawano
Keyword(s):  
Partial Response ◽  
Data Transmission ◽  
High Speed ◽  
Circuit Simulation ◽  
Frequency Bandwidth ◽  
Capacitively Coupled ◽  
Limited Frequency ◽  
Simulation Results ◽  
Response Coding ◽  
The Impact

In this paper, we present a bandwidth-efficient partial-response signaling scheme for capacitivelycoupled chip-to-chip data transmission to increase data rate. Partial-response coding is knownas a technique that allows high-speed transmission while using a limited frequency bandwidth, by allowingcontrolled intersymbol interference (ISI). Analysis and circuit simulation results are presentedto show the impact of duobinary (1+D) and dicode (1-D) partial-response signaling for capacitivelycoupled interface.

The Design and Implementation of ECC High-Speed Encryption Engine Based on FPGA

2012 ◽  
Vol 459 ◽  
pp. 544-548 ◽  
Author(s):  
Wei Liang ◽  
Jian Bo Xu ◽  
Wei Hong Huang ◽  
Li Peng
Keyword(s):  
Data Transmission ◽  
High Speed ◽  
Lower Cost ◽  
Low Cost ◽  
Rapid Development ◽  
Security Technology ◽  
Multiplication Algorithm ◽  
Secure Data Transmission ◽  
And Performance ◽  
Computation Speed

Network security technology ensures secure data transmission in network. Meanwhile, it brings extra overhead of security system in terms of cost and performance, which seriously affects the rapid development of existing high-speed encryption systems. The existing encryption technology cannot meet the demand of high security, low cost and high real-time. For solving above problems, an ECC encryption engine architecture based on scalable public key cipher and a high-speed configurable multiplication algorithm are designed. The algorithm was tested on FPGA platform and the experiment results show that the system has better computation speed and lower cost overhead. By comparing with other systems, our system has benefits in terms of hardware overhead and encryption time ratio

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

Research of Trusted Network Security Technology

2011 ◽  
Vol 52-54 ◽  
pp. 713-716
Author(s):  
Xiao Ying Gan ◽  
Bin Liu
Keyword(s):  
Data Transmission ◽  
Network Access ◽  
End User ◽  
Security Technology ◽  
Resources Management ◽  
Integrity Verification ◽  
Reliable Model ◽  
User Data ◽  
Repair Techniques

Based on the TNC architecture, using a trusted network of repair techniques in the trusted network access scenario does not meet the requirements of integrity verification solution for end users. Put forward a credible fix the overall network design, reliable model restoration and repair services, network workflow. The system is in need of restoration to provide safe and reliable repair end-user data transmission, providing a humane, reasonable repair services to ensure the credibility of fixed network and the isolation effect of the terminal to be repaired and strengthened the security of fixed server. Realized the classification of various types of repair resources management, restoration of resources in ensuring the transfer of fast, reliable, based on the performance with a certain extension.

scholarly journals Simulation and Measurement Studies of The Vdes System’s Terrestrial Component

2019 ◽  
Vol 26 (1) ◽  
pp. 95-106 ◽  
Author(s):  
Krzysztof Bronk ◽  
Patryk Koncicki ◽  
Adam Lipka ◽  
Dominik Rutkowski ◽  
Błażej Wereszko
Keyword(s):  
Data Transmission ◽  
Data Exchange ◽  
Technical Information ◽  
Theoretical Data ◽  
Current Version ◽  
Coding Gain ◽  
Exchange System ◽  
Measurement Results ◽  
Simulation Results ◽  
Theoretical Results

Abstract In the paper, the measurement and simulation results of the VDES (VHF Data Exchange System) terrestrial component are discussed. It is anticipated that VDES will be one of the major solutions for maritime communications in the VHF band and its performance will be sufficient to fulfill the requirements of the e-navigation applications. The process of the VDES standardization (ITU R, IALA) has not been officially completed yet, but substantial amount of technical information about the future system’s terrestrial component (VDE-TER) is already available. The paper is divided into three general parts: (a) theoretical presentation of the system’s physical layer and the radio channels applicable to VDES, (b) simulation results (BER, BLER, channel delay between two propagation paths and its influence on bit rates) and (c) measurement results (useful ranges, BER). It turned out that in real maritime conditions, the VDES system can offer ranges between 25 and 38 km for the configurations assumed during the measurement campaign. Those results are generally compliant with the theoretical data in the line-of-sight conditions. In the NLOS scenarios, where fading becomes the dominant phenomenon, the discrepancies between the measurements and the theoretical results were more significant. The obtained results confirmed that VDES provides a large coding gain, which significantly improves the performance of data transmission and increases the bit rate compared to the existing maritime radiocommunication solutions. It should be noted that the results presented in the article were used by the IALA while developing the current version of the VDES specification.

The Prediction of the Error Rate in the Data Transmission Based on Improved Chaotic Optimization Neural Network

2013 ◽  
Vol 380-384 ◽  
pp. 1829-1833
Author(s):  
Xin Ping Liu ◽  
Jun Peng Xu ◽  
Hui Liu ◽  
Xiao Ling Wu
Keyword(s):  
Neural Network ◽  
Error Rate ◽  
Bp Neural Network ◽  
Data Transmission ◽  
Local Minimum ◽  
Continuous Wave ◽  
Transmission Error ◽  
Small Samples ◽  
Chaos Optimization ◽  
Neural Network Algorithm

As the slurry continuous wave changes according to the measurement of drilling (MWD) date, the precision of error rate prediction is low and the process of transferring data will be affected by signals. Based on the BP neural networks extensive mapping ability and chaos optimization algorithms global convergent ability, we structure a kind of improved chaos optimization of BP neural network algorithm. This algorithm can avoid several problems, such as the convergent speed of BP neural network is slow and the BP neural network is easy to sink into local minimum. With the powerful ability of generalization and prediction, this kind of algorithm can also be used to predict the data transmission error rate in slurry continuous wave. Under the condition of small samples, we create a model of data transmission in slurry continuous wave, which is based on improved chaos optimization of BP neural network. Simulate experiment has tested this algorithms feasibility and effectiveness

scholarly journals Route Prefix Caching Using Bloom Filters in Named Data Networking

2020 ◽  
Vol 10 (7) ◽  
pp. 2226
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Jinsoo Kim ◽  
Moon Sun Shin
Keyword(s):  
Bloom Filter ◽  
Bloom Filters ◽  
Experimental Result ◽  
Named Data Networking ◽  
Next Generation Internet ◽  
Complex Process ◽  
Caching Scheme ◽  
Name Lookup ◽  
Cache Miss ◽  
Data Networking

This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure. The name lookup is a crucial function of the NDN router, which delivers a packet based on its name rather than IP address. It carries out a complex process to find the longest matching prefix for the content name. Even the size of a name prefix is variable and unbounded; thus, the name lookup is to be more complicated and time-consuming. The name lookup can be sped up by using route prefix caching, but it may cause a problem when non-leaf prefixes are cached. The proposed prefix caching scheme can cache non-leaf prefixes, as well as leaf prefixes, without incurring any problem. For this purpose, a Bloom filter is kept for each prefix. The Bloom filter, which is widely used for checking membership, is utilized to indicate the branch information of a non-leaf prefix. The experimental result shows that the proposed caching scheme achieves a much higher hit ratio than other caching schemes. Furthermore, how much the parameters of the Bloom filter affect the cache miss count is quantitatively evaluated. The best performance can be achieved with merely 8-bit Bloom filters and two hash functions.

Sign in / Sign up

Export Citation Format

Share Document