Oblivious Lookup-Tables
Author:
Wamser Markus Stefan1, Rass Stefan2, Schartner Peter2
Affiliation:
1. Lehrstuhl für Sicherheit, in der Informationstechnik, Technische Universitäat München, Arcisstraße 21, D–80333 München, Germany 2. Institut für Angewandte Informatik, Alpen-Adria-Universität Klagenfurt, Universitätsstrasse 65-67, A–9020 Klagenfurt, Austria
Abstract
Abstract
Evaluating arbitrary functions on encrypted data is one of the holy grails of cryptography, with Fully Homomorphic Encryption (FHE) being probably the most prominent and powerful example. FHE, in its current state is, however, not efficient enough for practical applications. On the other hand, simple homomorphic and somewhat homomorphic approaches are not powerful enough to support arbitrary computations.
We propose a new approach towards a practicable system for evaluating functions on encrypted data. Our approach allows to chain an arbitrary number of computations, which makes it more powerful than existing efficient schemes. As with basic FHE we do not encrypt or in any way hide the function, that is evaluated on the encrypted data. It is, however, sufficient that the function description is known only to the evaluator. This situation arises in practice for software as a Software as a Service (SaaS)-scenarios, where an evaluator provides a function only known to him and the user wants to protect his data. Another application might be the analysis of sensitive data, such as medical records.
In this paper we restrict ourselves to functions with only one input parameter, which allow arbitrary transformations on encrypted data.
Publisher
Walter de Gruyter GmbH
Subject
General Mathematics
Reference13 articles.
1. [1] ARMKNECHT, F.—AUGOT, D.—PERRET, L.—SADEGHI, A.-R.: On constructing homomorphic encryption schemes from coding theory, Cryptology ePrint Archive, Report 2011/309, June 2011. 2. [2] ARMKNECHT, F.—KATZENBEISSER, S.—PETER, A.: Group homomorphic encryption: characterizations, impossibility results, and applications, Cryptology ePrint Archive, Report 2010/501, 2010, http://eprint.iacr.org/ 3. [3] ARMKNECHT, F.—KATZENBEISSER, S.—PETER, A.: Shift-type homomorphic encryption and its application to fully homomorphic encryption, in: Progress in Cryptology—AFRICACRYPT ’12, 5th Internat. Conf. on Cryptology in Africa (A. Mitrokotsa and S. Vaudenay, eds.), Ifrance, Morocco, 2012, Springer-Verlag, Berlin, 2012, pp. 234–251. 4. [4] DAMGÅRD, I.: Towards practical public key systems secure against chosen ciphertext attacks, in: Advances in Cryptology—CRYPTO ’91 (J. Feigenbaum, ed.), Lecture Notes in Comput. Sci., Vol. 576, Springer-Verlag, Berlin, 1992, pp. 445–456. 5. [5] GENTRY, C.: Computing arbitrary functions of encrypted data, Commun. ACM 53 (2010), 97–105.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|