Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

STACS
1995
Springer

favoriteEmaildiscussreport

102views Theoretical Computer Science» more STACS 1995»

Communication Complexity of Key Agreement on Small Ranges

13 years 9 months ago

Communication Complexity of Key Agreement on Small Ranges

Download www.cse.buffalo.edu

Jin-yi Cai, Richard J. Lipton, Luc Longpré,

Real-time Traffic

STACS 1995 | Theoretical Computer Science |

claim paper

Related Content

» Efficient Authenticated and FaultTolerant Key Agreement for Dynamic Peer Groups

» An Efficient TreeBased Group Key Agreement Using Bilinear Map

» Robust group key agreement using short broadcasts

» Multichannel Protocols for Group Key Agreement in Arbitrary Topologies

» Optimal Communication Complexity of Generic Multicast Key Distribution

» On the Exact Space Complexity of Sketching and Streaming Small Norms

» Passwordauthenticated Key Exchange using Efficient MACs

» Pairing Devices with Good Quality Output Interfaces

» Environmental Risk Cooperation and Communication Complexity

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	STACS
Authors	Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar

Comments (0)