I need to know about any relevant papers/stuff or and research carried out in the field of cryptography / security on an encrypted non-tamper-able Look up Table. The table can be considered as a black box given input, corresponding to the mapped entries it will return the output. Also, black box is in access of an adversary to make queries of its choice in a security game.
I have searched and worked out on many possible solutions but still all in vain, none of them provides both security and functionality.
In matlab and visual C++ we can built standalone (executable file) given input it will return output with no one knowing about whats embedded in the black box. Any one can query this black box with input without knowing the inside functionality. But I have read on their developer forums that executable files created by them are not secure. Any one can break it, moreover we cant prove the security of these sort of standalone exe's.
I have read papers on predicate / searchable encryption for making up an encrypted look up table and then querying it with token's; but this concept does not work under all conditions and the involved computations are too much.
Any other who came across papers addressing this issue or a generic approach to tackle this if I missed something pertaining to it.
Here is a reading list for you.
https://scholar.google.com/scholar?q=Encrypted+Lookup+Table+-chaotic
Oblivious Lookup Tables (OLUT) might be something for you, probably in connection with homomorphic signatures. Note that anyone who can query the LUT can learn parts of it. If the LUT is encrypted, the client needs a means of decrypting the answers. So anyone who has black-box access to the table and can query it, can "circumvent" the protection given by encryption.
Here's the OLUT preprint https://www.researchgate.net/publication/275896885_Oblivious_Lookup_Tables -- full Version is due to be published soon.
Article Oblivious Lookup Tables
- Badges
- Science topic