Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)

Silaghi, Marius

doi:10.1109/wi.2004.10147

Cited by 5 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In existing works, several approaches have been developed to deal with privacy in DCOPs. Some cryptographic approaches offer certain end-to-end security guarantees by integrating the entire solving process in one primitive for DisCSPs or for DCOPs, the highest level of such privacy guarantees being achievable only for problems with a single variable [54]. Other cryptographic approaches are hybrids interlacing cryptographic and artificial intelligence steps [57], [21], [24].…”

Section: B Privacymentioning

confidence: 99%

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs

Savaux,

Vion,

Piechowiak

et al. 2017

Preprint

View full text Add to dashboard Cite

Privacy has traditionally been a major motivation for distributed problem solving. Distributed Constraint Satisfaction Problem (DisCSP) as well as Distributed Constraint Optimization Problem (DCOP) are fundamental models used to solve various families of distributed problems. Even though several approaches have been proposed to quantify and preserve privacy in such problems, none of them is exempt from limitations. Here we approach the problem by assuming that computation is performed among utilitarian agents. We introduce a utilitarian approach where the utility of each state is estimated as the difference between the reward for reaching an agreement on assignments of shared variables and the cost of privacy loss. We investigate extensions to solvers where agents integrate the utility function to guide their search and decide which action to perform, defining thereby their policy. We show that these extended solvers succeed in significantly reducing privacy loss without significant degradation of the solution quality.

show abstract

Section: B Privacymentioning

confidence: 99%

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs

Savaux,

Vion,

Piechowiak

et al. 2017

Preprint

View full text Add to dashboard Cite

show abstract

“…In the literature, the four most relevant bodies of work that address privacy in scheduling or similar scenarios are based on techniques from private set-intersection (Kissner and Song, 2005;De Cristofaro and Tsudik, 2010), distributed constraint satisfaction (Wallace and Freuder, 2005;Yokoo et al, 2005;Silaghi and Mitra, 2004;Silaghi, 2004), secure multi-party computation (Herlea et al, 2001;Du and Atallah, 2001) and e-voting (Kellermann and Böhme, 2009). Hereafter, we review the most relevant aspects of such approaches.…”

Section: State Of the Artmentioning

confidence: 99%

Meetings through the cloud: Privacy-preserving scheduling on mobile devices

Bilogrevic

Jadliwala

Kumar

et al. 2011

Journal of Systems and Software

View full text Add to dashboard Cite

a b s t r a c tMobile 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 serverbased 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.

show abstract

“…In the literature, the four most relevant bodies of work that address privacy in scheduling or similar scenarios are based on techniques from private set-intersection [20,11], distributed constraint satisfaction [27,28,24,25], secure multi-party computation [18,12] and e-voting [19]. Hereafter, we review the most relevant aspects of such approaches.…”

Section: State Of the Artmentioning

confidence: 99%

“…Privacy-preserving scheduling problems have been extensively studied in the past by researchers from the theoretical perspective, for instance, by modeling them as set intersection problems [20,11], distributed constraint satisfaction problems [27,28,24,25], secure multi-party computation problems [18,12] and by framing them in the e-voting context [19]. Traditionally, there are two possible approaches to the scheduling problems: distributed and centralized.…”

Section: Introductionmentioning

confidence: 99%

Privacy-preserving activity scheduling on mobile devices

Bilogrevic

Jadliwala

Hubaux

et al. 2011

Proceedings of the First ACM Conference on Data and Application Security and Privacy

View full text Add to dashboard Cite

Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users' personal schedules. Users also access popular context-based services, typically provided by third-party providers, by using these devices for social networking, dating and activitypartner searching applications. Very often, these applications need to determine common availabilities among a set of user schedules. The privacy of the scheduling operation is paramount to the success of such applications, as often users do not want to share their personal schedules with other users or third-parties. Previous research has resulted in solutions that provide privacy guarantees, but they are either too complex or do not fit well in the popular user-provider operational model. In this paper, we propose practical and privacy-preserving solutions to the server-based scheduling problem. Our novel algorithms take advantage of the homomorphic properties of well-known cryptosystems in order to privately 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.

show abstract

Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP)

Abstract: Distributed problems raise privacy issues. The user would like to specify securely his constraints (desires, availability, money)

Cited by 5 publications

References 3 publications

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs

Meetings through the cloud: Privacy-preserving scheduling on mobile devices

Privacy-preserving activity scheduling on mobile devices

Contact Info

Product

Resources

About