Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm
Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm
复制标题
DOI：
10.1007/978-3-030-03810-6_17
复制
发表时间：
2018-11
期刊：
影响因子：
--
通讯作者：
P. Ananth;Alex Lombardi
中科院分区：
文献类型：
--
作者：
P. Ananth;Alex Lombardi
我们研究了一个模拟范例，称为本地模拟，在乱码计划。该范例捕获了仿真证明策略，其中仿真器由许多本地仿真器组成，这些本地仿真器生成混淆电路的不同块。这样的仿真策略的一个有用的属性是，只有少数这些本地仿真器依赖于输入，而其余的本地仿真器只依赖于circuit.We形式化定义本地仿真乱码计划这一概念。通过适当地实现这一概念，我们给出了一个新的构造简洁的乱码计划图灵机假设的多项式硬度紧凑的功能加密和标准的假设（如CDH或LWE）。简洁的乱码方案的先前构造要么假设紧函数加密的次指数硬度，要么仅针对小空间Turing machine.We还表明，局部可模拟的乱码方案的变体可以用于一般地获得自适应安全的电路乱码方案。所有先前使用模糊加密的自适应安全乱码的构造都可以被视为我们构造的实例。
We study a simulation paradigm, referred to aslocal simulation, in garbling schemes. This paradigm captures simulation proof strategies in which the simulator consists of many local simulators that generate different blocks of the garbled circuit. A useful property of such a simulation strategy is that only a few of these local simulators depend on the input, whereas the rest of the local simulators only depend on the circuit.We formalize this notion by defining locally simulatable garbling schemes. By suitably realizing this notion, we give a new construction of succinct garbling schemes for Turing machines assuming the polynomial hardness of compact functional encryption and standard assumptions (such as either CDH or LWE). Prior constructions of succinct garbling schemes either assumed sub-exponential hardness of compact functional encryption or were designed only for small-space Turing machines.We also show that a variant of locally simulatable garbling schemes can be used to generically obtain adaptively secure garbling schemes for circuits. All prior constructions of adaptively secure garbling that use somewhere equivocal encryption can be seen as instantiations of our construction.