252 search results - page 1 / 51 » Computationally secure two-round authenticated message excha... |
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CCS
2010
ACM
13 years 11 months ago
2010
ACM
ICICS
2010
Springer
13 years 2 months ago
2010
Springer
With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of su...
ADHOC
2007
13 years 4 months ago
2007
Password authentication has been accepted as one of the commonly used solutions in network environment to protect resources from unauthorized access. The emerging mobile Ad hoc ne...