Stealth Announces Four New Results on Secure Computation at ASIACRYPT ’19

We are happy to announce four new publications at the 2019 ASIACRYPT conference.

As part of the PULSAR project, team member Sanjam Garg (Berkeley), in collaboration with Aarushi Goel (JHU) and Abhishek Jain (JHU), presented their work on “The Broadcast Message Complexity of Secure Multiparty Computation”, which can be found here. Prof. Garg and collaborators also published  “Rate-1 Trapdoor Functions from the Diffie-Hellman Problem”, which can be found here.

As part of the PANTHEON project, Stealth co-founder Rafail Ostrovsky (UCLA), in collaboration with Saikrishna Badrinarayanan (UCLA), Abhishek Jain (JHU), and Ivan Visconti (Salerno), presented their work for “UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens” and a link can be found here. Vladimir Kolesnikov (Georgia Tech), Mike Rosulek (Oregon State), Ni Trieu (Oregon State), and Xiao Wang (NWU), presented their work on “Scalable Private Set Union from Symmetric-Key Techniques”, which can be found here.