A Privacy-Preserved Joint Group Time Scheduling Mechanism for Mobile Social Applications

In this paper, we develop a privacy preserving mechanism for a scheduling service for a group of users, which can compute the joint available time based on users' calendar information. We also propose a weighted voting game with partially homomorphic encryption (WVGPHE) scheme to protect the privacy of users' calendar information as well as users' weight. Even with the privacy protection, our experimental results show that the proposed scheme is still very computational and bandwidth efficient enough to provide immediate group meeting in mobile communications environments.

[1]  Frederik Vercauteren,et al.  Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes , 2010, Public Key Cryptography.

[2]  Jacques Traoré,et al.  A practical and secure coercion-resistant scheme for remote elections , 2007, Frontiers of Electronic Voting.

[3]  Kun Peng,et al.  Efficient Proof of Validity of Votes in Homomorphic E-Voting , 2010, 2010 Fourth International Conference on Network and System Security.

[4]  Byoungcheon Lee,et al.  An Efficient Mixnet-Based Voting Scheme Providing Receipt-Freeness , 2004, TrustBus.

[5]  Yuuji Sugiyama.  An Efficient Weighted Voting Protocol with Secret Weights , 2004 .

[6]  Byoungcheon Lee,et al.  Providing Receipt-Freeness in Mixnet-Based Voting Protocols , 2003, ICISC.

[7]  Deian Stefan,et al.  A Domain-Specific Language for Computing on Encrypted Data (Invited Talk) , 2011, FSTTCS.

[8]  Joe Tullio,et al.  Augmenting shared personal calendars , 2002, UIST '02.

[9]  Masayuki Abe,et al.  Mix-Networks on Permutation Networks , 1999, ASIACRYPT.

[10]  Byoungcheon Lee,et al.  Receipt-Free Electronic Voting Scheme with a Tamper-Resistant Randomizer , 2002, ICISC.

[11]  Pradeep Dubey,et al.  Mathematical Properties of the Banzhaf Power Index , 1979, Math. Oper. Res..

[12]  Aggelos Kiayias,et al.  Self-tallying Elections and Perfect Ballot Secrecy , 2002, Public Key Cryptography.

[13]  Kun Peng,et al.  Efficient Vote Validity Check in Homomorphic Electronic Voting , 2009, ICISC.

[14]  I. Damgård,et al.  A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System , 2000 .

[15]  Dennis Leech,et al.  Voting Power in the Governance of the International Monetary Fund , 2002, Ann. Oper. Res..

[16]  Leysia Palen,et al.  Social, individual and technological issues for groupware calendar systems , 1999, CHI '99.

[17]  David Chaum,et al.  Secret-ballot receipts: True voter-verifiable elections , 2004, IEEE Security & Privacy Magazine.

[18]  Mathieu Martin,et al.  On the likelihood of dummy players in weighted majority games , 2013, Soc. Choice Welf..

[19]  Atsushi Fujioka,et al.  A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.

[20]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[21]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[22]  Byoungcheon Lee,et al.  Multiplicative Homomorphic E-Voting , 2004, INDOCRYPT.