4 research outputs found

    Round and Communication Balanced Protocols for Oblivious Evaluation of Finite State Machines

    Get PDF
    We propose protocols for obliviously evaluating finite-state machines, i.e., the evaluation is shared between the provider of the finite-state machine and the provider of the input string in such a manner that neither party learns the other's input, and the states being visited are hidden from both. For alphabet size Σ|\Sigma|, number of states Q|Q|, and input length nn, previous solutions have either required a number of rounds linear in nn or communication Ω(nΣQlogQ)\Omega(n|\Sigma||Q|\log|Q|). Our solutions require 2 rounds with communication O(n(Σ+QlogQ))O(n(|\Sigma|+|Q|\log|Q|)). We present two different solutions to this problem, a two-party one and a setting with an untrusted but non-colluding helper

    An Optimized GHV-Type HE Scheme: Simpler, Faster, and More Versatile

    Get PDF
    In this paper we present an optimized variant of Gentry, Halevi and Vaikuntanathan (GHV)\u27s Homomorphic Encryption (HE) scheme (EUROCRYPT\u2710). Our scheme is appreciably more efficient than the original GHV scheme without losing its merits of the (multi-key) homomorphic property and matrix encryption property. In this research, we first measure the density for the trapdoor pairs that are created by using Alwen and Peikert\u27s trapdoor generation algorithm and Micciancio and Peikert\u27s trapdoor generation algorithm, respectively, and use the measurement result to precisely discuss the time and space complexity of the corresponding GHV instantiations. We then propose a generic GHV-type construction with several optimizations that improve the time and space efficiency from the original GHV scheme. In particular, our new scheme can achieve asymptotically optimal time complexity and avoid generating and storing the inverse of the used trapdoor. Finally, we present an instantiation that, by using a new set of (lower) bound parameters, has the smaller sizes of the key and ciphertext than the original GHV scheme

    Privacy-Preserving Regular Expression Evaluation on Encrypted Data

    Get PDF
    Motivated by the need to outsource file storage to untrusted clouds while still permitting controlled use of that data by authorized third parties, in this dissertation we present a family of protocols by which a client can evaluate a regular expression on an encrypted file stored at a server (the cloud), once authorized to do so by the file owner. We present a protocol that provably protects the privacy of the regular expression and the file contents from a malicious server and the privacy of the file contents (except for the evaluation result) from an honest-but-curious client. We then extend this protocol in two primary directions. In one direction, we develop a strengthened protocol that enables the client to detect any misbehavior of the server; in particular, the client can verify that the result of its regular-expression evaluation is based on the authentic file stored there by the data owner, and in this sense the file and evaluation result are authenticated to the client. The second direction in which we extend our initial protocol is motivated by the vast adoption of resource-constrained mobile devices, and the fact that our protocols involve relatively intensive client-server interaction and computation on the searching client. We therefore investigate an alternative in which the client (e.g., via her mobile device) can submit her encrypted regular expression to a partially trusted proxy, which then interacts with the server hosting the encrypted data and reports the encrypted evaluation result to the client. Neither the search query nor the result is revealed to an honest-but-curious proxy or malicious server during the process. We demonstrate the practicality of the protocol by prototyping a system to perform regular-expression searches on encrypted emails and evaluate its performance using a real-world email dataset.Doctor of Philosoph
    corecore