In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
a revised version of the extended abstract which appeared in The Cryptographers’ Track at RSA Conference ’2001 (8 – 12 april 2001, San Francisco, California, USA)
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...