Practical implementation of lattice-based program obfuscators for point functions

Document Type

Conference Proceeding

Publication Date

9-12-2017

Abstract

Lattice-based cryptography has recently produced several time-efficient cryptosystems that are provably secure under assumptions that are not known to be more easily solvable by quantum computers. An interesting research direction is improving their storage complexity, as current solutions are far from practical with respect to this metric. In this paper we show that program obfuscators for point functions based on lattice theory which are time-efficient, storage-efficient, and provably secure under studied modifications of assumptions commonly studied in lattice-based cryptography (i.e., LWE and LWR assumptions). Point function obfuscators have recently been shown to be the first examples of program obfuscators provable under hardness assumptions commonly used in cryptography. Point functions can be seen as functions that return 1 if the input value is equal to a secret value stored in the program, and 0 otherwise. Notable implementation results due to our design and coding optimizations are: (a) a point function obfuscator based on a modified LWR assumption with running time 0.01s and storage less than 100B, and (b) a point function obfuscator based on modified LWE assumption with running time 0.2s and storage less than 35KB, both using commodity computing resources.

Identifier

85032364144 (Scopus)

ISBN

[9781538632505]

Publication Title

Proceedings 2017 International Conference on High Performance Computing and Simulation Hpcs 2017

External Full Text Location

https://doi.org/10.1109/HPCS.2017.115

First Page

761

Last Page

768

Grant

W911NF-15-C-0233

Fund Ref

Army Research Office

This document is currently not available here.

Share

COinS