On securely scheduling a meeting

Authors:
Thomas Herlea;Joris Claessens;Bart Preneel;Gregory Neven;Frank Piessens;Bart De Decker
Affiliations:
Katholieke Univ. Leuven, Leuven-Heverlee, Belgium;Katholieke Univ. Leuven, Leuven-Heverlee, Belgium;Katholieke Univ. Leuven, Leuven-Heverlee, Belgium;Katholieke Univ. Leuven, Leuven-Heverlee, Belgium;Katholieke Univ. Leuven, Leuven-Heverlee, Belgium;Katholieke Univ. Leuven, Leuven-Heverlee, Belgium
Venue:
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
Year:
2001

Citing 3
Cited 5

Complexity and security of distributed protocols

Complexity and security of distributed protocols
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Secure Meeting Scheduling with agenTA

Proceedings of the IFIP TC6/TC11 International Conference on Communications and Multimedia Security Issues of the New Century

Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Secure distributed constraint satisfaction: reaching agreement without revealing private information

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Open research questions of privacy-enhanced event scheduling

iNetSec'10 Proceedings of the 2010 IFIP WG 11.4 international conference on Open research problems in network security
Protecting privacy through distributed computation in multi-agent decision making

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

When people want to schedule a meeting, their agendas must be compared to find a time suitable for all participants. At the same time, people want to keep their agendas private. This paper presents several approaches which intend to solve this contradiction. A custom (---) made protocol for secure meeting scheduling and a protocol based on secure distributed computing are discussed. The security properties and complexity of these protocols are compared. A trade-off between trust and bandwidth requirements is shown to be possible by implementing the protocols using mobile agents.