90 search results - page 8 / 18 » Improved Primitives for Secure Multiparty Integer Computatio... |
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
SIGOPS
2011
13 years 2 months ago
2011
Secure, fault-tolerant distributed systems are difficult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault toleran...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
CCS
2009
ACM
14 years 2 months ago
2009
ACM
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...