Coding Theory and Security, 2014, Part 1

	Coding Theory and Security, 2014 Part 1

Coding theory is one of the essential pieces of information theory. More important, coding theory is a core element in cryptography. The research work cited here looks at signal processing, crowdsourcing, matroid theory, WOM codes, and the N-P hard problem. These works were presented or published in 2014. 

Matsumoto, R., "Coding Theoretic Study of Secure Network Coding and Quantum Secret Sharing," Information Theory and its Applications (ISITA), 2014 International Symposium on, vol., no., pp. 335, 337, 26-29 Oct. 2014. doi: (not provided)
Abstract: The common goal of (classical) secure network coding and quantum secret sharing is to encode secret so that an adversary has as little information of the secret as possible. Both can be described by a nested pair of classical linear codes, while the strategies available to the adversary are different. The security properties of both schemes are closely related to combinatorial properties of the underlying linear codes. We survey connections among them.
Keywords: linear codes; network coding; quantum cryptography; telecommunication security; coding theoretic study; combinatorial properties; linear codes; quantum secret sharing; secure network coding; security properties; Australia; Cryptography; Hamming weight; Linear codes; Network coding; Quantum mechanics (ID#: 15-4842)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6979860&isnumber=6979787 

Hibshi, H.; Breaux, T.; Riaz, M.; Williams, L., "Towards a Framework to Measure Security Expertise in Requirements Analysis," Evolving Security and Privacy Requirements Engineering (ESPRE), 2014 IEEE 1st Workshop on, vol., no., pp. 13, 18, 25-25 Aug. 2014. doi:10.1109/ESPRE.2014.6890522
Abstract: Research shows that commonly accepted security requirements are not generally applied in practice. Instead of relying on requirements checklists, security experts rely on their expertise and background knowledge to identify security vulnerabilities. To understand the gap between available checklists and practice, we conducted a series of interviews to encode the decision-making process of security experts and novices during security requirements analysis. Participants were asked to analyze two types of artifacts: source code, and network diagrams for vulnerabilities and to apply a requirements checklist to mitigate some of those vulnerabilities. We framed our study using Situation Awareness-a cognitive theory from psychology-to elicit responses that we later analyzed using coding theory and grounded analysis. We report our preliminary results of analyzing two interviews that reveal possible decision-making patterns that could characterize how analysts perceive, comprehend and project future threats which leads them to decide upon requirements and their specifications, in addition, to how experts use assumptions to overcome ambiguity in specifications. Our goal is to build a model that researchers can use to evaluate their security requirements methods against how experts transition through different situation awareness levels in their decision-making process.
Keywords: decision making; formal specification; security of data; source code (software); coding theory; cognitive theory; decision-making patterns; decision-making process; grounded analysis; network diagrams; requirements checklist; security expertise; security experts; security requirements analysis; security vulnerabilities; situation awareness; source code; specifications ambiguity; Decision making; Encoding; Firewalls (computing); Interviews; Software; Uncertainty; Security; decision-making; patterns; requirements analysis; situation awareness (ID#: 15-4843)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6890522&isnumber=6890516 

Shuiyin Liu; Yi Hong; Viterbo, E., "On Measures of Information Theoretic Security," Information Theory Workshop (ITW), 2014 IEEE, vol., no., pp. 309, 310, 2-5 Nov. 2014. doi:10.1109/ITW.2014.6970843
Abstract: While information-theoretic security is stronger than computational security, it has long been considered impractical. In this work, we provide new insights into the design of practical information-theoretic cryptosystems. Firstly, from a theoretical point of view, we give a brief introduction into the existing information theoretic security criteria, such as the notions of Shannon's perfect/ideal secrecy in cryptography, and the concept of strong secrecy in coding theory. Secondly, from a practical point of view, we propose the concept of ideal secrecy outage and define a outage probability. Finally, we show how such probability can be made arbitrarily small in a practical cryptosystem.
Keywords: cryptography; information theory; Shannon perfect secrecy; computational security; ideal secrecy; information theoretic cryptosystem; information theoretic security; Australia; Cryptography; Entropy; Information theory; Probability; Vectors
(ID#: 15-4844)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6970843&isnumber=6970773 

Tao Fang; Min Li, "Controlled Quantum Secure Direct Communication Protocol Based on Extended Three-Particle GHZ State Decoy," Network-Based Information Systems (NBiS), 2014 17th International Conference on vol., no., pp. 450, 454, 10-12 Sept. 2014. doi:10.1109/NBiS.2014.44
Abstract: Extended three-particle GHZ state decoy is introduced in controlled quantum secure direct communication to improve eavesdropping detection probability and prevent correlation-elicitation (CE) attack. Each particle of extended three-particle GHZ state decoy is inserted into sending particles to detect eavesdroppers, which reaches 63% eavesdropping detection probability. And decoy particles prevent the receiver from obtaining the correct correlation between particle 1 and particle 2 before the sender coding on them, so that he can not get any secret information without the controller's permission. In the security analysis, the maximum amount of information that a qubit contains is obtained by introducing the entropy theory method, and two decoy strategies are compared quantitatively. If the eavesdroppers intend to eavesdrop on secret information, the per qubit detection rate of using only two particles of extended three-particle GHZ state as decoy is 58%, while the presented protocol using three particles of extended three-particle GHZ state as decoy reaches per qubit 63%.
Keywords: entropy; probability; protocols; quantum communication; telecommunication security; controlled quantum secure direct communication protocol; correlation-elicitation attack; eavesdropping detection probability; entropy theory method; extended three-particle state decoy; per qubit detection rate; security analysis; Barium; Cryptography; Encoding; Protocols; Quantum mechanics; Receivers; CQSDC; decoy; eavesdropping detection; extend three-particle GHZ state; security (ID#: 15-4845)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7023992&isnumber=7023898

Jiantao Zhou; Xianming Liu; Au, O.C.; Yuan Yan Tang, "Designing an Efficient Image Encryption-Then-Compression System via Prediction Error Clustering and Random Permutation," Information Forensics and Security, IEEE Transactions on, vol. 9, no. 1, pp. 39, 50, Jan. 2014. doi:10.1109/TIFS.2013.2291625
Abstract: In many practical scenarios, image encryption has to be conducted prior to image compression. This has led to the problem of how to design a pair of image encryption and compression algorithms such that compressing the encrypted images can still be efficiently performed. In this paper, we design a highly efficient image encryption-then-compression (ETC) system, where both lossless and lossy compression are considered. The proposed image encryption scheme operated in the prediction error domain is shown to be able to provide a reasonably high level of security. We also demonstrate that an arithmetic coding-based approach can be exploited to efficiently compress the encrypted images. More notably, the proposed compression approach applied to encrypted images is only slightly worse, in terms of compression efficiency, than the state-of-the-art lossless/lossy image coders, which take original, unencrypted images as inputs. In contrast, most of the existing ETC solutions induce significant penalty on the compression efficiency.
Keywords: arithmetic codes; data compression; image coding; pattern clustering; prediction theory; random codes; ETC; arithmetic coding-based approach; image encryption-then-compression system design; lossless compression; lossless image coder; lossy compression; lossy image coder; prediction error clustering; random permutation; security; Bit rate; Decoding; Encryption; Image coding; Image reconstruction; Compression of encrypted image; encrypted domain signal processing (ID#: 15-4846)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6670767&isnumber=6684617 

Jianghua Zhong; Dongdai Lin, "Stability of Nonlinear Feedback Shift Registers," Information and Automation (ICIA), 2014 IEEE International Conference on, vol., no., pp. 671, 676, 28-30 July 2014. doi:10.1109/ICInfA.2014.6932738
Abstract: Convolutional code are widely used in many applications such as digital video, radio, and mobile communication. Nonlinear feedback shift registers (NFSRs) are the main building blocks in many convolutional decoders. A decoding error may result in a successive of further decoding errors. However, a stable NFSR can limit such an error-propagation. This paper studies the stability of NFSRs using a Boolean network approach. A Boolean network is an autonomous system that evolves as an automaton through Boolean functions. An NFSR can be viewed as a Boolean network. Based on its Boolean network representation, some sufficient and necessary conditions are provided for globally (locally) stable NFSRs. To determine the global stability of an NFSR, the Boolean network approach requires lower time complexity than the exhaustive search and the Lyapunov's direct method.
Keywords: Boolean functions; automata theory; computational complexity;  shift registers; Boolean functions; Boolean network representation; Lyapunov direct method; NFSR; automaton; convolutional code; convolutional decoders; decoding error; digital video; error-propagation; exhaustive search; global stability; mobile communication; nonlinear feedback shift register stability; radio; time complexity; Boolean functions; Linear systems; Shift registers; Stability criteria; Time complexity; Transient analysis; Boolean function; Boolean network; Nonlinear feedback shift register; stability (ID#: 15-4847)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6932738&isnumber=6932615

Alodeh, M.; Chatzinotas, S.; Ottersten, B., "A Multicast Approach for Constructive Interference Precoding in MISO Downlink Channel," Information Theory (ISIT), 2014 IEEE International Symposium on, vol., no., pp. 2534, 2538, June 29, 2014-July 4, 2014. doi:10.1109/ISIT.2014.6875291
Abstract: This paper studies the concept of jointly utilizing the data information (DI) and channel state information (CSI) in order to design symbol-level precoders for a multiple input and single output (MISO) downlink channel. In this direction, the interference among the simultaneous data streams is transformed to useful signal that can improve the signal to interference noise ratio (SINR) of the downlink transmissions. We propose a maximum ratio transmissions (MRT) based algorithm that jointly exploits DI and CSI to gain the benefits from these useful signals. In this context, a novel framework to minimize the power consumption is proposed by formalizing the duality between the constructive interference downlink channel and the multicast channels. The numerical results have shown that the proposed schemes outperform other state of the art techniques.
Keywords: channel coding; cochannel interference; multicast communication; precoding; telecommunication channels; MISO downlink channel; SINR; channel state information; constructive interference downlink channel; constructive interference precoding; data information; downlink transmissions; maximum ratio transmissions; multicast approach; multicast channels; multiple input and single output downlink channel; power consumption; signal to interference noise ratio; simultaneous data streams; symbol-level precoders; Correlation; Downlink; Information theory; Interference; Minimization; Signal to noise ratio; Vectors (ID#: 15-4848)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6875291&isnumber=6874773

Aydin, A.; Alkhalaf, M.; Bultan, T., "Automated Test Generation from Vulnerability Signatures," Software Testing, Verification and Validation (ICST), 2014 IEEE Seventh International Conference on, vol., no., pp. 193, 202, March 31 2014-April 4 2014. doi:10.1109/ICST.2014.32
Abstract: Web applications need to validate and sanitize user inputs in order to avoid attacks such as Cross Site Scripting (XSS) and SQL Injection. Writing string manipulation code for input validation and sanitization is an error-prone process leading to many vulnerabilities in real-world web applications. Automata-based static string analysis techniques can be used to automatically compute vulnerability signatures (represented as automata) that characterize all the inputs that can exploit a vulnerability. However, there are several factors that limit the applicability of static string analysis techniques in general: 1) undesirability of static string analysis requires the use of approximations leading to false positives, 2) static string analysis tools do not handle all string operations, 3) dynamic nature of the scripting languages makes static analysis difficult. In this paper, we show that vulnerability signatures computed for deliberately insecure web applications (developed for demonstrating different types of vulnerabilities) can be used to generate test cases for other applications. Given a vulnerability signature represented as an automaton, we present algorithms for test case generation based on state, transition, and path coverage. These automatically generated test cases can be used to test applications that are not analyzable statically, and to discover attack strings that demonstrate how the vulnerabilities can be exploited.
Keywords: Web services; authoring languages; automata theory; digital signatures; program diagnostics; program testing; attack string discovery; automata-based static string analysis techniques; automated test case generation; automatic vulnerability signature computation; insecure Web applications; path coverage; scripting languages; state; static string analysis undecidability; transition; Algorithm design and analysis; Approximation methods; Automata; Databases; HTML; Security; Testing; automata-based test generation; string analysis; validation and sanitization; vulnerability signatures (ID#: 15-4849)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6823881&isnumber=6823846

Koyluoglu, O.O.; Rawat, A.S.; Vishwanath, S., "Secure Cooperative Regenerating Codes for Distributed Storage Systems," Information Theory, IEEE Transactions on, vol. 60, no. 9, pp. 5228, 5244, Sept. 2014. doi:10.1109/TIT.2014.2319271
Abstract: Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple simultaneous node failures. Cooperative regenerating codes allow bandwidth efficient repair of multiple simultaneous node failures. This paper analyzes storage systems that employ cooperative regenerating codes that are robust to (passive) eavesdroppers. The analysis is divided into two parts, studying both minimum bandwidth and minimum storage cooperative regenerating scenarios. First, the secrecy capacity for minimum bandwidth cooperative regenerating codes is characterized. Second, for minimum storage cooperative regenerating codes, a secure file size upper bound and achievability results are provided. These results establish the secrecy capacity for the minimum storage scenario for certain special cases. In all scenarios, the achievability results correspond to exact repair, and secure file size upper bounds are obtained using min-cut analyses over a suitable secrecy graph representation of DSS. The main achievability argument is based on an appropriate precoding of the data to eliminate the information leakage to the eavesdropper.
Keywords: precoding; security of data; storage management; DSS; DSS secrecy graph representation; data precoding; distributed storage system; eavesdropper; min-cut analysis; minimum bandwidth cooperative regenerating code; minimum storage cooperative regenerating code; Bandwidth; Decision support systems; Encoding; Maintenance engineering; Resilience; Security; Upper bound; Coding for distributed storage systems; cooperative repair; minimum bandwidth cooperative regenerating (MBCR) codes; minimum storage cooperative regenerating (MSCR) codes; security (ID#: 15-4850)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6807720&isnumber=6878505

Geil, O.; Martin, S.; Matsumoto, R.; Ruano, D.; Yuan Luo, "Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes," Information Theory Workshop (ITW), 2014 IEEE, vol., no., pp. 137, 141, 2-5 Nov. 2014. doi:10.1109/ITW.2014.6970808
Abstract: Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes [23], [22]. In this paper we elaborate on the implication of these parameters and we devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes our bound is often tight. Furthermore, for these codes the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights.
Keywords: Hamming codes; algebraic geometric codes; security of data; Hermitian codes; general one-point algebraic geometric codes; linear ramp secret sharing schemes security; relative generalized Hamming weights; Cryptography; Galois fields; Geometry; Hamming weight; Linear codes; Vectors (ID#: 15-4851)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6970808&isnumber=6970773

Poonia, A.S.; Singh, S., "Malware Detection by Token Counting," Contemporary Computing and Informatics (IC3I), 2014 International Conference on, vol., no., pp. 1285, 1288, 27-29 Nov. 2014. doi:10.1109/IC3I.2014.7019691
Abstract: Malicious software (or malware) is defined as software that fulfills the harmful intent of an attacker and it is one of the most pressing and major security threats facing the Internet today. Antivirus companies typically have to deal with thousands of new malware every day. If antivirus software has large database then there is more chance of false positive and false negative, so to store the huge database in the virus definition, is very complex task. In this research paper the new concept is that, in spite of storing complete signatures of the virus, we can store the various tokens and their frequency in the program. In this process we will use only tokens of executable statements, so there is no problem if dead code in malware is also present. In the tokens we use two definitions one is operator and another is operand. So we can form new type of signature of a malware that take less size in the database and also give less negative false and positive false. The benefits of using the token concept includes; fewer databases storage memory is required; estimate size of the malicious software can be calculated; easy estimation of the complexity of the malicious program; If the malicious program has dead code or repetition of statements then also we can find accurate signature of the program by using executable statements only. So, by this process we can detect malicious code easily with less database storage memory with more precise way.
Keywords: Internet; database management systems; invasive software; Internet; antivirus software; database storage memory; dead code; executable statements; malicious program; malicious software; malware detection; malware signature; security threats; token concept; token counting; virus definition; Complexity theory; Computers; Databases; Estimation; Malware; Software; Operand; Operator; Tokens; frequency; malicious code complexity (ID#: 15-4852)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7019691&isnumber=7019573

Zonouz, S.; Rrushi, J.; McLaughlin, S., "Detecting Industrial Control Malware Using Automated PLC Code Analytics," Security & Privacy, IEEE, vol. 12, no. 6, pp. 40, 47, Nov.-Dec. 2014. doi:10.1109/MSP.2014.113
Abstract: The authors discuss their research on programmable logic controller (PLC) code analytics, which leverages safety engineering to detect and characterize PLC infections that target physical destruction of power plants. Their approach also draws on control theory, namely the field of engineering and mathematics that deals with the behavior of dynamical systems, to reverse-engineer safety-critical code to identify complex and highly dynamic safety properties for use in the hybrid code analytics approach.
Keywords: control engineering computing; industrial control; invasive software; production engineering computing; program diagnostics; programmable controllers; safety-critical software; automated PLC code analytics; control theory; hybrid code analytics approach; industrial control malware detection; programmable logic controllers; reverse-engineer safety-critical code; safety engineering; Computer security; Control systems; Energy management; Industrial control; Malware; Model checking; Process control; Reverse engineering; Safety; Safety devices; PLC code analytics; formal models; industrial control malware; model checking; process control systems; reverse engineering; safety-critical code; security (ID#: 15-4853)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7006408&isnumber=7006395

Koga, H.; Honjo, S., "A Secret Sharing Scheme Based on a Systematic Reed-Solomon Code and Analysis of Its Security for a General Class of Sources," Information Theory (ISIT), 2014 IEEE International Symposium on, vol., no., pp. 1351, 1355, June 29 2014 - July 4 2014. doi:10.1109/ISIT.2014.6875053
Abstract: In this paper we investigate a secret sharing scheme based on a shortened systematic Reed-Solomon code. In the scheme L secrets S1, S2, ..., SL and n shares X1, X2, ..., Xn satisfy certain n - k + L linear equations. Security of such a ramp secret sharing scheme is analyzed in detail. We prove that this scheme realizes a (k; n)-threshold scheme for the case of L = 1 and a ramp (k, L, n)-threshold scheme for the case of 2 ≤ L ≤ k - 1 under a certain assumption on S1, S2, ..., SL.
Keywords: Reed-Solomon codes; telecommunication security; linear equations; ramp secret sharing scheme; shortened systematic Reed-Solomon code; Cryptography; Equations; Probability distribution; Random variables; Reed-Solomon codes
(ID#: 15-4854)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6875053&isnumber=6874773 

Mokhtar, M.A.; Gobran, S.N.; El-Badawy, E.-S.A.-M., "Colored Image Encryption Algorithm Using DNA Code and Chaos Theory," Computer and Communication Engineering (ICCCE), 2014 International Conference on, vol. no., pp. 12, 15, 23-25 Sept. 2014. doi:10.1109/ICCCE.2014.17
Abstract: DNA computing and Chaos theory introduce promising research areas at the field of Cryptography. In this paper, a stream cipher algorithm for Image Encryption is introduced. The chaotic logistic map is used for confusing and diffusing the Image pixels, and then a DNA sequence used as a one-time-pad (OTP) to change pixel values. The introduced algorithm shows also perfect security as a result of using OTP and good ability to resist statistical and differential attacks.
Keywords: biocomputing; cryptography; image colour analysis; DNA code; DNA computing; DNA sequence; OTP; chaos theory; chaotic logistic map; colored image encryption algorithm; cryptography; differential attacks; image pixels; one-time-pad; stream cipher algorithm; Abstracts; Ciphers; Computers; DNA; Encryption; Logistics; PSNR; Chaos theory; DNA cryptography; Image Encryption; Logistic map; one time pad OTP; stream Cipher; symmetrical encryption (ID#: 15-4855)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7031588&isnumber=7031550

Liuyihan Song; Lei Xie; Huifang Chen; Kuang Wang, "A Feedback-Based Secrecy Coding Scheme Using Polar Code over Wiretap Channels," Wireless Communications and Signal Processing (WCSP), 2014 Sixth International Conference on, vol, no., pp. 1, 6, 23-25 Oct. 2014. doi:10.1109/WCSP.2014.6992177
Abstract: Polar codes can be used to achieve secrecy capacity of degraded wiretap channels. In this paper, we propose a feedback-based secrecy coding scheme using polar code over non-degraded wiretap channels. With the feedback architecture, the proposed secrecy coding scheme can significantly obtain a positive secrecy rate. Moreover, polar codes have low complexity of encoding and decoding, which is good for implementing. Simulation results show that the proposed feedback-based secrecy coding scheme using polar code can transmit confidential messages reliably and securely. Moreover, the impact of the conditions of the forward channels and feedback channels on the performance of the proposed secrecy coding scheme are analyzed.
Keywords: channel capacity; channel coding; decoding; feedback; telecommunication network reliability; telecommunication security; decoding; degraded wiretap channel; encoding; feedback architecture; feedback channel; feedback-based secrecy coding scheme; forward channel; nondegraded wiretap channel; polar code; reliability; secure communication; Channel coding; Decoding; Member and Geographic Activities Board committees; Reliability theory; Security; Polar code; feedback; non-degraded wiretap channels; secrecy code (ID#: 15-4856)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6992177&isnumber=6992003

Bin Dai; Zheng Ma, "Feedback Enhances the Security of Degraded Broadcast Channels with Confidential Messages and Causal Channel State Information," Information Theory Workshop (ITW), 2014 IEEE, vol., no., pp. 411, 415, 2-5 Nov. 2014. doi:10.1109/ITW.2014.6970864
Abstract: In this paper, we investigate the degraded broadcast channels with confidential messages (DBC-CM), causal channel state information (CSI), and with or without noiseless feedback. The inner and outer bounds on the capacity-equivocation region are given for the non-feedback mode, and the capacity-equivocation region is determined for the feedback model. We find that by using this noiseless feedback, the achievable rate-equivocation region (inner bound on the capacity-equivocation region) of the DBC-CM with causal CSI is enhanced.
Keywords: broadcast channels; channel capacity; channel coding; feedback telecommunication security; DBC-CM; capacity-equivocation region; channel state information; confidential messages; degraded broadcast channels; noiseless feedback; rate-equivocation region; Decoding; Joints; Random variables; Receivers; Silicon; Transmitters; Zinc; Broadcast channel; channel state information; confidential message; feedback (ID#: 15-4857)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6970864&isnumber=6970773

Abuzainab, N.; Ephremides, A., "Secure Distributed Information Exchange," Information Theory, IEEE Transactions on, vol. 60, no. 2, pp. 1126, 1135, Feb. 2014. doi:10.1109/TIT.2013.2290992
Abstract: We consider the problem of streaming a file by exchanging information over wireless channels in the presence of an eavesdropper. We utilize private and public channels and wish to minimize the use of the (more expensive) private channel subject to a required level of security. We consider both single and multiple users and compare simple ARQ and deterministic network coding as methods of transmission.
Keywords: automatic repeat request; network coding; wireless channels; deterministic network coding; exchanging information; private channels; public channels; secure distributed information exchange; simple ARQ; wireless channels; Automatic repeat request; Delays; Equations; Fading; Network coding; Security; Vectors; Privacy; QoS; energy efficiency; network coding
(ID#: 15-4858)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6665039&isnumber=6714461

Porzio, A., "Quantum Cryptography: Approaching Communication Security from a Quantum Perspective," Photonics Technologies, 2014 Fotonica AEIT Italian Conference on, vol., no., pp. 1, 4, 12-14 May 2014. doi:10.1109/Fotonica.2014.6843831
Abstract: Quantum cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel a sophisticate algorithm protect our privacy making our data unintelligible to unauthorized receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceed available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realize provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations. In this contribution, after a brief historical introduction, we aim at giving a survey on the physical principles underlying the quantum approach to cryptography. Then, we analyze a possible continuous variable protocol.
Keywords: cryptographic protocols; data privacy; quantum cryptography; quantum theory; telecommunication security; code key; computational power; continuous variable protocol; privacy protection; quantum cryptography; quantum cryptology; quantum mechanics; quantum technology; superposition principle; uncertainty relations; unconditional private communication security; Cryptography; History; Switches; TV; Continuous Variable; Quantum cryptography (ID#: 15-4859)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6843831&isnumber=6843815

Liang Chen, "Secure Network Coding for Wireless Routing," Communications (ICC), 2014 IEEE International Conference on, vol., no., pp. 1941,1946, 10-14 June 2014. doi:10.1109/ICC.2014.6883607
Abstract: Nowadays networking is secure because we encrypt the confidential messages with the underlying assumption that adversaries in the network are computationally bounded. For traditional routing or network coding, routers know the contents of the packets they receive. Networking is not secure any more if there are eavesdroppers with infinite computational power at routers. Our concern is whether we can achieve stronger security at routers. This paper proposes secure network coding for wireless routing. Combining channel coding and network coding, this scheme can not only provide physical layer security at wireless routers but also forward data error-free at a high rate. In the paper we prove this scheme can be applied to general networks for secure wireless routing.
Keywords: channel coding; telecommunication network routing; channel coding; forward data error-free; physical layer security; secure network coding; secure wireless routing; Communication system security; Network coding; Protocols; Relays; Routing; Security; Throughput; information-theoretic secrecy; network coding; network information theory; physical-layer security; wireless routing (ID#: 15-4860)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6883607&isnumber=6883277

Thangaraj, A., "Coding for Wiretap Channels: Channel Resolvability and Semantic Security," Information Theory Workshop (ITW), 2014 IEEE, vol., no., pp. 232, 236, 2-5 Nov. 2014. doi:10.1109/ITW.2014.6970827
Abstract: Wiretap channels form the most basic building block of physical-layer and information-theoretic security. Considerable research work has gone into the information-theoretic, cryptographic and coding aspects of wiretap channels in the last few years. The main goal of this tutorial article is to provide a self-contained presentation of two recent results - one is a new and simplified proof for secrecy capacity using channel resolvability, and the other is the connection between semantic security and information-theoretic strong secrecy.
Keywords: channel coding; cryptography; information theory; telecommunication security; channel resolvability; coding aspects; cryptography; information-theoretic security; physical-layer; secrecy capacity; semantic security; wiretap channels coding; Cryptography; Encoding; Semantics; Standards; Zinc (ID#: 15-4861)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6970827&isnumber=6970773
 

Note:

Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to news@scienceofsecurity.net for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.