Abstract
Applications which help users to schedule events are becoming more and more important. A drawback of most existing applications is, that the preferences of all participants are revealed to the others. Previously proposed privacy-friendly solutions could only schedule meetings if all participants were available at the same time slot.
We propose a new scheme, which overcomes this limitation, i.e., the meeting can be scheduled at the time slot, where just the majority of participants is available. Dudle ( http://dudle.inf.tu-dresden.de ), a web-application which implements the protocol is presented. We measured its performance in order to show that the protocol is practical and feasible.
Chapter PDF
Similar content being viewed by others
Keywords
References
Kellermann, B., Böhme, R.: Privacy-enhanced event scheduling. In: CSE, vol. 3, pp. 52–59. IEEE Computer Society, Los Alamitos (2009)
Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous search with aggregations. In: AAAI/IAAI, pp. 917–922. AAAI Press / The MIT Press (2000)
Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3(2), 185–207 (2000)
Léauté, T., Faltings, B.: Privacy-preserving multi-agent constraint satisfaction. In: CSE, vol. 3, pp. 17–25. IEEE Computer Society, Los Alamitos (2009)
Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161, 149–180 (2005)
Maheswaran, R.T., Tambe, M., Bowring, E., Pearce, J.P., Varakantham, P.: Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In: AAMAS, pp. 310–317. IEEE Computer Society, Los Alamitos (2004)
Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: AAMAS, pp. 438–445. IEEE, Washington, DC (2004)
Franzin, M.S., Freuder, E.C., Rossi, F., Wallace, R.: Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality. AAAI Technical Report (2002)
Greenstadt, R., Pearce, J.P., Bowring, E., Tambe, M.: Experimental analysis of privacy loss in DCOP algorithms. In: AAMAS, pp. 1424–1426. ACM Press, New York (2006)
Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84–90 (1981), doi:10.1145/358549.358563
Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)
Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In: STOC, pp. 544–553. ACM, New York (1994)
Sako, K., Kilian, J.: Receipt-free mix-type voting scheme. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 539–556. Springer, Heidelberg (2000)
Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: WPES, pp. 61–70. ACM, New York (2005)
Herschberg, M.A.: Secure electronic voting over the world wide web. Master’s thesis, Massachusetts Institute of Technology (May 1997)
Adida, B.: Helios: Web-based open-audit voting. In: USENIX, pp. 335–348 (2008)
Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: Toward a secure voting system. In: Security and Privacy, pp. 354–368. IEEE, Los Alamitos (2008)
Rivest, R.L., Smith, W.D.: Three voting protocols: Threeballot, vav, and twin. In: USENIX, p. 16. USENIX Association, Berkeley (2007)
Wu, T.: BigIntegers and RSA in JavaScript (July 2010), http://www-cs-students.stanford.edu/~tjw/jsbn/
Baird, L.: BigIntegers in JavaScript, Version 5.4. (July 2010), http://www.leemon.com/crypto/BigInt.html
Shapiro, D.: BigInt, a suite of routines for performing multiple-precision arithmetic in JavaScript, Version 5.4. (July 2010), http://ohdave.com/rsa/BigInt.js
Herlea, T., Claessens, J., Preneel, B., Neven, G., Piessens, F., De Decker, B.: On securely scheduling a meeting. In: SEC. IFIP Conference Proceedings, vol. 193, pp. 183–198. Kluwer, Dordrecht (2001)
Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1(1), 65–75 (1988)
Poettering, B.: The AES block cipher and the SHA256 message digest in JavaScript, Version 0.1. (July 2010), http://point-at-infinity.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kellermann, B. (2011). Privacy-Enhanced Web-Based Event Scheduling with Majority Agreement. In: Camenisch, J., Fischer-Hübner, S., Murayama, Y., Portmann, A., Rieder, C. (eds) Future Challenges in Security and Privacy for Academia and Industry. SEC 2011. IFIP Advances in Information and Communication Technology, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21424-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-21424-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21423-3
Online ISBN: 978-3-642-21424-0
eBook Packages: Computer ScienceComputer Science (R0)