Opportunistic relaying scheme is a single cooperative relay selection method based on Channel State Information. However, the failure probability of the best relay selection may become unacceptable when the number of relays increases. Although most of the existing solutions can reduce the failure probability of relay selection, they ignore the fairness of the relay selection. In order to improv...

The relay channel consists of a transmitter input x1, a relay input x2, a relay output y2 and a receiver output y3. In this report, we combine a degraded semi-deterministic relay channel with a semi-deterministic orthogonal relay channel to obtain a new mixture relay channel. For the new mixture relay channel, a combination of the compress-and-forward strategy and the partial decode-and-forward...

In a relay channel, between the sender X and the the receiver Y lies at least one relay. Generally, the relay can both transmit its own information and help forwarding other sources’ information. This summary considers the latter case, i.e., the relay intends solely to help the receiver. The relay and the transmitter cooperate to resolve the receiver’s uncertainty. Due to the presence of relay,...

We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a computationally limited device to an untrusted helper. In our model, the adversarial environment writes the software for the helper, but then does not have direct communication with it once the device starts relying on it. ...

Legacy desktop applications – the applications in use on most desktops today – often process data from multiple untrusted sources. If an application makes a mistake when processing this data, the integrity of the application, and potentially the entire system, can be compromised. We introduce a new operating system primitive that enables an application running on a legacy OS to efficiently crea...

We present a service for locating and retrieving les from an untrusted network such that the integrity of the retrieved les can be veriied. This service enables groups of people in geographically remote locations to share les using an untrusted network. For example, distribution of an organization's software to all the or-ganization's sites can be accomplished using this service. Distribution o...

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but can only communicate by exchanging messages through their host parties. These are untrusted and could intercept and drop those messages. We sh...

We present a service for locating and retrieving les from an untrusted network such that the integrity of the retrieved les can be veri ed. This service enables groups of people in geographically remote locations to share les using an untrusted network. For example, distribution of an organization's software to all the organization's sites can be accomplished using this service. Distribution of...

Delegated subset tests are mandatory in many applications, such as content-based networks and outsourced text retrieval, where an untrusted server evaluates the degree of matching between two data sets. We design a novel scheme to protect the privacy of the data sets in comparison against the untrusted server, with half of the computation cost and half of the ciphertext size of existing solutio...

JAMUS (Java Accommodation of Mobile Untrusted Software) is a Java platform dedicated to the accommodation of untrusted programs that can specify their requirements regarding the resources available on the system. It relies on the principle of resource contracting in order to offer a certain level of quality of service to hosted programs, while ensuring a safe execution of these programs at runt...