62 search results - page 2 / 13 » Classical Knowledge for Quantum Security |
CRYPTO
2010
Springer
13 years 6 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...
FOCS
2009
IEEE
14 years 2 days ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
FSTTCS
2005
Springer
13 years 11 months ago
2005
Springer
We construct a formal framework for investigating epistemic and temporal notions in the context of distributed quantum systems. While we rely on structures developed in [DDKP05], w...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
ACMSE
2006
ACM
13 years 9 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...