NDLI: Confidential Gossip

Content Provider	IEEE Xplore Digital Library
Author	Georgiou, C. Gilbert, S. Kowalski, D.R.
Copyright Year	2011
Abstract	Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing information. As a result of this collaboration, processes may receive information that was not originally intended for them. For example, a process may act as an intermediary, aggregating and forwarding messages from some set of sources to some set of destinations. But what if rumors are confidential? In that case, only processes that were originally intended to receive a rumor should be allowed to learn the rumor. This blatantly contradicts the basic premise of epidemic gossip, which assumes that processes can collaborate. In fact, if only processes in a rumor's "destination set" participate in gossiping that rumor, we show that high message complexity is unavoidable. We propose a scheme in which each rumor is broken into multiple fragments using a simple coding scheme: any given fragment provides no information about the rumor, while together, they allow the original rumor to be reassembled. The processes collaborate in disseminating the rumor fragments while ensuring that no process receives all the fragments of a rumor unless it is in that rumor's destination set. Our solution operates in an environment where rumors are dynamically and continuously injected into the system and processes are subject to crashes and restarts. In addition, the scheme presented can tolerate a moderate amount of collusion among curious processes without too large an increase in cost.
Starting Page	603
Ending Page	612
File Size	450338
Page Count	10
File Format	PDF
ISBN	9781612843841
ISSN	10636927
DOI	10.1109/ICDCS.2011.71
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-06-20
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer crashes Complexity theory Protocols Cryptography Collaboration Computational modeling Privacy Message complexity Confidentiality Collusion Randomized gossip Fault-tolerance Dynamic rumor injection
Content Type	Text
Resource Type	Article
Subject	Software Hardware and Architecture Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

Consensus with Unknown Participants in Shared Memory

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Optimistic Byzantine agreement

Asynchronous Byzantine group communication

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

The relative overhead of piggybacking in causal message logging protocols

A Distributed Polling with Probabilistic Privacy

Fault tolerance evaluation using two software based fault injection methods

Confidential Gossip

Similar Documents

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

Consensus with Unknown Participants in Shared Memory

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Optimistic Byzantine agreement

Asynchronous Byzantine group communication

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

The relative overhead of piggybacking in causal message logging protocols

A Distributed Polling with Probabilistic Privacy

Fault tolerance evaluation using two software based fault injection methods

Confidential Gossip