250 search results - page 9 / 50 » A Round and Communication Efficient Secure Ranking Protocol |
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
ICITA
2005
IEEE
14 years 1 months ago
2005
IEEE
Security protocols are indispensable in secure communication. We give an operational semantics of security protocols in terms of a Prolog-like language. With this semantics, we ca...
INFOCOM
2012
IEEE
12 years 6 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper, we propose a mutual authentication and key agreement scheme for V2I communications. Our scheme improves security and privacy protection compared with the existing...