We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithmetic circuits over any finite field Fpk . Our protocol consists of a preprocessing phase that is both independent of the function to be computed and of the inputs, and a much more efficient online phase where the actual...

In this paper the concepts of somewhat fuzzy δ-continuous functions, somewhat fuzzy δ-open functions between fuzzy topological spaces are introduced and studied. Besides giving characterizations of these functions, several interesting properties of these functions are studied. The concepts of fuzzy δ-resolvable spaces and fuzzy δ-irresolvable spaces are also introduced and studied in this paper...

We describe a symmetric variant of homomomorphic encryption scheme by van Dijk et al. [DGHV10], semantically secure under the error-free approximate-GCD problem. We also provide the implementation of the scheme as a C/C++ library. The scheme allows to perform “mixed” homomorphic operations on ciphertexts and plaintexts, eliminating the need to encrypt new ciphertexts using the public key for so...

In a private database query system, a client issues queries to a database and obtains the results without learning anything else about the database and without the server learning the query. While previous work has yielded systems that can efficiently support disjunction queries, performing conjunction queries privately remains an open problem. In this work, we show that using a polynomial enco...