102 search results - page 6 / 21 » Perfectly Secure Multiparty Computation and the Computationa... |
TCC
2009
Springer
15 years 10 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
To better protect information systems, computation time data protection needs to be considered such that even when the system is partially compromised, the security of the system ...
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
TCC
2004
Springer
15 years 3 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...