|
EKA: Efficient Keyserver using ALMIMarcel Waldvogel, Radhesh Mohandas, and Sherlia Shi:EKA: Efficient Keyserver using ALMI, IEEE WETICE Workshop on Enterprise Security, Cambridge, MA, USA, June 2001; Best Paper Award. AbstractThe keyserver network serves as a repository of OpenPGP keys, providing replication throughout the Internet. It currently uses an inefficient and insufficient protocol to keep its nodes synchronized: highly redundant network traffic and excessive overhead due to several thousand e-mail messages per day. Under these conditions, even short network outages cause massive mail server overloads and losses, resulting in continuously diverging databases. In this paper, we present a new protocol to achieve complete synchronization efficiently and automatically, drastically reducing the need for manual intervention. Our protocol transmits only the updates and uses multicast to optimize the amount of data sent. Since support for native multicast is not widely available in the underlying network and current Internet multicast does not scale well, we base our keyserver on ALMI. ALMI is a middleware for reliable applicationlevel multicast, providing scalable join/leave notification of neighbors, significantly reducing the complexity of the application. As a part of this work, we have also implemented a keyserver software which uses our protocol and an efficient RDBMS back-end to hold the keys.Documents
BibTeX entry@InProceedings{waldvogel01eka, Author = {Marcel Waldvogel and Radhesh Mohandas and Sherlia Shi}, Title = {{EKA:} Efficient Keyserver using {ALMI}}, BookTitle = {IEEE WETICE Workshop on Enterprise Security}, Year = 2001, Address = {Cambridge, MA, USA}, Month = jun, Pages = {237--246} } |
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.