Communications of the ACM
Paillier's cryptosystem revisited
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Distributed Meeting Scheduling
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Privacy in Distributed Meeting Scheduling
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
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.