Securing Network-on-Chip Using Incremental Cryptography

Charles, Subodha; Mishra, Prabhat

doi:10.1109/isvlsi49217.2020.00039

Cited by 37 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the NIs are assumed trusted (in-house design), the countermeasure(s) can be integrated within the NI units. Many researchers have integrated their security solutions in the NI units, e.g., bulky modules for symmetric and asymmetric cryptography [40], [49], [50]. Also, most countermeasures that guarantee secure memory access are implemented in the NI.…”

Section: Wired Nocs Countermeasuresmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on the Security of Wired, Wireless, and 3D Network-on-Chips

et al. 2021

View full text Add to dashboard Cite

Network-on-Chips (NoCs) have been widely used as a scalable communication solution in the design of multiprocessor system-on-chips (MPSoCs). NoCs manage communications between on-chip Intellectual Property (IP) cores and allow processing cores to achieve higher performance by outsourcing their communication tasks. NoC paradigm is based on the idea of resource sharing where hardware resources, including buffers, communication links, routers, etc., are shared between all IPs of the MPSoC. In fact, the data being routed by each NoC router might not be related to the router's local core. Such a utilization-centric design approach can raise security issues in MPSoCs-based designs, e.g., integrity and confidentiality of the data being routed in an NoC might be compromised by unauthorized accesses/modifications of intermediate routers. Many papers in the literature have discovered and addressed security holes of NoCs, aiming at improving the security of the NoC paradigm. However, to the best of our knowledge, there is no solid survey study on the security vulnerabilities and countermeasures for NoCs. This paper will review security threats and countermeasures proposed so far for wired NoCs, wireless NoCs, and 3D NoCs. The paper aims at giving the readers an insight into the attacks and weaknesses/strengths of countermeasures.

show abstract

Section: Wired Nocs Countermeasuresmentioning

confidence: 99%

“…To reduce the cost of AES and still add high level of security, the authors of [50] adopted the Hummingbird-2 [60] block cipher scheme. Hummingbird-2 is a lightweight encryption which is mostly implemented in RFID tags.…”

Section: A Data Confidentiality Countermeasuresmentioning

confidence: 99%

A Survey on the Security of Wired, Wireless, and 3D Network-on-Chips

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Charles and Mishra [8] proposed to secure data routing in NoC using incremental cryptography [9]. Incremental cryptography has significant improvement over traditional cryptography.…”

Section: Related Workmentioning

confidence: 99%

Lightweight Cryptography for Network-on-Chip Data Encryption

Ayachi

Mhaouch

Abdelali

2021

Security and Communication Networks

View full text Add to dashboard Cite

System-on-chip (SoC) is the main processor for most recent applications such as the Internet of things (IoT). SoCs are composed of multiple blocks that communicate with each other through an integrated router. Data routing from a block to another poses many challenges. The network-on-chip (NoC) was used for the transmission of data from a source to a destination with high reliability, high speed, low power consumption, and low hardware occupation. An NoC is composed of a router, network links (NL), and network interface (NI). The main component of the NoC, the NI, is composed of an input/output FIFO, a finite state machine (FSM), pack, and depack modules. Data transmission from a block to another poses a security problem such as secret information extraction. In this paper, we proposed a data encryption framework for NoC based on a light encryption device (LED) algorithm. The main advantages of the proposed algorithm are to reduce the implementation area and to achieve high speed while reducing the power consumption. The proposed encryption framework was simulated Verilog/VHDL on the Xilinx ISE and implemented on the Xilinx Virtex 5 XC5VFX200T. The obtained results have shown that the proposed framework has a smaller area and higher speed compared to existing works. The proposed algorithm has reduced the NI implementation area and enhanced the network performance in terms of speed and security.

show abstract

“…Note that this experiment has a much larger data set than that in Fig. 3 (i.e., 1,024 = 2 10 ), because we will to a large extent vary both the number of pivots 𝑝 = 𝑛 𝑥 , 2 ≤ 𝑥 ≤ 5 (𝑥 is considered as a practical upper bound in complexity theory [5]), and the number of nuances 𝑑 = 𝑛 𝑦 , 𝑥 ≤ 𝑦. We set 𝑛 = 32, meaning that there are potential 2 32 distinct values in the underlying data set.…”

Section: Encoding Randomly Generated Numbersmentioning

confidence: 99%

“…The previous sections assume that there is sufficient memory capacity to accommodate 𝑝 pivots and 𝑑 nuances. In certain application scenarios (e.g., edge computing [1], supply chains [30], systemon-chip [10]), we might have limited resources and may not be able to hold, say, 2 32 nuances as in Fig. 2.…”

Section: Computing Nuances On-the-flymentioning

confidence: 99%

INCHE: High-Performance Encoding for Relational Databases through Incrementally Homomorphic Encryption

Zhao

2021

Preprint

View full text Add to dashboard Cite

Homomorphic encryption (HE) offers data confidentiality by executing queries directly on encrypted fields in the database-as-a-service (DaaS) paradigm. While fully HE exhibits great expressiveness but prohibitive performance overhead, a better balance between flexibility and efficiency can be achieved by partially HE schemes. Performance-wise, however, the encryption rate of state-of-theart HE schemes is still orders of magnitude lower than the I/O throughput, rendering the HE scheme the performance bottleneck.This paper proposes INCHE, an incrementally homomorphic encryption scheme, which aims to boost the performance of HE schemes by incrementally encrypting fields in relational databases.The key idea of INCHE is to explore the intrinsic correlation between plaintexts and cache them for future reuse such that expensive HE primitives from plaintexts to ciphertexts are avoided. We prove the semantic security of INCHE under the chosen-plaintext attack (CPA) model and show that its time complexity is linear in the plaintext length. We implement an INCHE prototype by extending the Symmetria cryptosystem and verify its effectiveness on both randomly-generated data and the TPC-H benchmark.

show abstract

Securing Network-on-Chip Using Incremental Cryptography

Cited by 37 publications

References 27 publications

A Survey on the Security of Wired, Wireless, and 3D Network-on-Chips

A Survey on the Security of Wired, Wireless, and 3D Network-on-Chips

Lightweight Cryptography for Network-on-Chip Data Encryption

INCHE: High-Performance Encoding for Relational Databases through Incrementally Homomorphic Encryption

Contact Info

Product

Resources

About