this paper is about to discover the roots of formation of one of the political and social phenomena called political party in a particular period of iranian contemporary history. in the light of this kind of study we can go beyond the superficial and general analyses which are the characteristic of traditional and under developed societies unfortunately these analyses are used to justify all th...

The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We prove...

Secure multiparty computations allow independent parties to collectively analyze data without compromising their input’s privacy. This data secrecy is guaranteed in some security model: in the passive model an adversary can only look at data visible to it, while in the active model adversaries can actively interfere in the computations. So from a security standpoint the active model is preferab...

This paper presents the results of initial investigation and experiments into automatic action item detection from transcripts of multi-party human-human meetings. We start from the flat action item annotations of [1], and show that automatic classification performance is limited. We then describe a new hierarchical annotation schema based on the roles utterances play in the action item assignm...

1

Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the k-ranked element of the union of the datasets, e.g. the median of the values in the datasets. We investigate protocols with sublinear computation and communication costs. In the two-party case, we show that the k-ranked element can be computed in log k rounds, where the computati...

In previous lectures, the notion of secure multiparty computing was developed. The setting is that there are m parties, each of which has a private input x1, . . . , xm. The goal is to compute f(x1, . . . , xm, R) securely, where R is random coins and “securely” means that no party obtains any more knowledge about other parties’ private inputs than could be obtained if all computation were done...

PREDATOR is a data structure precompiler that generates efficient code for maintaining and querying complex data structures. It embodies a novel component reuse technology that transcends traditional generic data types. In this paper, we explain the concepts of our work and our prototype system. We show how complex data structures can be specified as compositions of software building blocks, an...