150 search results - page 10 / 30 » Oblivious Transfer Is Symmetric |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
TCC
2004
Springer
14 years 25 days 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...
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...
DAGSTUHL
2006
13 years 9 months ago
2006
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...