490 search results - page 5 / 98 » Impossibilities for roommate problems |
EUROCRYPT
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
CALCO
2007
Springer
14 years 1 months ago
2007
Springer
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
DAGSTUHL
2006
13 years 9 months ago
2006
The problem of prediction future event given an individual sequence of past events is considered. Predictions are given in form of real numbers pn which are computed by some algori...
EUROCRYPT
1999
Springer
13 years 11 months ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
CP
2006
Springer
13 years 9 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...