Publication

As part of the PULSAR project, team member Sanjam Garg (Berkeley) and collaborators presented their work “Master-Key KDM-Secure IBE from Pairings” on advances Identity Based Encryption at IACR’s Public Key Conference 2020. This work is producing Identity-based encryption (a public-key scheme where the public key can be a user’s identity) that achieve key-dependent-message security with …

Stealth Announces New Results in Cryptography at PKC ’20 Read More »

As part of the PANTHEON project, Stealth co-founder Rafail Ostrovsky, in collaboration with Ran Gelles and Alan Roytman, published their work for “Efficient Error-Correcting Codes for Sliding Windows” in the 34th Volume of the SIAM Journal on Discrete Mathematics.  A link to the corresponding publication, can be found here.

As part of the PANTHEON project, David Darais (UVM), Ian Sweet (UMD), Chang Liu (Citadel), and Michael Hicks (UMD) published their research on “A language for probabilistically oblivious computation” at the 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019).  A link to the corresponding publication (in the conference proceedings) can be found …

Stealth Announces New Result in Oblivious Comptuation at POPL ’19 Read More »

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 …

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

As part of the PULSAR project, team member Sanjam Garg (Berkeley) and collaborators presented their work “Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles” at the 2019 Theory of Cryptography Conference.  A link to the corresponding publication (in the conference proceedings) can be found here.  Stealth co-founder Rafail Ostrovsky and collaborators presented their work …

Stealth Announces Two New Results on Secure Computation at TCC ’19 Read More »

We are happy to announce two publications at the 18th ACM Workshop on Privacy in the Electronic Society in 2019. As part of the DURASIFT project, Stealth team members Brett Hemenway Falk (UPenn), Steve Lu (Stealth), and Rafail Ostrovsky (UCLA) presented their work on “DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex …

Stealth Announces Two New Results on Secure Databases and Private Set Intersection at WPES ’19 Read More »

As part of the PANTHEON project, team members David Darais (UVM), Joseph P. Near (UVM), and collaborators presented their findings on the develop of a new programming language to express differentially private computations in the Proceedings of the ACM on Programming Languages. In this work they present “Duet: an expressive higher-order language, linear type system …

Stealth Announces New Result in Differential Privacy Language at OOPSLA ’19 Read More »

As part of the PULSAR and PANTHEON projects, Stealth team member Vassilis Zikas (Edinburgh), in collaboration with Maksim Tsikhanovich (Amazon and Edinburgh), Malik Magdon-Ismail (Edinburgh), and Muhammad Ishaq (Edinburgh), presented their work on “PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography” at the 2019 Information Security Conference.  A link to the corresponding publication (in the …

Stealth Announces New Result in Privacy-preserving Machine Learning at ISC ’19 Read More »

As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky (UCLA), in collaboration with Melissa Chase (Microsoft), Yevgeniy Dodis (NYU), Yuval Ishai (Technion), Daniel Kraschewski (TNG), Tianren Liu (MIT), and Vinod Vaikuntanathan (MIT), presented their work for “Reusable Non-Interactive Secure Computation” at CRYPTO 2019.  A link to the corresponding publication, can be found here.

As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky, in collaboration with Nishanth Chandran (Microsoft), Wutichai Chongchitmate (Chulalongkorn), and Ivan Visconti (Salerno), presented their research on the “Universally Composable Secure Computation with Corrupted Tokens” at CRYPTO 2019.  A link to the corresponding publication, can be found here.