Telcordia Technologies

About: Telcordia Technologies is a based out in . It is known for research contribution in the topics: Network packet & Node (networking). The organization has 3097 authors who have published 4737 publications receiving 237882 citations.

Predictive coding of multi-viewpoint image sets

Abstract: Three dimensional display of moving images greatly enhances realism and adds a unique sense of "presence". Three dimensional video systems have been kept from widespread application by two technical problems, the need for glasses, viewing hoods, or other cumbersome devices for image steering, and the high bandwidths needed for transmission. Devices that avoid the discomfort of headgear by using autostereoscopic (pseudo-holographic) displays are known, but these methods require even higher bandwidths to be effective. This paper introduces the use of digital predictive coding as a means of data compression for the transmission or storage of a set of spatially related images needed for an autostereoscopic display. (Interframe coding without frame memories.) The algorithms, implementations, and application of a new sort of predictor called Disparity Corrected Prediction are described.

Efficient and Non-interactive Non-malleable Commitment

Abstract: We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are noninteractive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, noninteractive commitment scheme (based on general assumptions) that is perfectly binding.

Influence of transition metal complexes on atmospheric droplet acidity

Abstract: Transition metals are common constituents of cloud droplets, raindrops and other atmospheric droplets1–5 (see Table 1). To evaluate the relative importance of pathways catalysed by transition metals in atmospheric droplet chemistry, especially reactions that increase the net acidity of atmospheric droplets, we have now formulated the first detailed model of such chemistry which incorporates transition metal complexes. Results from our computer simulations suggest that at pH 4, transition metal catalysed pathways account for 30–55% of the oxidation of S(IV) (sulphur dioxide and related sulphites) to S(VI) (sulphuric acid and related sulphates). Furthermore, the calculations suggest that transition metal reactions are the principal sources of free radicals in atmospheric droplets and that a catalytic cycle involving the Fe(II)–Fe(III) couple is an efficient producer of organic acids from oxidation of the ubiquitous atmospheric aldehydes.

System and method for using networked mobile devices in vehicles

Abstract: A system and method for using networked mobile devices in a vehicle in a tightly integrated manner is presented. The vehicle has an OBE, a mobile device client, and vehicle components, and the mobile device has a mobile device proxy and applications, such that the mobile device client and the mobile device proxy communicate, enabling dynamic transfer of the applications to the OBE and execution of the applications on the mobile device and the OBE using the plurality of vehicle components at runtime. In one embodiment, the mobile device client and the mobile device proxy authenticate each other. The authentication can be performed using digital certificates. The mobile device client can communicate the vehicle components on the vehicle to the mobile device proxy. The mobile device client and the mobile device proxy can communicate using Bluetooth. The vehicle components can include dashboard displays, speakers, and voice I/O systems.

Perfectly secure password protocols in the bounded retrieval model

Abstract: We introduce a formal model, which we call the Bounded Retrieval Model, for the design and analysis of cryptographic protocols remaining secure against intruders that can retrieve a limited amount of parties' private memory. The underlying model assumption on the intruders' behavior is supported by real-life physical and logical considerations, such as the inherent superiority of a party's local data bus over a remote intruder's bandwidth-limited channel, or the detectability of voluminous resource access by any local intruder. More specifically, we assume a fixed upper bound on the amount of a party's storage retrieved by the adversary. Our model could be considered a non-trivial variation of the well-studied Bounded Storage Model, which postulates a bound on the amount of storage available to an adversary attacking a given system. In this model we study perhaps the simplest among cryptographic tasks: user authentication via a password protocol. Specifically, we study the problem of constructing efficient password protocols that remain secure against offline dictionary attacks even when a large (but bounded) part of the storage of the server responsible for password verification is retrieved by an intruder through a remote or local connection. We show password protocols having satisfactory performance on both efficiency (in terms of the server's running time) and provable security (making the offline dictionary attack not significantly stronger than the online attack). We also study the tradeoffs between efficiency, quantitative and qualitative security in these protocols. All our schemes achieve perfect security (security against computationally-unbounded adversaries). Our main schemes achieve the interesting efficiency property of the server's lookup complexity being much smaller than the adversary's retrieval bound.