973,872 research outputs found
The Case for Quantum Key Distribution
Quantum key distribution (QKD) promises secure key agreement by using quantum
mechanical systems. We argue that QKD will be an important part of future
cryptographic infrastructures. It can provide long-term confidentiality for
encrypted information without reliance on computational assumptions. Although
QKD still requires authentication to prevent man-in-the-middle attacks, it can
make use of either information-theoretically secure symmetric key
authentication or computationally secure public key authentication: even when
using public key authentication, we argue that QKD still offers stronger
security than classical key agreement.Comment: 12 pages, 1 figure; to appear in proceedings of QuantumComm 2009
Workshop on Quantum and Classical Information Security; version 2 minor
content revision
Acquiring Secure Systems Through Information Economics
Naval Postgraduate School Acquisition Research Progra
Analyzing the security of an existing computer system
Most work concerning secure computer systems has dealt with the design, verification, and implementation of provably secure computer systems, or has explored ways of making existing computer systems more secure. The problem of locating security holes in existing systems has received considerably less attention; methods generally rely on thought experiments as a critical step in the procedure. The difficulty is that such experiments require that a large amount of information be available in a format that makes correlating the details of various programs straightforward. This paper describes a method of providing such a basis for the thought experiment by writing a special manual for parts of the operating system, system programs, and library subroutines
Secure Layered Transmission in Multicast Systems with Wireless Information and Power Transfer
This paper considers downlink multicast transmit beamforming for secure
layered transmission systems with wireless simultaneous information and power
transfer. We study the power allocation algorithm design for minimizing the
total transmit power in the presence of passive eavesdroppers and energy
harvesting receivers. The algorithm design is formulated as a non-convex
optimization problem. Our problem formulation promotes the dual use of energy
signals in providing secure communication and facilitating efficient energy
transfer. Besides, we take into account a minimum required power for energy
harvesting at the idle receivers and heterogeneous quality of service (QoS)
requirements for the multicast video receivers. In light of the intractability
of the problem, we reformulate the considered problem by replacing a non-convex
probabilistic constraint with a convex deterministic constraint. Then, a
semidefinite programming relaxation (SDR) approach is adopted to obtain an
upper solution for the reformulated problem. Subsequently, sufficient
conditions for the global optimal solution of the reformulated problem are
revealed. Furthermore, we propose two suboptimal power allocation schemes based
on the upper bound solution. Simulation results demonstrate the excellent
performance and significant transmit power savings achieved by the proposed
schemes compared to isotropic energy signal generation.Comment: 7 pages, 3 figures, accepted for presentation at the IEEE
International Conference on Communications (ICC), Sydney, Australia, 201
Quantitative Analysis of Opacity in Cloud Computing Systems
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Federated cloud systems increase the reliability and reduce the cost of the computational support.
The resulting combination of secure private clouds and less secure public clouds, together with the fact that resources need to be located within different clouds, strongly affects the information flow security of the entire system. In this paper, the clouds as well as entities of a federated cloud system are
assigned security levels, and a probabilistic flow sensitive security model for a federated cloud system is proposed. Then the notion of opacity --- a notion capturing the security of information flow ---
of a cloud computing systems is introduced, and different variants of quantitative analysis of opacity are presented. As a result, one can track the information flow in a cloud system, and analyze the impact of different resource allocation strategies by quantifying the corresponding opacity characteristics
Secure Repairable Fountain Codes
In this letter, we provide the construction of repairable fountain codes
(RFCs) for distributed storage systems that are information-theoretically
secure against an eavesdropper that has access to the data stored in a subset
of the storage nodes and the data downloaded to repair an additional subset of
storage nodes. The security is achieved by adding random symbols to the
message, which is then encoded by the concatenation of a Gabidulin code and an
RFC. We compare the achievable code rates of the proposed codes with those of
secure minimum storage regenerating codes and secure locally repairable codes.Comment: To appear in IEEE Communications Letter
Techniques for Enhanced Physical-Layer Security
Information-theoretic security--widely accepted as the strictest notion of
security--relies on channel coding techniques that exploit the inherent
randomness of propagation channels to strengthen the security of communications
systems. Within this paradigm, we explore strategies to improve secure
connectivity in a wireless network. We first consider the intrinsically secure
communications graph (iS-graph), a convenient representation of the links that
can be established with information-theoretic security on a large-scale
network. We then propose and characterize two techniques--sectorized
transmission and eavesdropper neutralization--which are shown to dramatically
enhance the connectivity of the iS-graph.Comment: Pre-print, IEEE Global Telecommunications Conference (GLOBECOM'10),
Miami, FL, Dec. 201
- …