Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.3233/978-1-60750-061-2-275 | CCIA |
Keywords | Field | DocType |
privacy requirement,homomorphic public key encryption,cryptographic technique,privacy,cryptographic solution,new search strategy,. meeting scheduling,simple case,previous work,complete privacy,conceptually clear approach,suitable application,public key encryption,distributed computing | Cryptography,Scheduling (computing),Computer science,Cryptographic primitive,Distributed computing,Computation | Conference |
Volume | ISSN | Citations |
202 | 0922-6389 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Javier Herranz | 1 | 107 | 8.73 |
| Stan Matwin | 2 | 3025 | 344.20 |
| Pedro Meseguer | 3 | 880 | 92.98 |
| Jordi Nin | 4 | 311 | 26.53 |