青年学者学术报告《valiant's universal circuits revisited: an overall improvement and a lower bound》-j9登录网址

 青年学者学术报告《valiant's universal circuits revisited: an overall improvement and a lower bound》-j9登录网址
欢迎访问江苏省计算机学会网站!      |  
j9登录网址
 当前位置j9登录网址 > 新闻中心 > j9登录网址的公告
新闻中心  
党建工作
学会动态
政策法规
行业新闻
图片新闻
j9登录网址的公告
学会通讯
 
j9登录网址的公告
青年学者学术报告《valiant's universal circuits revisited: an overall improvement and a lower bound》
发布时间:2019-09-26

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

要:

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)
j9登录网址的友情链接:
              
   
 

j9登录网址 copyright (c) j9登录网址的版权所有 江苏省计算机学会          
秘书处办公室       地址: 江苏省南京市仙林大道163号  邮编:210023   电话/传真:025-89680909   
秘书处市内联络点   地址: 江苏省南京市汉口路22号     邮编:210093   电话/传真:025-86635622
电子邮箱:[email protected]   网址:www.jscs.org.cn    j9登录网址的技术支持:  

网站备案号:   公安备案号:

您是本站第73317527位来客!

网站地图