A New Framework for Privacy-Preserving Aggregation of Time-Series Data

Being able to deal with this additional time variable z is actually important in combinatorics (e.g., to count certain numbers of walks confined to the quarter plane, see [16]) and

In this paper we developed a general framework for relating formal and computational models for generic encryption schemes in the random oracle model.. We proposed general

In this paper, we extend Bana et al.’s approach by introducing a notion of symbolic equivalence that allows us to prove computational security of encryption schemes symbolically..

The methodology implemented within the PP-OMDS framework foresees a multi- step approach that comprises: (i) conceptual analysis and design of case studies and related use

We present a comparison between the numerical solution to the Boltzmann equation ob- tained using a spectral scheme [17], the approximation to the compressible Navier-Stokes

schemes that support an unbounded number of functional keys; such works in- vestigate generic theoretical implications/separations between different kinds of primitives — such

In this section, we show that assuming a CRIND-Secure (in the standard model) MI-FE scheme for p-TM 2 (2-inputs Turing machines with run time equal to a polynomial p) for any

The FLIP family of stream ciphers follow the filter permutator structure. It has first been specified in [MJSC16]. In particular, its resistance against several types of attacks