Sciweavers

250 search results - page 19 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 9 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
13 years 11 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako
PPL
2002
108views more  PPL 2002»
13 years 7 months ago
An Efficient Implementation of the BSP Programming Library for VIA
Virtual Interface Architecture(VIA) is a light-weight protocol for protected user-level zero-copy communication. In spite of the promised high performance of VIA, previous MPI imp...
Yang-Suk Kee, Soonhoi Ha
CN
2004
122views more  CN 2004»
13 years 7 months ago
Group rekeying with limited unicast recovery
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee