On the Communication Complexity of Privacy-Preserving Information Sharing Protocols

2007 ◽  
Author(s):  
Nan Zhang
Keyword(s):  
Information Sharing ◽  
Communication Complexity ◽  
Privacy Preserving

scholarly journals Multi Party Computation Motivated by the Birthday Problem

2019 ◽  
Vol 24 (1) ◽  
pp. 29-41
Author(s):  
Péter Hudoba ◽  
Péter Burcsi
Keyword(s):  
Communication Complexity ◽  
Privacy Preserving ◽  
Birthday Problem ◽  
Birthday Paradox

Suppose there are n people in a classroom and we want to decide if there are two of them who were born on the same day of the year. The well-known birthday paradox is concerned with the probability of this event and is discussed in many textbooks on probability. In this paper we focus on cryptographic aspects of the problem: how can we decide if there is a collision of birthdays without the participants disclosing their respective date of birth. We propose several procedures for solving this in a privacy-preserving way and compare them according to their computational and communication complexity.

HealthShare: Achieving secure and privacy-preserving health information sharing through health social networks

2012 ◽  
Vol 35 (15) ◽  
pp. 1910-1920 ◽  
Author(s):  
Xiaohui Liang ◽  
Mrinmoy Barua ◽  
Rongxing Lu ◽  
Xiaodong Lin ◽  
Xuemin (Sherman) Shen
Keyword(s):  
Social Networks ◽  
Information Sharing ◽  
Health Information ◽  
Privacy Preserving ◽  
Health Information Sharing
Sign in / Sign up

Export Citation Format

Share Document