P-SIGMA : security aware paging in end-to-end mobility management scheme

Mobile users need to maintain end-to-end connections when changing subnets. Handoff across networks often causes delay and loss of packets and make end users vulnerable to security threats that may lead to disruptions. In this paper, we design P-SIGMA , a delay and security-hardened, disruption-tolerant and signalling cost-effective end-to-end mobility management scheme by incorporating paging in SIGMA , an internet protocol diversity-based end-to-end transport layer mobility management scheme. P-SIGMA can detect and mitigate disruptions against two most common security threats: session hijacking and freeloading. We also propose a signalling cost analysis model for paging and a recovery-time model for attacks. To demonstrate performance improvement, we compare P-SIGMA with SIGMA and show the speed at which P-SIGMA can detect attacks (security breaches). We observe that P-SIGMA has lower signalling than SIGMA while maintaining all the benefits of a transport layer mobility management scheme. P-SIGMA can also detect paging related security threats with a small detection time without incurring any additional signalling.     

On-line Ciphers and the Hash-CBC Constructions

We initiate a study of on-line ciphers. These are ciphers that can take input plaintexts of large and varying lengths and will output the i th block of the ciphertext after having processed only the first i blocks of the plaintext. Such ciphers permit length-preserving encryption of a data stream with only a single pass through the data. We provide security definitions for this primitive and study its basic properties. We then provide attacks on some possible candidates, including CBC with fixed IV. We then provide two constructions, HCBC1 and HCBC2, based on a given block cipher E and a family of computationally AXU functions. HCBC1 is proven secure against chosen-plaintext attacks assuming that E is a PRP secure against chosen-plaintext attacks, while HCBC2 is proven secure against chosen-ciphertext attacks assuming that E is a PRP secure against chosen-ciphertext attacks.     

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge

In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all $\mathcal {NP}$ . The existence of constant-round zero-knowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and the existence of constant-round zero-knowledge arguments of knowledge was proven by Feige and Shamir (CRYPTO, 1989). However, the existence of constant-round zero-knowledge proofs of knowledge for all $\mathcal {NP}$ is folklore, to the best of our knowledge, since no proof of this fact has been published.     

Key-Dependent Message Security: Generic Amplification and Completeness

Key-dependent message (KDM) secure encryption schemes provide secrecy even when the attacker sees encryptions of messages related to the secret-key sk. Namely, the scheme should remain secure even when messages of the form f(sk) are encrypted, where f is taken from some function class $\mathcal{F}$ . A KDM amplification procedure takes an encryption scheme which satisfies $\mathcal{F}$ -KDM security, and boosts it into a $\mathcal{G}$ -KDM secure scheme, where the function class $\mathcal{G}$ should be richer than $\mathcal{F}$ . It was recently shown by Brakerski et al. (TCC 2011) and Barak et al. (EUROCRYPT 2010) that a strong form of amplification is possible, provided that the underlying encryption scheme satisfies some special additional properties. In this work, we prove the first generic KDM amplification theorem which relies solely on the KDM security of the underlying scheme without making any other assumptions. Specifically, we show that an elementary form of KDM security against functions in which each output bit either copies or flips a single bit of the key (a.k.a. projections) can be amplified into KDM security with respect to any function family that can be computed in arbitrary fixed polynomial-time. Furthermore, our amplification theorem and its proof are insensitive to the exact setting of KDM security, and they hold in the presence of multiple-keys and in the symmetric-key/public-key and the CPA/CCA cases. As a result, we can amplify the security of most known KDM constructions, including ones that could not be amplified before. Finally, we study the minimal conditions under which full-KDM security (with respect to all functions) can be achieved. We show that under strong notion of KDM security, the existence of fully homomorphic encryption which allows to encrypt the secret-key (i.e., “cyclic-secure”) is not only sufficient for full-KDM security, as shown by Barak et al., but also necessary. On the other hand, we observe that for standard KDM security, this condition can be relaxed by adopting Gentry’s bootstrapping technique (STOC 2009) to the KDM setting.     

Improving parallel EKF-based nonlinear channel equalization using unscented transformation

The paper presents a new review of parallel Kalman filtering for nonlinear channel equalization. A Network of Extended Kalman Filters (nekf) has already been suggested for this purpose. This equalizer gives recursively a minimum mean squared error (mmse) estimation of a sequence of transmitted symbols according to a state formulation of a digital communication scheme. It is essentially based on two mechanisms: the approximation of the non Gaussiana posteriori probability density function (pdf) of the symbol sequence by a Weighted Gaussian Sum (wgs); and the local linearization of the nonlinear channel function for each branch of the network. Since the linearization, bearing on scattered symbol states, is one of the major limitations of thenekf, a new Kalman filtering approach, the Unscented Kalman Filter (ukf) suggested by Julier and Uhlman is considered in this paper for an interesting adaptation to the equalization context. Theukf algorithm is based on the equations of a Kalman filter, as the optimal linear minimum variance estimator, and on determining conditional expectations based on a kind of deterministic Monte-Carlo simulations. The new equalizer referred to as the Network ofukf (nukf), thus combines density approximation by awgs and the Unscented Transformation (ut) principle to circumvent the linearization brought within eachekf and is shown to perform better than thenekf based equalizer for severe nonlinear channels. Also, an adaptive version of thenukf is developed using the k-means clustering algorithm for noise-free channel output identification, since thenukf-based algorithm does not require the knowledge of the channel nonlinearity model.     

The OMLP family of optimal multiprocessor real-time locking protocols

This paper presents the first suspension-based multiprocessor real-time locking protocols with asymptotically optimal blocking bounds (under certain analysis assumptions). These protocols can be applied under any global, clustered, or partitioned job-level fixed-priority scheduler and support mutual exclusion, reader-writer exclusion, and k-exclusion constraints. Notably, the reader-writer and k-exclusion protocols are the first analytically-sound suspension-based multiprocessor real-time locking protocols of their kind. To formalize a notion of “optimal blocking,” precise definitions of what constitutes “blocking” in a multiprocessor real-time system are given and a simple complexity metric for real-time locking protocols, called maximum priority-inversion blocking (pi-blocking), is introduced. It is shown that, in a system with m processors, Ω(m) maximum pi-blocking is unavoidable. This bound is shown to be asymptotically tight with the introduction of the O(m) multiprocessor locking protocol (OMLP) family presented herein, which includes protocols that ensure an upper bound on maximum pi-blocking that is approximately within a factor of two of the lower bound. In addition to the coarse-grained asymptotic bounds, detailed blocking bounds suitable for schedulability analysis are derived using holistic blocking analysis. Based on the detailed bounds, the proposed locking protocols are compared with each other and with previously-proposed protocols in an empirical schedulability study involving more than one billion task sets. In this study, the OMLP was found to perform better than two variants of the classic (but non-optimal) multiprocessor priority-ceiling protocol (MPCP).     

Modulation par codage spectral

Using the time-frequency duality principle, the author gives a relation between the so-called Pulse Code Modulation system (Pcm)and a system in which the spectral lines are coded in a similar way (Fcm or Frequency Code Modulation system). The latter appears to be quite comparable to a four phase digital modem, the carrier frequencies of which are multiples of a common basic frequency. It is showed that a Fcm frequency coded multiplexing device may be built, which is quite comparable to a Pcm equipment, as far as the bandwith requirement is concerned. The Fcm terminal equipment is much more expensive and sophisticated than the Pcm one, but the Fcm line amplifiers are simpler than the Pcm regenerative repeaters. The development of the Fcm system relies upon further technical and economical progress of the technology of digital discrete Fourier transformer operating at very high speed.     

Optimizing IP networks in a hybrid IGP/MPLS environment

In this paper, we consider a traffic engineering (te) approach toip networks in a hybridigp/mpls environment. Thoughigp (Interior Gateway Protocol) routing has proven its scalability and reliability, effective traffic engineering has been difficult to achieve in public IP networks because of the limited functional capabilities of conventionalip technologies.mpls (Multi-Protocol Label Switching) on the one hand enhances the possibility to engineer traffic onip networks by allowing explicit routes. But on the other hand it suffers from the scalability (n-square) problem. Hybridigp/mpls approaches rely onip native routing as much as possible and usempls only if necessary. In this work we propose a novel hybrid traffic engineering method based on genetic algorithms, which can be considered as an offlinete approach to handle long or medium-term traffic variations in the range days, weeks or months. In our approach the maximum number of hops anlsp (Label Switched Path) may take and the number oflsps which are applied solely to improve the routing performance, are treated as constraints due to delay considerations and the complexity of management. We apply our method to the German scientific network (b-win) for which a traffic matrix is available and also to some other networks with a simple demand model. We will show results comparing this hybridigp/mpls routing scenario with the result of pureigp routing and that of a full meshmpls with and without traffic splitting.     

Rain depolarization measurement using INTELSAT-IV satellite in 4 GHz band at a low elevation angle

The degradation of cross polarization discrimination (XPD)due to rain has been measured at 4 GHz using the Indian Ocean INTELSAT-IV satellite at Yamaguchi in Japan, where the satellite elevation angle is as low as 9 degrees. Based on the data obtained from August 1975 to October 1976, this paper describes the analyses on the cumulative time distribution of XPD,the correlation of XPD degradation with surface rain rate and rain attenuation, and the duration characteristics of XPD degradation.     

Circular cross-polarization measurements on earth-space paths at 11,7 GHz

Rain and icecrystal depolarization measurements were made on earthspace paths at four locations across Canada using the circularlypolarized 11.7 GHz beacon transmission from the cts satellite. Results show that when rain is the dominant depolarization mechanism, crosspolarization discrimination (xpd)is statistically related to copolar attenuation (cpa)according to xpd =U?20 log cpa with U showing improvement with increasing elevation angle. Icecrystal depolarization events, with accompanying differential phase shifts as large as 20°, were also observed. An analysis separating these events from the data demonstrates that at 11.7 GHz icecrystal depolarization degrades xpd statistics by less than 1 dB at the small percentages of time.     

Analyse de la stabilité spectrale d’un laser DFB à trois sauts de phase (3PS-DFB)

The aim of this article is to analyze the spectral stability of the three phase shift distributed feedback (3ps-dfb) laser by using Time domain model (tdm). We have developed a software that simulates static and dynamic properties of distributed feedback (dfb) multi-sections laser at large signal. The best single-mode stability operation up to 18mW of the 3ps-dfb is achieved for three phase shifts at (π, π, π) whatever the phase position. These results showed that the 3ps-dfb laser was a much more suitable structure to realize stable single-mode high-power operation for a coherent optical communication system.     

LDPC-based space-time coded OFDM systems: Turbo-EM receiver design with channel state information guessing algorithms

In this paper we study some turbo receiver architectures employing low-density parity check (Ldpc) codes together with orthogonal frequency division multiplexing (Ofdm) for high data rate wireless transmissions. Different demodulation schemes based on expectation-maximization (Em) algorithm are studied along with the channel impulse response (Em) algorithms. We studied differentCir guessing algorithms including the EM-based algorithms such as a space-alternating generalized expectation-maximization algorithm (Sage). It is shown that the proposed turbo-Em receiver employing a soft maximum a posteriori (Map)Em demodulator and a belief propagationLdpc decoder can perform within 1 dB from the ergodic capacity of the studiedMimo ofdm channels. Besides, we find that a suboptimum structure based on a soft interference cancellationMmse filtering demodulator exhibits negligible loss in non-correlated fadingMimo channels but suffer extra performance loss in highly correlatedMimo channels.     

Technical and economic aspects of the different fibre fabrication processes

The processes for making preforms for hard glass fibres are the Vad process, the Ovd process, the Mcvd (Pmcvd) process and the Pcvd process. This paper discusses the processes themselves, the optical properties of multimode, single-mode and high Na fibres made with these processes and the potentials of the different processes. For really large scale applications it will be necessary to reduce the costs of manufacturing these fibres. The factors that determine these costs are discussed and ways in which they can be reduced are indicated.     

The Hunting of the SNARK

The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally sound proofs where the verifier’s work is essentially independent of the complexity of the NP non-deterministic verifier) has been an intriguing question for the past two decades. Other than CS proofs in the random oracle model (Micali in SIAM J Comput 30(4):1253–1298, 2000), prior to our work the only existing candidate construction is based on an elaborate assumption that is tailored to a specific protocol (Di Crescenzo and Lipmaa in Proceedings of the 4th conference on computability in Europe, 2008). We formulate a general and relatively natural notion of an extractable collision-resistant hash function (ECRH) and show that, if ECRHs exist, then a modified version of Di Crescenzo and Lipmaa’s protocol is a succinct non-interactive argument for NP. Furthermore, the modified protocol is actually a succinct non-interactive adaptive argument of knowledge (SNARK). We then propose several candidate constructions for ECRHs and relaxations thereof. We demonstrate the applicability of SNARKs to various forms of delegation of computation, to succinct non-interactive zero-knowledge arguments, and to succinct two-party secure computation. Finally, we show that SNARKs essentially imply the existence of ECRHs, thus demonstrating the necessity of the assumption. Going beyond \(\hbox {ECRH}\)s, we formulate the notion of extractable one-way functions (\(\hbox {EOWF}\)s). Assuming the existence of a natural variant of \(\hbox {EOWF}\)s, we construct a two-message selective-opening-attack-secure commitment scheme and a three-round zero-knowledge argument of knowledge. Furthermore, if the \(\hbox {EOWF}\)s are concurrently extractable, the three-round zero-knowledge protocol is also concurrent zero knowledge. Our constructions circumvent previous black-box impossibility results regarding these protocols by relying on \(\hbox {EOWF}\)s as the non-black-box component in the security reductions.     

Modélisation de la technique temporelle asynchrone

The evolution towards the integrated broadband communication network is undertaken by several countries. In France, system designers ofCnet in Lannion have assembled an experimental integrated broadband communication network (Ibcn)called Prelude based upon a 4.5 Gbit/s switching matrix and a new and promising transfer mode called the asynchronous time-division technique (Atd).During the project, performance evaluation studies have been carried through, aiming to validate the Atd concepts and to dimension the switching matrix. This paper reviews the Ibcn lab experiments in the world, with operational characteristics;Atd concepts are detailed and the most important features of Ibcn modelling are given. Finally, the network dimensioning is carried through giving packet size, buffers length, loss probabilities and waiting times.     

Bandwidth sharing under the assured forwarding Per-Hop behavior

The DiffServ’s Assured Forwarding (af) Per-Hop Behavior (phb) Group defines a differentiated forwarding of packets in four independent classes, each class having three levels of drop precedence. Specific end-to-end services based on thisphb are still being defined. A particular type of service that could assure a given rate to a traffic aggregate has been outlined elsewhere. In such a service, a fair distribution of bandwidth is one of the main concerns. This paper presents experimental work carried out to evaluate howaf distributes bandwidth among flows under different load conditions and traffic patterns. We focused on the effect that marking mechanisms have on bandwidth sharing among flows within a singleaf class. The traffic types we used includeudp flows, individual and aggregatedtcp flows, mix oftcp andudp, tcp sessions with heterogeneous round-trip times, as well as color-blind and color-aware re-marking at the aggregation point fortcp flows. Tests were performed on real and simulated networks. We have found certain conditions under whichaf distributes bandwidth fairly among nonadaptiveudp flows andtcp aggregates. Finally, we evaluate a basic rule for setting the parameters of the two-rate Three-Color Marker conditioning algorithm (trtcm) in order to achieve a better bandwidth distribution fortcp flows.     

Extinction,scattering, and absorption of anomalous radar-reflected emission in a cloud and atmosphere

For the anomalous radar reflection from the oversized water drops originating in water-ice phase transition observable in the submillimeter band transparency “window” of ice [1] we consider the process of extinction, scattering, and absorption in a cloud and atmosphere. Our calculations, which are based on experimental results, show that in the situation when the convective cloud is illuminated from nadir by a narrow-beam submillimeter radar (carried on board an airplane or a satellite), the total extinction and absorption in the cloud and atmosphere is nearby 20dB in the long-wave transparency “window” of atmosphere. In the central part of submillimeter band these losses may be as high as 40dB.However,the level of losses has no effect on a difference between the radar reflection coefficients for overcooled water and ice existing due to phase transition, and this difference may be over 20dB in the 0.3 to 0.8mm ice transparency “window”.     

Optimisation de la quantification vectorielle codée par treillis: application au codage des paramètres LSF

Speech coders operating at low bit rates necessitate efficient encoding of the linear predictive coding (Lpc) coefficients. Line spectral Frequencies (Lsf) parameters are currently one of the most efficient choices of transmission parameters for theLpc coefficients. In this paper, an optimized trellis coded vector quantization (Tcvq) scheme for encoding theLsf parameters is presented. When the selection of a proper distortion measure is the most important issue in the design and operation of the encoder, an appropriate weighted distance measure has been used during theTcvq construction process. We further applied the optimizedTcvq system for encoding theLsf parameters of the us Federal Standard (Fs1016) 4.8 kbps speech coder. At lower bit rates, objective and subjective evaluation results show that the incorporatedLsf tcvq encoder performs better than the 34 bits/frameLsf scalar quantizer used originally in the fs1016 coder. The subjective tests reveal also that the 27 bit/frame scheme produces equivalent perceptual quality to that when theLsf parameters are unquantized.     

Propagation oblique dans les bandes de fréquences des 11 et 14 GHz

After describing the characteristics of the experimental satellite telecommunications earth-station at the Cnet,the article sets out the results of propagation measurements carried out on the one hand with the Italian experimental communications satellite Sirio I between November 1977 and November 1978, and on the other hand with the European Ots satellite between January and November 1979. 8 353 hours of useful data recording have been obtained using Sirio Iand 7 879 hours with Ots.