Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 4,905 papers for “Secure coding”

secure coding

Lizandro Pisani · Zenodo (CERN European Organization for Nuclear Research) · 2024

Cited by 0Open access

Secure Physical Layer Network Coding versus Secure Network Coding

Masahito Hayashi · Entropy · 2021

When a network has relay nodes, there is a risk that a part of the information is leaked to an untrusted relay. Secure network coding (secure NC) is known as a method to resolve this problem, which enables the secrecy of the message when the message is transmitted over a noiseless network and a part of the edges or a part of the intermediate (untrusted) nodes are eavesdropped. If the channels on the network are noisy, the error correction is applied to noisy channels before the application of secure NC on an upper layer. In contrast, secure physical layer network coding (secure PLNC) is a method to securely transmit a message by a combination of coding operation on nodes when the network is composed of set of noisy channels. Since secure NC is a protocol on an upper layer, secure PLNC can be considered as a cross-layer protocol. In this paper, we compare secure PLNC with a simple combination of secure NC and error correction over several typical network models studied in secure NC.

Cited by 6Open access

Secure physical layer network coding versus secure network coding

Masahito Hayashi · 2018

Secure network coding realizes the secrecy of the message when the message is transmitted via noiseless network and a part of edges or a part of intermediate nodes are eavesdropped. In this framework, if the channels of the network has noise, we apply the error correction to noisy channel before applying the secure network coding. In contrast, secure physical layer network coding is a method to securely transmit a message by a combination of coding operation on nodes when the network is given as a set of noisy channels. In this paper, we give several examples of network, in which, secure physical layer network coding realizes a performance that cannot be realized by secure network coding.

Cited by 8

Secure network coding

Ning Cai, Raymond W. Yeung · 2003

Recent work on network coding renders a new view on multicasting in a network. In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. The usual function of switching at a node is a special case of network coding. The advantage of network coding is that the full capacity of the network can be utilized. In this paper, we propose a new model which incorporates network coding and information security. Specifically, a collection of subsets of links is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing as a special case. We present a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.

Cited by 452

Secure network coding.

Tang, Zhaohui. · DR-NTU (Nanyang Technological University) · 2013

In this thesis we investigate the secure network coding problem. We are interested in both passive and active attacks in network coding. The first part of this thesis focuses on passive attacks in network coding. A passive attacker can either eavesdrop from a network link between two nodes (“outside”) or by controlling a network node itself (“inside”). We revisit a secret sharing approach to secure network codes against an outside wiretapper. We propose an efficient link protection scheme to prevent an inside wiretapper from obtaining more meaningful (decoded or decodable) information about the original message than what can be disclosed at the node it controls. The second part of this thesis is dedicated to the investigation of active attacks (pollution attacks) in network coding. We present some special authentication codes (A-codes) as information-theoretic authentication schemes to mitigate pollution attacks in network coding. We derive some bounds on parameters associated with these special A-codes, and show some efficient constructions of these A-codes.

Cited by 0

Secure Coding Guidelines

Marius Iulian Mihăilescu, Ștefania Loredana Niță · Apress eBooks · 2023

The vulnerabilities of software applications typically have high costs. In 2022, the global average total data breach cost was $4.35 million [1]. The efforts to eliminate vulnerabilities from the software application should focus on secure coding, avoiding vulnerabilities being deployed in the production phase.

Cited by 1

Secure Multiplex Network Coding

Ryutaroh Matsumoto, Masahito Hayashi · arXiv (Cornell University) · 2011

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding.

Cited by 20Open access

Secure Multiplex Network Coding

Matsumoto, Ryutaroh, Hayashi, Masahito · arXiv (Cornell University) · 2011

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding.

Cited by 0Open access

Firmware Secure Coding Practice

Jiewen Yao, Vincent Zimmer · Apress eBooks · 2020

After we finish the security architecture and design, we need to bring security into the development phase. On the one hand, firmware is still a type of software that is written in a software programming language, such as the C language. Most software secure coding practices are also applicable for firmware development. On the other hand, firmware is a special class of software. Its work is to initialize the silicon to boot the operating system, such as a system firmware, or to provide special runtime services in a hidden execution environment, such as device firmware. Firmware has unique security requirements based upon those usages. Today, there are lots of books introducing software secure coding. Two classic books, Code Complete by Steve McConnell and Writing Solid Code by Steve Maguire, are highly recommended for C programmers. Newer books, such as Writing Secure Code by Michael Howard and David Le Blanc and Building Secure Software by John Viega and Gary McGraw, are excellent resources for the secure programming practices in Windows and Linux. We will not duplicate the details of those parts but instead will give examples on how that guidance impacts the firmware. After that, we will introduce the firmware-specific secure coding practices.

Cited by 0

Secure Fractal Image Coding

Shiguo Lian · ArXiv.org · 2007

In recent work, various fractal image coding methods are reported, which adopt the self-similarity of images to compress the size of images. However, till now, no solutions for the security of fractal encoded images have been provided. In this paper, a secure fractal image coding scheme is proposed and evaluated, which encrypts some of the fractal parameters during fractal encoding, and thus, produces the encrypted and encoded image. The encrypted image can only be recovered by the correct key. To keep secure and efficient, only the suitable parameters are selected and encrypted through in-vestigating the properties of various fractal parameters, including parameter space, parameter distribu-tion and parameter sensitivity. The encryption process does not change the file format, keeps secure in perception, and costs little time or computational resources. These properties make it suitable for secure image encoding or transmission.

Cited by 4Open access

Hardware-Level Secure Coding

Raúl Eduardo Lopresti, Jorge Castiñeira Moreira · IEEE Embedded Systems Letters · 2023

In this letter, a combined encryption and error-control coding scheme based on turbo codes (TCs) is proposed to enhance the security of the transmission. It relies on convolutional encoders that operate over Galois fields <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\textrm {GF}}(4)$ </tex-math></inline-formula> and include variable encryption polynomials, whose coefficients are randomly selected every <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula> steps from a set of optimal polynomials. This type of encoder has been studied in previous papers, where a certain correspondence between the randomness of the encoded sequence and the performance of the TC was conjectured. In this work, a scheme with a varying length <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula> is proposed to increase the output randomness and, therefore, the security of the sequence to be transmitted. That is to say, the number of steps <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula> , over which one of the polynomials is iterated, is a random variable. The randomness of the output and the security of the TC are quantified using differential block entropy, showing that it is possible to improve the security of the transmitted data without compromising the corresponding bit error rate (BER).

Cited by 1

Perfectly Secure Index Coding

Mohammad Mahdi Mojahedian, Mohammad Reza Aref, Amin Gohari · IEEE Transactions on Information Theory · 2017

In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. To do this, the transmitter communicates to the legitimate receivers the public code C, which is also heard by the eavesdropper. We assume perfect secrecy, meaning that the eavesdropper should not be able to retrieve any information about the message set from the public communication. We study the minimum key lengths for zero-error and perfectly secure index coding problem. On one hand, this problem is a generalization of the index coding problem (and thus a difficult one). On the other hand, it is a generalization of the Shannon's cipher system. We show that a generalization of Shannon's one-time pad strategy is optimal up to a multiplicative constant, meaning that it obtains the entire boundary of the cone formed by looking at the secure rate region from the origin. This shows the optimality of the generalized one-time pad for minimizing the consumption of shared secret keys per message bits, when public communication is free (the transmitter is not charged for the rate of the public communication). Finally, we consider relaxation of the perfect secrecy and zero-error constraints to weak secrecy and asymptotically vanishing probability of error, and provide a secure version of the result, obtained by Langberg and Effros, on the equivalence of zero-error and ε-error regions in the conventional index coding problem.

Cited by 22

Secure Multiple Network Coding

松本隆太郎, Ryutaroh Matsumoto, 林まさひと et al. · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 2011

Cited by 0

Secure noisy network coding

Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari · 2013

In this paper we use the Output Statistics of Random Binning (ORSB) framework to extend the noisy network coding of Lim et to. to include an eavesdropper.

Cited by 1

Secure Coding Guidelines and Standards

Kristina Loncar, Jasmin Redžepagić, Vedran Dakić · Annals of DAAAM for ... & proceedings of the ... International DAAAM Symposium · 2024

Cited by 0Open access