学术报告|Scalable Private Set Union: Faster and More Secure

admin 2023年6月18日21:56:49评论18 views字数 2100阅读7分0秒阅读模式

浙江大学网络空间安全学院

学术报告



学术报告|Scalable Private Set Union: Faster and More Secure

Hong-Sheng Zhou

Associate Professor
Virginia Commonwealth University


Scalable Private Set Union: Faster and More Secure 

2023年6月19日(周一)15:00-16:00

浙江大学科创中心9号楼-9356-2

腾讯会议:856-766-467

  摘 要  

A Private Set Union (PSU) protocol allows parties, each holding an input set, to jointly compute the union of the input datasets without revealing anything else. We have found numerous applications in practice; however, not much research has been carried out so far, especially for large datasets.

In this talk, I will present our recent research findings in a USENIX Sec '22 paper: we take shuffling technique as a key to design PSU protocols for the first time. Our result outperforms the state-of-the-art design by Kolesnikov et al. (ASIACRYPT 2019) in both efficiency and security; certain unnecessary leakage in Kolesnikov et al.’s design, can be avoided in our design. 

I will next report our results in an ongoing project: through a systematical investigation of PSU designs in literature, we show that unnecessary information leakage occurs in *all* existing scalable PSU. We then provide the first scalable PSU with best possible security in the semi-honest setting. 

This is based on joint work with Yanxue Jia, Shi-Feng Sun, Dawu Gu and Jiajun Du.


  报告人简介  

Hong-Sheng Zhou is an Associate Professor in the Computer Science Department at Virginia Commonwealth University. He was a postdoc at Maryland Cybersecurity Center under the direction of Jonathan Katz. Before that, he received his PhD at the University of Connecticut with Aggelos Kiayias as advisor. 

Hong-Sheng is interested in a wide range of topics in modern cryptography including Secure Multi-Party Computation, Blockchain Technologies, Zero-Knowledge Proofs and many more. He investigates cryptographic primitives and protocols in the complex environments aiming to achieve strong security guarantees including Composability, Leakage / Tampering / Subversion Resilience, Coercion Resilience, Fairness and Quantum Resilience. He has published a number of papers in top cryptography, security and distributed computing conferences, such as CRYPTO, EUROCRYPT, ASIACRYPT, ACM CCS, USENIX Security, and ACM PODC. Hong-Sheng was a recipient of an NSF Computing Innovation Fellowship and a Google Faculty Research Award. His research has been funded by NSF and multiple industry research gifts. 


学术报告|Scalable Private Set Union: Faster and More Secure

更多学院动态

欢迎关注



学术报告|Scalable Private Set Union: Faster and More Secure


原文始发于微信公众号(浙大网安):学术报告|Scalable Private Set Union: Faster and More Secure

  • 左青龙
  • 微信扫一扫
  • weinxin
  • 右白虎
  • 微信扫一扫
  • weinxin
admin
  • 本文由 发表于 2023年6月18日21:56:49
  • 转载请保留本文链接(CN-SEC中文网:感谢原作者辛苦付出):
                   学术报告|Scalable Private Set Union: Faster and More Securehttps://cn-sec.com/archives/1816066.html

发表评论

匿名网友 填写信息