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

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 for “Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND” at the same conference and a link to the corresponding publication, can be found here.