An efficient instance hiding scheme

Abstract

Delegating computation, which is applicable to many practical contexts such as cloud computing or pay-TV system, concerns the task where a computationally <i>weak</i> client wants to securely compute a very complex function <i>f</i> on a given input with the help of a remote computationally <i>strong</i> but <i>untrusted</i> server. The requirement is that the computation complexity of the client is much more efficient than that of <i>f</i>, ideally it should be in constant time or in <i>NC</i><sup>0</sup>. This task has been investigated in several contexts such as instance hiding, randomized encoding, fully homomorphic encryption, garbling schemes, and verifiable scheme. In this work, we specifically consider the context where only the client has an input and gets an output, also called instance hiding. Concretely, we first give a survey of delegating computation, we then propose an efficient instance hiding scheme with <i>passive</i> input privacy. In our scheme, the computation complexity of the client is in <i>NC</i><sup>0</sup> and that of the server is exactly the same as the original function <i>f</i>. Regarding communication complexity, the client in our scheme just needs to transfer 4|<i>f</i>| + |<i>x</i>| bits to the server, where |<i>f</i>| is the size of the circuit representing <i>f</i> and |<i>x</i>| is the length of the input of <i>f</i>.

DOI: 10.1145/3011077.3011100

Cite this paper

@inproceedings{Malluhi2016AnEI, title={An efficient instance hiding scheme}, author={Qutaibah M. Malluhi and Abdullatif Shikfa and Viet Cuong Trinh}, booktitle={SoICT}, year={2016} }