Howdy, SKS keyservers (the main pool used for GPG keys) uses a reconciliation protocol to gossip new keys among the pool of keyservers[1]. I've read through the academic paper[2][3] several times, but I'm having a difficult time going from the math to the code in the actual sks-keyserver (written in OCaml).
I've asked the same question on the sks-devel mailing list[4], but did not receive a reply. Is anyone who knows the actual implementation details and mechanics of the gossip protocol willing to be a mentor as I learn it? I'd like to just have someone I can ping with questions as I work through the code. My goal is to be able to write an independent implementation that can coexist in the sks pool. Thanks, Daniel [1]: https://bitbucket.org/skskeyserver/sks-keyserver/wiki/Home [2]: http://ipsit.bu.edu/documents/ieee-it3-web.pdf [3]: http://ipsit.bu.edu/documents/BUTR2002-01.ps [4]: http://lists.nongnu.org/archive/html/sks-devel/2016-08/msg00072.html _______________________________________________ Messaging mailing list Messaging@moderncrypto.org https://moderncrypto.org/mailman/listinfo/messaging
