IBM computer usability satisfaction questionnaires: psychometric evaluation and instructions for use
International Journal of Human-Computer Interaction
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
On Securely Scheduling a Meeting
IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Constraint Satisfaction and Optimization with Privacy Enforcement
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
GAnGS: gather, authenticate 'n group securely
Proceedings of the 14th ACM international conference on Mobile computing and networking
Chronos: A multi-agent system for distributed automatic meeting scheduling
Expert Systems with Applications: An International Journal
SPATE: small-group PKI-less authenticated trust establishment
Proceedings of the 7th international conference on Mobile systems, applications, and services
Privacy-Enhanced Event Scheduling
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 03
Secure distributed constraint satisfaction: reaching agreement without revealing private information
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
The Journal of Supercomputing
The Journal of Supercomputing
| Hi-index | 0.01 |
Abstract: Mobile devices are increasingly being used to store and manage users' personal information, as well as to access popular third-party context-based services. Very often, these applications need to determine common availabilities among a set of user schedules, in order to allow colleagues, business partners and people to meet. The privacy of the scheduling operation is paramount to the success of such applications, as often users do not want to share their personal schedule details with other users or third-parties. In this paper, we propose practical and privacy-preserving solutions for mobile devices to the server-based scheduling problem. Our three novel algorithms take advantage of the homomorphic properties of well-known cryptosystems in order to privately and efficiently compute common user availabilities. We also formally outline the privacy requirements in such scheduling applications and we implement our solutions on real mobile devices. The experimental measurements and analytical results show that the proposed solutions not only satisfy the privacy properties but also fare better, in regard to computation and communication efficiency, compared to other well-known solutions. Finally, we assess the utility and expectations, in terms of privacy and usability, of the proposed solutions by means of a targeted survey and user-study of mobile-phone users.