Skip to main navigation Skip to search Skip to main content

Bounds on the leakage of the input's distribution in information-Hiding protocols

  • Indian Institute of Technology Kanpur

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In information-hiding, an adversary that tries to infer the secret information has a higher probability of success if it knows the distribution on the secrets. We show that if the system leaks probabilistically some information about the secrets, (that is, if there is a probabilistic correlation between the secrets and some observables) then the adversary can approximate such distribution by repeating the observations. More precisely, it can approximate the distribution on the observables by computing their frequencies, and then derive the distribution on the secrets by using the correlation in the inverse direction. We illustrate this method, and then we study the bounds on the approximation error associated with it, for various natural notions of error. As a case study, we apply our results to Crowds, a protocol for anonymous communication.

Original languageEnglish
Title of host publicationTrustworthy Global Computing - 4th International Symposium, TGC 2008, Revised Selected Papers
Pages36-51
Number of pages16
DOIs
Publication statusPublished - 17 Jul 2009
Event4th International Symposium on Trustworthy Global Computing, TGC 2008 - Barcelona, Spain
Duration: 3 Nov 20084 Nov 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5474 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Symposium on Trustworthy Global Computing, TGC 2008
Country/TerritorySpain
CityBarcelona
Period3/11/084/11/08

Fingerprint

Dive into the research topics of 'Bounds on the leakage of the input's distribution in information-Hiding protocols'. Together they form a unique fingerprint.

Cite this