99 research outputs found
Guest Editorial
Network security is a continuing endeavor as exhibited by this special issue on the subject. Although the problem of securing networks emerged almost simultaneously with their development, attaining a fixed set of complete solutions remains evasive. In the history of the development of computers and networking, solutions to challenging problems have become touchstones, and from among them we can draw a parallel to the current state of network development
Guest Editorial
Network security is a continuing endeavor as exhibited by this special issue on the subject. Although the problem of securing networks emerged almost simultaneously with their development, attaining a fixed set of complete solutions remains evasive. In the history of the development of computers and networking, solutions to challenging problems have become touchstones, and from among them we can draw a parallel to the current state of network development
Efficient optical quantum state engineering
We discuss a novel method of efficiently producing multi-photon states using
repeated spontaneous parametric downconversion. Specifically, by attempting
downconversion several times, we can pseudo-deterministically add photons to a
mode, producing various several-photon states. We discuss both expected
performance and experimental limitations.Comment: 4 pages, 4 figure
Dynamic Routing Framework for Wireless Sensor Networks
Numerous routing protocols have been proposed for wireless sensor networks. Each such protocol carries with it a set of assumptions about the trafï¬c type that it caters to, and hence has limited interoperability. Also, most protocols are validated over workloads which only form a fraction of an actual deployment’s requirement. Most real world and commercial deployments, however, would generate multiple trafï¬c types simultaneously throughout the lifetime of the network. For example, most deployments would want all of the following to happen concurrently from the network: periodic reliable sense and disseminate, real time streams, patched updates, network reprogramming, query-response dialogs, mission critical alerts and so on. Naturally, no one routing protocol can completely cater to all of a deployments requirements. This chapter presents a routing framework that captures the communication intent of an application by using just three bits. The traditional routing layer is replaced with a collection of routing components that can cater to various communication patterns. The framework dynamically switches routing component for every packet in question. Data structure requirements of component protocols are regularized, and core protocol features are distilled to build a highly composable collection of routing modules. This creates a framework for developing, testing, integrating, and validating protocols that are highly portable from one deployment to another. Communication patterns can be easily described to lower layer protocols using this framework. One such real world application scenario is also investigated: that of predictive maintenance (PdM). The requirements of a large scale PdM are used to generate a fairly complete and realistic trafï¬c workload to drive an evaluation of such a framework
Power-recycled weak-value-based metrology
We improve the precision of the interferometric weak-value-based beam
deflection measurement by introducing a power recycling mirror, creating a
resonant cavity. This results in \emph{all} the light exiting to the detector
with a large deflection, thus eliminating the inefficiency of the rare
postselection. The signal-to-noise ratio of the deflection is itself magnified
by the weak value. We discuss ways to realize this proposal, using a transverse
beam filter and different cavity designs.Comment: 5 pages, 1 figur
Effects of Technology Mapping on Fault Detection Coverage in Reprogrammable FPGAs
Although Field-Programmable Gate Arrays (FPGAs) are tested by their manufacturers prior to shipment, they are still susceptible to failures in the field. In this paper, test vectors generated for the emulated (i.e., mission) circuit are fault simulated on two different models: the original view of the circuit, and the design as it is mapped to the FPGA\u27s logic cells. Faults in the cells and in the programming logic are considered. Experiments show that this commonly-used approach fails to detect most of the faults in the FPGA
Security of high-dimensional quantum key distribution protocols using Franson interferometers
Franson interferometers are increasingly being proposed as a means of
securing high-dimensional energy-time entanglement-based quantum key
distribution (QKD) systems. Heuristic arguments have been proposed that purport
to demonstrate the security of these schemes. We show, however, that such
systems are vulnerable to attacks that localize the photons to several
temporally separate locations. This demonstrates that a single pair of Franson
interferometers is not a practical approach to securing high-dimensional
energy-time entanglement based QKD. This observations leads us to investigate
the security of modified Franson-based-protocols, where Alice and Bob have two
or more Franson interferometers. We show that such setups can improve the
sensitivity against attacks that localize the photons to multiple temporal
locations. While our results do not constituting a full security proof, they do
show that a single pair of Franson interferometers is not secure and that
multiple such interferometers could be a promising candidate for experimentally
realizable high-dimensional QKD.Comment: 14 pages (single column format
- …