1562 search results - page 27 / 313 » Mathematics, Cryptology, Security |
211
click to vote
TCC
2007
Springer
16 years 1 days ago
2007
Springer
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...
121
click to vote
CTRSA
2001
Springer
15 years 10 months ago
2001
Springer
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)
155
Voted
CTRSA
2006
Springer
15 years 9 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
143
click to vote
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
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...