Sciweavers

250 search results - page 5 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
ICISC
2008
89views Cryptology» more  ICISC 2008»
13 years 9 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik
IPPS
1998
IEEE
14 years 3 days ago
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
Koji Nakano, Stephan Olariu, James L. Schwing
IPPS
2005
IEEE
14 years 1 months ago
Using Leader-Based Communication to Improve the Scalability of Single-Round Group Membership Algorithms
Sigma, the first single-round group membership (GM) algorithm, was recently introduced and demonstrated to operate consistently with theoretical expectations in a simulated WAN en...
Roger Khazan, Sophia Yuditskaya
ACNS
2004
Springer
156views Cryptology» more  ACNS 2004»
14 years 1 months ago
One-Round Protocols for Two-Party Authenticated Key Exchange
Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channe...
Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee
DEXAW
2009
IEEE
141views Database» more  DEXAW 2009»
13 years 9 months ago
Improving Practical Performance on Secure and Private Collaborative Linear Programming
Although information sharing in supply chain management dramatically reduces costs, parties are reluctant to do so, mainly due to fear of information leakage. Solutions based on se...
Rafael Deitos, Florian Kerschbaum