250 search results - page 3 / 50 » A Round and Communication Efficient Secure Ranking Protocol |
JCP
2006
13 years 7 months ago
2006
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also pr...