Publication

Stealth Announces New Result on Trapdoor Functions at EUROCRYPT ’19

As part of the PULSAR project, Stealth team member Sanjam Garg (Berkeley), in collaboration with Romain Gay (ENS) and Mohammad Hajiabadi (Berkeley), presented their work “New Techniques for Efficient Trapdoor Functions and Applications” at EUROCRYPT 2019.  A link to the corresponding publication (in the conference proceedings) can be found here.

Stealth Announces New Result on Private Anonymous Data Access at EUROCRYPT ’19

As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky, in collaboration with Ariel Hamlin (NEU), Mor Weiss (NEU and IDC), and Daniel Wichs (NEU), presented their work “Private Anonymous Data Access” at EUROCRYPT 2019.  A link to the corresponding publication (in the conference proceedings) can be found here.

Stealth Announces Three New Results on Cryptographic Primitives at TCC ’18

We are proud to announce three new publications at the 2018 Theory of Cryptography Conference. As part of the PULSAR project, Stealth team member Sanjam Garg (Berkeley) and collaborators presented their work “Registration-Based Encryption: Removing Private-Key Generator from IBE”, which can be found here. Stealth Co-Founder Rafail Ostrovsky (UCLA) and Wutichai Chongchitmate (Chulalongkorn) presented their …

Stealth Announces Three New Results on Cryptographic Primitives at TCC ’18 Read More »

Stealth Announces New Result on Secure Computation at ASIACRYPT ’18

As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky (UCLA), in collaboration with Saikrishna Badrinarayanan (UCLA), Abhishek Jain (JHU), and Ivan Visconti (Salerno), presented their work for “Non-interactive Secure Computation from One-Way Functions” at ASIACRYPT 2018.  A link to the corresponding publication, can be found here.

Stealth Announces New Result on Secure Computation at SCN ’18

As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky (UCLA), in collaboration with Karim Eldefrawy (SRI), Sunoo Park (MIT) and Moti Yung (Columbia), presented their work for “Proactive Secure Multiparty Computation with a Dishonest Majority” at the 2018 Security and Cryptography for Networks Conference.  A link to the corresponding publication, can be found here.

Stealth Announces Four New Results in Secure Computation at CRYPTO ’18

We are happy to announce four new publications at the CRYPTO 2018 conference. As part of the PULSAR project, team member Jonathan Katz (UMD), together with collaborators Samuel Ranellucci (UMD), Mike Rosulek (Oregon State), and Xiao Wang (UMD), presented their work on “Optimizing Authenticated Garbling for Faster Secure Two-Party Computation”, which can be found here.   …

Stealth Announces Four New Results in Secure Computation at CRYPTO ’18 Read More »

Stealth Co-Founder Rafail Ostrovsky presents his work on non-malleable codes at CRYPTO ’18

As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky, in collaboration with Giuseppe Persiano (Salerno), Daniele Venturi (Sapienza), and Ivan Visconti (Salerno), presented their research on the “Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions” at CRYPTO 2018.  A link to the corresponding publication, can be found here.

Stealth Co-Founder Rafail Ostrovsky and Dr. Steve Lu Receive Best Paper Award at KSCO ’17

Congratulations to Stealth co-founder Rafail Ostrovsky and Dr. Steve Lu and their co-authors for receiving the Best Paper award at Knowledge Systems for Coalition Operations (KSCO 2017) for their paper: Privacy Technologies for Controlled Information Sharing in Coalition Operations.  This paper, part of the PULSAR project, considers how advanced privacy technologies can enable improved information …

Stealth Co-Founder Rafail Ostrovsky and Dr. Steve Lu Receive Best Paper Award at KSCO ’17 Read More »

Stealth Announces a New ZK Result at CCS ’17

As part of the PULSAR project, Scott Ames (Univ. Rochester), Carmit Hazay (BIU), Yuval Ishai (Technion), Muthuramakrishnan Venkitasubramaniam (Univ. Rochester) presented “Ligero: Lightweight Sublinear Arguments Without a Trusted Setup” at CCS 2017.  A link to the corresponding publication (in the conference proceedings) can be found here.