27 search results - page 6 / 6 » stoc 1996 |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
IACR
2011
12 years 4 months ago
2011
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...