In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption schemes, using their homomorphic properties in a black-box way. A few notable examples of such primitives include items like single database Private Information Retrieval (PIR) schemes (introduced in [15]) and private da...

We introduce a hybrid homomorphic encryption by combining public key encryption (PKE) and somewhat homomorphic encryption (SHE) to reduce storage for most applications of somewhat or fully homomorphic encryption (FHE). In this model, one encrypts messages with a PKE and computes on encrypted data using a SHE or a FHE after homomorphic decryption. To obtain efficient homomorphic decryption, our ...

spectral decomposition or time-frequency representation (tfr) is a powerful tool for analyzing time varying nature of seismic data. mapping of a one dimensional seismic time trace to a two dimensional function of time and frequency reveals some characteristics of seismic signals that are not available in only time or frequency representations. this approach has been widely used in seismic explo...

In this work, we introduce $H^*$-condition on the set of submodules of a module. Let $M$ be a module. We say $M$ satisfies $H^*$ provided that for every submodule $N$ of $M$, there is a direct summand$D$ of $M$ such that $(N+D)/N$ and $(N+D)/D$ are cosingular. We show that over a right perfect right $GV$-ring,a homomorphic image of a $H^*$ duo module satisfies $H^*$.

The formal expression of pro positional attitudes, especially when nested (iterated), is an important problem for A I . An interesting first-order extensional logical system for such expression has been proposed by Creary. In this system concepts (and concepts of concepts, etc.) are made explicit. The system includes "concept functions", which are special functions which act on and deliver conc...

Secure function evaluation (SFE) is the process of computing a function (or running an algorithm) on some data, while keeping the input, output and intermediate results hidden from the environment in which the function is evaluated. This can be done using fully homomorphic encryption, Yao's garbled circuits or secure multiparty computation. Applications are manifold, most prominently the outsou...

Colocalization of dihydropyridine (DHPR) and ryanodine (RyR) receptors, a key determinant of Ca(2+)-induced Ca2+ release, was previously estimated in 3-, 6-, 10-, and 20-day-old rabbit ventricular myocytes by immunocytochemistry and confocal microscopy. We now report on the effects of deconvolution (using a maximum-likelihood estimation algorithm) on the calculation of colocalization indexes. C...

In this work, we present a generic open-source software framework that can evaluate the correctness and performance of homomorphic encryption software. Our framework, called HEtest, automates the entire process of a test: generation of data for testing (such as circuits and inputs), execution of a test, comparison of performance to an insecure baseline, statistical analysis of the test results,...

Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication can be performed in  ~ (nlog n) scalar operations, and ciphertext size is reduced at the same time. The CPA security of this scheme can be reduced into RLWE...