A Cryptographic Solution for Private Distributed Simple Meeting Scheduling
Javier Herranz, Stan Matwin, Pedro Meseguer, Jordi Nin · Frontiers in artificial intelligence and applications · 2009
Meeting Scheduling is a suitable application for distributed computation, motivated by its privacy requirements. Previous work on this problem have considered some cryptographic techniques as well as new search strategies. In this paper, we provide a cryptographic and conceptually clear approach to solve a simple case of Meeting Scheduling, even achieving complete privacy.