Search results for "Identifier"
showing 10 items of 24 documents
Hpdm : A Hybrid Pseudonym Distribution Method for Vehicular Ad-Hoc Networks
2016
Abstract Protecting the location privacy of drivers is still one of the main challenges in Vehicular Ad-hoc Networks (VANETs). The changing of pseudonym is commonly accepted as a solution to this problem. The pseudonyms represent fake vehicle identifiers. Roadside Units (RSUs) play a central role in the existing pseudonyms distribution solutions. Indeed, the VANET area should totally be covered by RSUs in order to satisfy the demand of vehicles in terms of pseudonyms. However, the total coverage is costly and hard to be achieved, especially in the first phase of VANETs deployment. In addition, RSUs could be overloaded due to the large number of pseudonyms requests that could be received fro…
Privacy enhanced mutual authentication in LTE
2013
In this paper we propose a way to enhance the identity privacy in LTE/LTE-Advanced systems. This is achieved while minimizing the impact on the existing E-UTRAN system. This is important since proposals to modify a widely deployed infrastructure must be cost effective, both in terms of design changes and in terms of deployment cost. In our proposal, the user equipment (UE) identifies itself with a dummy identity, consisting only of the mobile nation code and the mobile network code. We use the existing signalling mechanisms in a novel way to request a special encrypted identity information element. This element is protected using identity-based encryption (IBE), with the home network (HPLMN…
Discrete and Conservative Factorizations in Fib(B)
2021
AbstractWe focus on the transfer of some known orthogonal factorization systems from$$\mathsf {Cat}$$Catto the 2-category$${\mathsf {Fib}}(B)$$Fib(B)of fibrations over a fixed base categoryB: the internal version of thecomprehensive factorization, and the factorization systems given by (sequence of coidentifiers, discrete morphism) and (sequence of coinverters, conservative morphism) respectively. For the class of fibrewise opfibrations in$${\mathsf {Fib}}(B)$$Fib(B), the construction of the latter two simplify to a single coidentifier (respectively coinverter) followed by an internal discrete opfibration (resp. fibrewise opfibration in groupoids). We show how these results follow from thei…
Notice of Violation of IEEE Publication Principles: Distributed Multimedia Digital Libraries on Peer-to-Peer Networks
2007
This paper presents an original approach to image sharing in large, distributed digital libraries, in which a user is able to interactively search interesting resources by means of content-based image retrieval techniques. The approach described here addresses the issues arising when the content is managed through a peer-to-peer architecture. In this case, the retrieval facilities are likely to be limited to queries based on unique identifiers or small sets of keywords, which may be quite inadequate, so we propose a novel algorithm for routing user queries that exploits compact representations of multimedia resources shared by each peer in order to dynamically adapt the network topology to …
Experimental realization of a Persistent Identifier Infrastructure stack for Named Data Networking
2015
The continuation of Persistent Identifier Infrastructures is crucial when next-generation Internet architectures based on Information-Centric Networking (ICN) arise. When moving to ICN, we must ensure the resolution of Persistent Identifiers (PID), such as the billions of Digital Object Identifiers (DOI) used today, to provide continued access to scientific literature and research data. It provides the base for the necessary transformations in the Handle System architecture and protocol for running a PID system on the Named Data Networking (NDN) architecture, which is a recent incarnation of ICN. Furthermore, it examines the PID-specific resolution access patterns, investigates the expected…
The Design of Secure and Efficient P2PSIP Communication Systems
2010
Recently, both academia and industry have initiated research projects directed on integration of P2PSIP paradigm into communication systems. In this paradigm, P2P network stores most of the network information among participating peers without help of the central servers. The concept of self-configuration, self-establishment greatly improves the robustness of the network system compared with the traditional Client/Server based systems. In this paper, we propose a system architecture for constructing efficient and secure P2PSIP communication systems. The proposed approach includes three-layer hierarchical overlay division, peer identifier assignment, cache based efficiency enhancement, proxy…
Discovery privacy threats via device de-anonymization in LoRaWAN
2021
LoRaWAN (Long Range WAN) is one of the well-known emerging technologies for the Internet of Things (IoT). Many IoT applications involve simple devices that transmit their data toward network gateways or access points that, in their turn, redirect data to application servers. While several security issues have been addressed in the LoRaWAN specification v1.1, there are still some aspects that may undermine privacy and security of the interconnected IoT devices. In this paper, we tackle a privacy aspect related to LoRaWAN device identity. The proposed approach, by monitoring the network traffic in LoRaWAN, is able to derive, in a probabilistic way, the unique identifier of the IoT device from…
Leader election and local identifiers for three‐dimensional programmable matter
2020
International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…
Particle Swarm Optimization as a New Measure of Machine Translation Efficiency
2018
The present work proposes a new approach to measuring efficiency of evolutionary algorithm-based Machine Translation. We implement some attributes of evolutionary algorithms performing cosine similarity objective function of a Particle Swarm Optimization (PSO) algorithm then, we evaluate an English text set for translation precision into the Spanish text as a simulated benchmark, and explore the backward process. Our results show that PSO algorithm can be used for translation of multiple language sentences with one identifier only, in other words the technology presented is language-pair independent. Specifically, we indicate that our cosine similarity objective function improves the veloci…
Patient-reported impact of Charcot-Marie-Tooth disease: protocol for a real-world digital lifestyle study
2021
Abstract Background Charcot-Marie-Tooth disease (CMT) is a rare, chronic, progressive motor and sensory neuropathy that affects the peripheral nervous system, leading to progressive, predominantly distal muscle weakness, atrophy, sensory loss and progressive limb dysfunction. As with many rare diseases, there is a lack of patient-reported data with which to understand and address patient needs. This study aims to explore the real-world impact of CMT from the patient perspective. Methods This is a prospective, digital lifestyle study of at least 2,000 people with CMT, >18 years, resident in the following countries: France, Germany, Italy, Spain, the UK and the USA. Participants will be re…