Graph-induced multilinear maps from lattices
WebThe construction combines the graph-induced multilinear maps by Gentry, Gorbunov and Halevi [GGH15], their candidate obfuscator, and the lattice-based PRFs of [BPR12,BLMR13]. At the heart of our technical contribution is identifying a restricted (yet still powerful) variant of the GGH15 maps, whose security can be reduced to LWE. WebThis work describes a new graph-induced multilinear encoding scheme from lattices, which encodes Learning With Errors samples in short square matrices of higher dimensions and requires making new hardness assumptions. 237 PDF Fully Secure Functional Encryption without Obfuscation Sanjam Garg, Craig Gentry, S. Halevi, Mark Zhandry
Graph-induced multilinear maps from lattices
Did you know?
WebMar 23, 2015 · In this work, we describe a new graph-induced multilinear encoding scheme from lattices. In a graph-induced multilinear encoding scheme the arithmetic … Webconstruction of graph-induced multilinear maps does not rely on ideal lattices or hard-to-factor integers. Rather, we use standard random lattices such as those used in LWE …
WebMar 23, 2015 · [PDF] Graph-Induced Multilinear Maps from Lattices Semantic Scholar This work describes a new graph-induced multilinear encoding scheme from lattices, … WebThe graph for 3 parties is illustrated in Figure 1. A 0 A 1;1 A 1;2 A 1;3 12; 3 A 3;1 A 3;2 A 3;3 s 1 s 2 s 3 s 3 s 1 s 2 s 2 s 3 s1 Fig.1. Graph for a 3-partite key-agreement protocol with GGH15 multilinear maps. On the i-th chain, Party iwill then be able to multiply these encodings (the one he kept secret and the ones published by the other ...
WebJul 10, 2015 · Graph-Induced Multilinear Maps From Lattices Abstract Graded multilinear encodings have found extensive applications in cryptography ranging from non … WebIn this work, we describe a new graphinduced multilinear encoding scheme from lattices. In a graph-induced multilinear encoding scheme the arithmetic operations that are allowed are restricted through an explicitly defined directed graph (somewhat similar to the “asymmetric variant” of previous schemes).
WebAn Alternative View of the Graph-Induced Multilinear Maps Yilei Chen February 29, 2016 Abstract In this paper, we view multilinear maps through the lens of “homomorphic obfuscation”. In specific, we show how to homomorphically obfuscate the kernel-test and affine subspace-test functionalities of high dimensional matrices.
WebGraph-Induced Multilinear Maps from Lattices Craig Gentry IBM Sergey Gorbunov MIT Shai Halevi IBM November 11, 2014 Abstract Graded multilinear encodings have found … fk1 to fk5WebIn a graph-induced multilinear encoding scheme the arithmetic operations that are allowed are restricted through an explicitly defined directed graph (somewhat similar to the … cannot find name filereaderWebGraph-induced multilinear maps from lattices. C Gentry, S Gorbunov, S Halevi. ... Leveled fully homomorphic signatures from standard lattices. S Gorbunov, V Vaikuntanathan, D Wichs. Proceedings of the forty-seventh annual ACM symposium on Theory of computing ... fk225at weightfk209 tciWebMultilinear Maps (MMAPs) A very powerful crypto tool. Enables computation on “hidden data” Similar to homomorphic encryption (HE) But HE is too “all or nothing” No key: … fk1 to g66WebThis paper builds a general framework, called 5Gen, to experiment with secure multilinear maps, and develops a compiler that takes in a high-level program and produces an optimized matrix branching program needed for the applications the authors consider. Secure multilinear maps (mmaps) have been shown to have remarkable applications in … fk1 to fk2WebAug 11, 2013 · We describe a new graph-induced multilinear maps from lattices and show how it can be used to construct a candidate general purpose program obfuscator. Our construction uses standard (random ... cannot find name htmlelement