37 search results - page 3 / 8 » Secure Multi-party Computation Minimizing Online Rounds |
COLT
2008
Springer
13 years 7 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
TCC
2007
Springer
13 years 11 months 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...
IACR
2011
12 years 4 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...