18 search results - page 1 / 4 » On the Efficiency of Classical and Quantum Oblivious Transfe... |
CRYPTO
2010
Springer
13 years 5 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...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
TCC
2004
Springer
13 years 9 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...
SIAMCOMP
2008
13 years 2 months ago
2008
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 oblivio...
TCC
2009
Springer
14 years 4 months ago
2009
Springer
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...