Sciweavers

65 search results - page 12 / 13
» Efficient Client-to-Client Password Authenticated Key Exchan...
Sort
View
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
13 years 9 months ago
Secure Identification and QKD in the Bounded-Quantum-Storage Model
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
INFOCOM
1998
IEEE
13 years 10 months ago
Compact and Unforgeable Key Establishment over an ATM Network
Authenticated session key establishment is a central issue in network security. This paper addresses a question on whether we can design a compact, efficient and authenticated key ...
Yuliang Zheng, Hideki Imai
STOC
1999
ACM
122views Algorithms» more  STOC 1999»
13 years 10 months ago
Oblivious Transfer and Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
Moni Naor, Benny Pinkas
JUCS
2008
149views more  JUCS 2008»
13 years 5 months ago
Formal Security Definition and Efficient Construction for Roaming with a Privacy-Preserving Extension
: In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages ex...
Guomin Yang, Duncan S. Wong, Xiaotie Deng
CCS
2009
ACM
14 years 6 months ago
Authenticated wireless roaming via tunnels: making mobile guests feel at home
In wireless roaming a mobile device obtains a service from some foreign network while being registered for the similar service at its own home network. However, recent proposals tr...
Mark Manulis, Damien Leroy, François Koeune...