欢迎访问江苏省计算机学会网站!    设为首页  |  收藏本站
江苏省计算机学会
  •  当前位置首页 > 新闻中心 > 通知公告
    新闻中心  
    党建工作
    学会动态
    政策法规
    行业新闻
    图片新闻
    通知公告
    学会通讯
     
    通知公告
    青年学者学术报告《Valiant's Universal Circuits Revisited: an Overall Improvement and a Lower Bound》
    发布时间:2019-09-26 15:11:13

    南京大学计算机软件新技术国家重点实验室

    要:

    A universal circuit (UC) is a general-purpose circuit that can simulate arbitrary circuits (up to a certain size n). At STOC 1976 Valiant presented a graph theoretic approach to the construction of UCs, where a UC is represented by an edge universal graph (EUG) and is recursively constructed using a dedicated graph object (referred to as supernode). As a main end result, Valiant constructed a 4-way supernode of size 19 and an EUG of size 4.75nlogn (omitting smaller terms), which remained the most size-efficient even to this day (after more than 4 decades).

    Motivated by the emerging applications of UCs in various privacy preserving computation scenarios, we revisit Valiant's universal circuits, and propose a size-optimal 4-way supernode of size 18, and an EUG of size 4.5nlogn. As confirmed by implementations, we reduce the size of universal circuits (and the number of AND gates) by more than 5% in general (rather than just for small-size circuits in particular), and thus improve upon the efficiency of UC-based cryptographic applications accordingly. Our approach to the design of optimal supernodes is computer aided (rather than by hand as in previous works), which might be of independent interests. As a complement, we give lower bounds on the size of EUGs and UCs in Valiant's framework, which significantly improves upon the generic lower bound on UC size and therefore reduces the gap between theory and practice of universal circuits.

    报告人简介:

    Yu Yu is a professor in Department of Computer Science and Engineering, Shanghai Jiaotong University. He earned his BS degree from Fudan University and PhD degree from Nanyang Technological University in 2006. He was a postdoctoral fellow at University of Leuven, Belgium. His research interests include foundations of cryptography, post-quantum cryptography, privacy-preserving computing, etc. His research results mostly appear in top crypto/information security venues, such as CRYPTO, EUROCRYPT, ASIACRYPT, IEEE S&P (Oakland), CCS, TCC. He has served as a member of the program committee of EUROCRYPT, ASIACRYPT, CCS, etc., a member of the steering committee of ASIACRYPT and an observer of the International Cryptography Society Council..

    时间:927   9:30-10:30

    地点:计算机科学技术楼225

    上一篇:学术报告《GPU-based Computing for Real-Time Scheduling》
    下一篇:CSAI 卓越科学家大讲堂系列学术报告From Feedforward-Designed Convolutional Neural Networks (FF-CNNs) to Successive Subspace Learning (SSL)
    友情链接:
    江苏省科学技术协会 中国计算机学会 南京大学 南京大学计算机科技与技术系 南京大学软件学院 东南大学计算机科学与工程学院 江苏经贸职业技术学院 南京信息职业技术学院 南京工业职业技术学院 江苏海事职业技术学院 常州信息职业技术学院 国网电力科学研究院 电子科技集团第28研究所 江南计算技术研究所 
       
     

    Copyright (c) 版权所有 江苏省计算机学会          南京网站建设公司
    秘书处办公室       地址: 江苏省南京市仙林大道163号  邮编:210023   电话/传真:025-89680909   
    秘书处市内联络点   地址: 江苏省南京市汉口路22号     邮编:210093   电话/传真:025-86635622
    电子邮箱:jscs@nju.edu.cn   网址:www.jscs.org.cn    技术支持:南京成旭通信息技术有限公司  

    网站备案号:苏ICP备14049275号-1

    您是本站第32028094位来客!