Provably secure data hiding and tamper resistance for a simple loop program

We study the problem of computing with encrypted data. We propose a hiding scheme that allows a client to execute a simple loop program with real or complex inputs securely on a server. This is the first hiding scheme that we are aware of that applies to real and complex data. The scheme allows the client to efficiently determine with high probability whether the results returned by the server are correct. The scheme we propose uses new techniques that have not been used previously in this context.

[1]  Christian S. Collberg,et al.  Breaking abstractions and unstructuring data structures , 1998, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225).

[2]  Moti Yung,et al.  Non-interactive cryptocomputing for NC/sup 1/ , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[3]  Joan Feigenbaum,et al.  Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? , 1985, CRYPTO.

[4]  Martín Abadi,et al.  On hiding information from an oracle , 1987, STOC '87.

[5]  Christian S. Collberg,et al.  On the Limits of Software Watermarking , 1998 .

[6]  Christian F. Tschudin,et al.  Towards mobile cryptography , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[7]  David Aucsmith,et al.  Tamper Resistant Software: An Implementation , 1996, Information Hiding.

[8]  Joan Feigenbaum,et al.  Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract) , 1990, CRYPTO.

[9]  Fred B. Schneider,et al.  Towards Fault-Tolerant and Secure Agentry , 1997, WDAG.

[10]  Clark Thomborson,et al.  Manufacturing cheap, resilient, and stealthy opaque constructs , 1998, POPL '98.