We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
—Because of the enormous growth in the number of peer-to-peer (P2P) applications in recent years, P2P traffic now constitutes a substantial proportion of Internet traffic. The ...
Next generation Web 2.0 communities and distributed P2P systems rely on the cooperation of diverse user populations spread across numerous administrative and security domains. Zero...
Gayatri Swamynathan, Kevin C. Almeroth, Ben Y. Zha...
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti...
The rising popularity of Web 2.0, such as blogs, forums, online calendars/diaries, etc., makes users more interested in keeping their data on the Web. Sharing of such data could m...