64 search results - page 8 / 13 » Secure multi-party quantum computation |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
AC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
EUROCRYPT
2005
Springer
14 years 27 days ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...