منابع مشابه
Oblivious Lookup Tables
We consider the following question: given a group-homomorphic public-key encryption E, a ciphertext c = E(x, pk) hiding a value x using a key pk, and a ”suitable” description of a function f , can we evaluate E(f(x), pk) without decrypting c? We call this an oblivious lookup table and show the existence of such a primitive. To this end, we describe a concrete construction, discuss its security ...
متن کاملIterating Lookup Tables Efficiently
We show that every function f implemented as a lookup table can, by increasing the storage space by a small constant factor, be implemented such that the computational complexity of evaluating fm(x) is small independently of m and x.
متن کاملLevel compressed DAGs for lookup tables
Trie-based data structures for implementing IP lookups have attracted considerable research aUention. Techniques such as path compression, level compression, generalized level compression, and controlled prefix expansion are commonly used to implement lookup tables. [0 this paper, we present a fundamentally new technique that relies on directed acyclic graphs (DAGs). which, when coupled with ge...
متن کاملFaster Mask Conversion with Lookup Tables
Masking is an effective and widely-used countermeasure to thwart Differential Power Analysis (DPA) attacks on symmetric cryptosystems. When a symmetric cipher involves a combination of Boolean and arithmetic operations, it is necessary to convert the masks from one form to the other. There exist algorithms for mask conversion that are secure against first-order attacks, but they can not be gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra Mountains Mathematical Publications
سال: 2016
ISSN: 1210-3195
DOI: 10.1515/tmmp-2016-0039