Cloud computing emerges as an attractive solution that can be delegated to store and process confidential data. However, several security risks are encountered with such a system as the securely encrypted data should be decrypted before processing them. Therefore, the decrypted data is susceptible to reading and alterations. As a result, processing encrypted data has been a research subject sin...

Numerical deconvolution of 3D fluorescence microscopy data yields sharper images by reversing the known optical aberrations introduced during the acquisition process. When additional prior information such as the topology and smoothness of the imaged object surface is available, the deconvolution can be performed by fitting a parametric surface directly to the image data. In this work, we incor...

Privacy is considered one of the key challenges when moving services to the Cloud. Solution like access control are brittle, while fully homomorphic encryption that is hailed as the silver bullet for this problem is far from practical. But would fully homomorphic encryption really be such an effective solution to the privacy problem? And can we already deploy architectures with similar security...

We propose a general framework to develop fully homomorphic encryption schemes (FHE) without using the Gentry’s technique. Initially, a private-key cryptosystem is built over Zn (n being an RSA modulus). An encryption of x ∈ Zn is a randomly chosen vector e such that Φ(e) = x where Φ is a secret multivariate polynomial. This private-key cryptosystem is not homomorphic in the sense that the vect...

A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known group-homomorphic cryptosystems. Our main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks’ scheme), w...

Traditional encryption schemes, both symmetric and asymmetric, were not designed to respect the algebraic structure of the plaintext and ciphertext spaces. Many schemes, such as ElGamal (resp. e.g. Paillier), are multiplicatively homomorphic (resp. additively homomorphic), and can be used to perform limited types of computations directly on the encrypted data and have them pass through the encr...

Homomorphic encryption offers potential for secure cloud computing. However due to the complexity of homomorphic encryption schemes, performance of implemented schemes to date have been unpractical. This work investigates the use of hardware, specifically Field Programmable Gate Array (FPGA) technology, for implementing the building blocks involved in somewhat and fully homomorphic encryption s...

Homomorphic Encryption yields deliberately malleable ciphertext, allowing operations on encrypted data. We outline and implement a homomorphic encryption scheme as suggested by Zhou and Wornell [1] that encrypts integer vectors to allow computation of arbitrary polynomials in the encrypted domain with a bounded degree. This finds applications particularly in cloud computation, when one is inter...

We describe and apply an iterative, t ime-domain deconvolution approach to receiver-function estimation and illustrate the reliability and advantages of the technique using syntheticand observation-based examples. The iterative technique is commonly used in earthquake t ime-function studies and offers several advantages in receiver-function analysis such as intuitively stripping the largest rec...