We consider applications where an untrusted aggregator would like to collect privacy sensitive data from users, and compute aggregate statistics periodically. For example, imagine a smart grid operator who wishes to aggregate the total power consumption of a neighborhood every ten minutes; or a market researcher who wishes to track the fraction of population watching ESPN on an hourly basis. We...

We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the network. Motivated by earlier work using a rank-based approach, i.e., Rooted-PageRank, we introduce a novel timesensitive method, called T-RPR, that captures and exploits the dynamics and evolution of the interaction patterns in the network ...

A recent trend in cryptography is to formally show the leakage resilience of cryptographic implementations in a given leakage model. One of the most prominent leakage models – the so-called bounded leakage model – assumes that the amount of leakage is a-priori bounded. Unfortunately, it has been pointed out that the assumption of bounded leakages is hard to verify in practice. A more realistic ...

the conceptualization of resilience as a general or multidimensional construct and recognizing the inhibitors and facilitators of it are the main issues in the resilience literature. therefore, the present study investigated the discriminant variables of educational resilient and emotional resilient groups in person-focused approach, to examine the general or multidimensional construct of resil...

Big cities in developing countries face many obstacles related to the built environment when confronted by socioeconomic inequalities, which is reflected uneven access basic living infrastructure, such as sanitation and housing. In light of new approaches traditional materials building techniques, this article aims investigate use digital fabrication tools production lightweight precast systems...

this is a survey of some recent applications of abstract algebra, and in particular group rings, to the `communications' areas.

in this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (steganography). data is encrypted bytwo methods before embedding to increase reliability. then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...