Multiple and Unlinkable Public Key Encryption without Certificates

We newly propose a multiple and unlinkable identity-based public key encryption scheme. Unlike the traditional public key encryption and identity-based encryption schemes, our scheme allows the use of a various number of identity-based public keys in different groups or applications while keeping a single decryption key so that the decryption key can decrypt every ciphertexts encrypted with those public keys. Also our scheme removes the use of certificates as well as the key escrow problem so it is functional and practical. Since our public keys are unlinkable, the user\u27s privacy can be protected from attackers who collect and trace the user information and behavior using the known public keys. Furthermore, we suggest a decryption key renewal protocol to strengthen the security of the single decryption key. Finally, we prove the security of our scheme against the adaptive chosen-ciphertext attack under the random oracle model

An Evaluation Methodology for Parallel/Distributed Software Tools

The recent rapid growth of the network computing applications area has been accelerated by a variety of parallel and distributed computing (PDC) software tools that simplify process management, inter-process communication, and program debugging in a PDC environment. This variety of software tools varies significantly in terms of the application domain targeted and corresponding functionality provided, the computational and communication model supported, the underlying implementation philosophy, and the computing environments supported. This makes the selection of the best tool to run a given class of applications on a parallel or distributed system a non-trivial task that requires some investigation. Currently, there are no general criteria to evaluate PDC software tools, nor is it easy to lay down such criteria. In this paper we present a multilevel evaluation methodology for PDC software tools in which tools are evaluated from three different perspectives: tool performance level (TPL..

A Multithreaded Message-Passing System for High Performance Distributed Computing Applications

High Performance Distributed Computing (HPDC) applications require low-latency and high-throughput communication services and HPDC applications have different Quality of Service (QOS) requirements (e.g., bandwidth requirement, flow/error control algorithms, etc.). The communication services provided by traditional message-passing systems are fixed and thus can not be changed to meet the requirements of different HPDC applications. NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing system developed at Syracuse University that provides high-performance and flexible communication services. In this paper, we overview the general architecture of NCS and present how NCS communication services are implemented. NCS point-to-point communication is flexible in that users can configure efficient point-to-point primitives by selecting suitable flow control, errror control algorithms, and communication interfaces on a per-connection..

Grant-Free Resource Allocation for NOMA V2X Uplink Systems Using a Genetic Algorithm Approach

While NOMA-V2V (non-orthogonal multiple accesscan-vehicle-to-vehicle) effectively achieve massive connectivity requirements in 5G network systems, minimizing communication latency is a very crucial challenge. To address the latency problem, we propose a channel allocation method called hyper-fraction, which divides the road into many zones and allocates a channel to each zone. Then, a vehicle located within the corresponding zone uses the channel allocated to the zone. Hyper-fraction will allow the system to minimize communication latency between a user equipment (UE) and a base station (BS) caused by scheduling processes and consequentially reduce the overall latency of the system. In the simulation, a novel concept of genetic algorithm (GA) is utilized, called GA with continuous pool. It is an approach to enable conventional GA to solve optimization problems for continuous situations within much less computation, especially in situations where the elements in the system keep moving such as vehicular networks. As a result, GA with continuous pool is proven to be an effective heuristic method to improve throughput rate, as well as hyper-fraction improving the latency of NOMA V2V and vehicle-to-infrastructure (V2I) systems

An Efficient Group Communication Architecture over ATM Networks

NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing system developed at Syracuse University that provides low-latency and high-throughput communication services over the Asynchronous Transfer Mode (ATM)-based High Performance Distributed Computing (HPDC) environment. In this paper, we overview the general architecture of NCS and present the details of the multicasting services provided by NCS. NCS provides flexible and scalable group communication services based on the dynamic grouping and tree-based multicasting algorithm. The NCS architecture, which separates the data and control transfer, allows the group operations to be implemented efficiently by utilizing the control connections when transferring status information (e.g., topology information, routing information). Furthermore, NCS provides several different algorithms for group communication and allows the programmers to select an appropriate algorithm at runtime..

A Multithreaded Communication System for ATM-Based High Performance Distributed Computing Environments

Current advances in processor technology and the rapid development of high-speed networking technology (e.g., Asynchronous Transfer Mode (ATM), Myrinet, and Fast Ethernet) have made network-based computing an attractive environment for large-scale High Performance Distributed Computing (HPDC) applications. However, due to the communication overhead between computers and the inflexible communication architectures of the parallel/distributed software tools, most HPDC applications do not fully utilize the benefits of high-speed communication networks. This can be mainly attributed to the high cost associated with system calls and context switching, redundant data copying during protocol processing, lack of support to overlap computation and communication at the application level, and tight coupling of data and control functions. In this paper, we present an architecture, implementation, and performance evaluation of a multithreaded message-passing system for an ATM-based HPDC environment ..