100 search results - page 3 / 20 » Alice and Bob |
CIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
NDSS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present protocols that allow a user Alice, knowing only her name and password, and not carrying a smart card, to "log in to the network" from a "generic" wo...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—We investigate a quasi-trusted QKD relaying model. This is a three-party communication model. Two nodes Alice and Bob want to establish a secret key. However, the distance betwe...
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...