Results 261 to 270 of about 1,148,752 (292)
Some of the next articles are maybe not open access.
Secure Polar Coding With REP and XOR Coding
IEEE Communications Letters, 2017In this letter, we study the secure data communication by polar coding. In polar coding, all bit-channels perfectly polarize when the codelength goes to infinity. With finite and practical codelength, however, many bit-channels do not perfectly polarize and this significantly degrades the secrecy rate.
Il-Min Kim 0001 +2 more
openaire +1 more source
A Secure Code Review Retrospective
2020 IEEE Secure Development (SecDev), 2020We discuss in this paper a process used at The MITRE Corporation for reviewing source code to identify security weaknesses. A key tenant of our process is that secure code review should not be done by the developers of the code, but by a separate code review team of seasoned individuals that leverage a combination of analytical methods.
Andrew Buttner +3 more
openaire +1 more source
Variable-security-level secure network coding
2015 IEEE Information Theory Workshop - Fall (ITW), 2015In network coding theory, when wiretapping attacks occur, secure network coding is introduced to prevent information from being leaked to adversaries. In practical network communications, secure constraints vary with time. How to effectively deal with information transmission and information security simultaneously under different security-levels is ...
Xuan Guang, Jiyong Lu, Fang-Wei Fu 0001
openaire +2 more sources
IEEE Embedded Systems Letters
In this letter, a combined encryption and error-control coding scheme based on Turbo Codes (TC) is proposed to enhance the security of the transmission. It relies on Convolutional Encoders that operate over Galois Fields GF(4) and include variable encryption polynomials, whose coefficients are randomly selected every L steps from a set of optimal ...
Raúl Eduardo Lopresti +1 more
openaire +3 more sources
In this letter, a combined encryption and error-control coding scheme based on Turbo Codes (TC) is proposed to enhance the security of the transmission. It relies on Convolutional Encoders that operate over Galois Fields GF(4) and include variable encryption polynomials, whose coefficients are randomly selected every L steps from a set of optimal ...
Raúl Eduardo Lopresti +1 more
openaire +3 more sources
Code security analysis with assertions
Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, 2005Designing and implementing cryptographic protocols is known to be difficult. A lot of research has been devoted to develop formal techniques to analyze abstract designs of cryptographic protocols. Less attention has been paid to the verification of implementation-relevant aspects of cryptographic protocols.
Jan Jürjens, Mark Yampolskiy
openaire +2 more sources
Nested codes for secure transmission
2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008This paper investigates the problem of ensuring secure communication through error-correcting coding methods. A practical structured secure coding design is considered for a general wiretap channel, in which the main channel and the eavesdropper channel are binary-input symmetric-output memoryless (BISOM) channels.
Ruoheng Liu +3 more
openaire +1 more source
2020
In this chapter, we will review the importance of securing the application code. We will learn how to choose the runtime and version for our serverless functions and how to assess any libraries and dependencies they use. We will discuss static code analysis tools, unit tests, and regression tests and how they help secure our application code.
openaire +1 more source
In this chapter, we will review the importance of securing the application code. We will learn how to choose the runtime and version for our serverless functions and how to assess any libraries and dependencies they use. We will discuss static code analysis tools, unit tests, and regression tests and how they help secure our application code.
openaire +1 more source
Cryptanalysis of secure arithmetic coding
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008This work investigates the security issues of the recently proposed secure arithmetic coding (AC), which is an encryption scheme incorporating the interval splitting AC with a series of symbol and codeword permutations. We propose a chosen-ciphertext attack which is capable of recovering the key vectors for codeword permutations with complexity O(N ...
Jiantao Zhou 0001 +3 more
openaire +1 more source
2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC), 2017
This paper proposes code for secure distributed storage systems (sDSS), called secure shortened product-matrix minimum storage regenerating code (PM-ssMSR). The code uses shortening technique applied on the mother code, product-matrix minimum storage regenerating (PM-MSR), for maintenance of the DSS efficiency and two different methods for achieving ...
Natasha Paunkoska +3 more
openaire +2 more sources
This paper proposes code for secure distributed storage systems (sDSS), called secure shortened product-matrix minimum storage regenerating code (PM-ssMSR). The code uses shortening technique applied on the mother code, product-matrix minimum storage regenerating (PM-MSR), for maintenance of the DSS efficiency and two different methods for achieving ...
Natasha Paunkoska +3 more
openaire +2 more sources
2013 Iran Workshop on Communication and Information Theory, 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.
Mohammad Hossein Yassaee +2 more
openaire +2 more sources
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.
Mohammad Hossein Yassaee +2 more
openaire +2 more sources