Efficient and Scalable Universal Circuits

Author:

Alhassan Masaud Y.,Günther Daniel,Kiss Ágnes,Schneider Thomas

Abstract

AbstractA universal circuit (UC) can be programmed to simulate any circuit up to a given size n by specifying its program inputs. It provides elegant solutions in various application scenarios, e.g., for private function evaluation (PFE) and for improving the flexibility of attribute-based encryption schemes. The asymptotic lower bound for the size of a UC is $$\Omega (n\log n)$$Ω(nlogn), and Valiant (STOC’76) provided two theoretical constructions, the so-called 2-way and 4-way UCs (i.e., recursive constructions with 2 and 4 substructures), with asymptotic sizes $${\sim }\,5n\log _2n$$5nlog2n and $${\sim }\,4.75n\log _2n$$4.75nlog2n, respectively. In this article, we present and extend our results published in (Kiss and Schneider EUROCRYPT’16) and (Günther et al. ASIACRYPT’17). We validate the practicality of Valiant’s UCs by realizing the 2-way and 4-way UCs in our modular open-source implementation. We also provide an example implementation for PFE using these size-optimized UCs. We propose a 2/4-hybrid approach that combines the 2-way and the 4-way UCs in order to minimize the size of the resulting UC. We realize that the bottleneck in universal circuit generation and programming becomes the memory consumption of the program since the whole structure of size $${\mathcal {O}}(n\log n)$$O(nlogn) is handled by the algorithms in memory. In this work, we overcome this by designing novel scalable algorithms for the UC generation and programming. Both algorithms use only $${\mathcal {O}}(n)$$O(n) memory at any point in time. We prove the practicality of our scalable design with a scalable proof-of-concept implementation for generating Valiant’s 4-way UC. We note that this can be extended to work with optimized building blocks analogously. Moreover, we substantially improve the size of our UCs by including and implementing the recent optimization of Zhao et al. (ASIACRYPT’19) that reduces the asymptotic size of the 4-way UC to $${\sim }\,4.5n\log _2n$$4.5nlog2n. Furthermore, we include their optimization in the implementation of our 2/4-hybrid UC which yields the smallest UC construction known so far.

Funder

Technische Universität Darmstadt

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Reference72 articles.

1. M. Abadi, J. Feigenbaum, Secure circuit evaluation. J. Cryptology. 2(1), 1–12 (1990)

2. G. Asharov, Y. Lindell, T. Schneider, M. Zohner, More efficient oblivious transfer and extensions for faster secure computation, in CCS’ 13. (ACM, 2013), pp. 535–548

3. A. Afshar, P. Mohassel, B. Pinkas, B. Riva, Non-interactive secure computation based on cut-and-choose, in EUROCRYPT’14. LNCS, vol. 8441 (Springer, 2014), pp. 387–404

4. N. Attrapadung, Fully secure and succinct attribute based encryption for circuits from multi-linear maps. Cryptology ePrint Archive, Report 2014/772, (2014). https://ia.cr/2014/772

5. O. Biçer, M. A. Bingöl, M. S. Kiraz, Highly efficient and reusable private function evaluation with linear complexity. Cryptology ePrint Archive, Report 2018/515, (2018) https://ia.cr/2018/515

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. PFE: Linear Active Security, Double-Shuffle Proofs, and Low-Complexity Communication;Lecture Notes in Computer Science;2024

2. Rescue to the Curse of universality;Science China Information Sciences;2023-08-02

3. Arbitrary-size permutation networks using arbitrary-radix switches;Theoretical Computer Science;2023-06

4. Breaking the Size Barrier: Universal Circuits Meet Lookup Tables;Advances in Cryptology – ASIACRYPT 2023;2023

5. Generic 2-Party PFE with Constant Rounds and Linear Active Security, and Efficient Instantiation;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3