Abstract
P₄free graphs also known as cographs, complementreducible graphs, or hereditary Dacey graphshave been well studied in graph theory. Motivated by computer science and information theory applications, our work encodes (flat) joint probability distributions and Boolean functions as bipartite graphs and studies bipartite P₄free graphs. For these applications, the graph properties of edge partitioning and covering a bipartite graph using the minimum number of these graphs are particularly relevant. Previously, such graph properties have appeared in leakageresilient cryptography and (variants of) coloring problems.
Interestingly, our covering problem is closely related to the wellstudied problem of product (a.k.a., Prague) dimension of loopless undirected graphs, which allows us to employ algebraic lowerbounding techniques for the product/Prague dimension. We prove that computing these numbers is NPcomplete, even for bipartite graphs. We establish a connection to the (unsolved) Zarankiewicz problem to show that there are bipartite graphs with sizeN partite sets such that these numbers are at least ε⋅N^{12ε}, for ε ∈ {1/3,1/4,1/5,...}. Finally, we accurately estimate these numbers for bipartite graphs encoding wellstudied Boolean functions from circuit complexity, such as set intersection, set disjointness, and inequality.
For applications in information theory and communication & cryptographic complexity, we consider a system where a setup samples from a (flat) joint distribution and gives the participants, Alice and Bob, their portion from this joint sample. Alice and Bob’s objective is to noninteractively establish a shared key and extract the leftover entropy from their portion of the samples as independent private randomness. A genie, who observes the joint sample, provides appropriate assistance to help Alice and Bob with their objective. Lower bounds to the minimum size of the genie’s assistance translate into communication and cryptographic lower bounds. We show that (the log₂ of) the P₄free partition number of a graph encoding the joint distribution that the setup uses is equivalent to the size of the genie’s assistance. Consequently, the joint distributions corresponding to the bipartite graphs constructed above with high P₄free partition numbers correspond to joint distributions requiring more assistance from the genie.
As a representative application in nondeterministic communication complexity, we study the communication complexity of nondeterministic protocols augmented by access to the equality oracle at the output. We show that (the log₂ of) the P₄free cover number of the bipartite graph encoding a Boolean function f is equivalent to the minimum size of the nondeterministic input required by the parties (referred to as the communication complexity of f in this model). Consequently, the functions corresponding to the bipartite graphs with high P₄free cover numbers have high communication complexity. Furthermore, there are functions with communication complexity close to the naïve protocol where the nondeterministic input reveals a party’s input. Finally, the access to the equality oracle reduces the communication complexity of computing set disjointness by a constant factor in contrast to the model where parties do not have access to the equality oracle. To compute the inequality function, we show an exponential reduction in the communication complexity, and this bound is optimal. On the other hand, access to the equality oracle is (nearly) useless for computing set intersection.
BibTeX  Entry
@InProceedings{block_et_al:LIPIcs.ITC.2021.16,
author = {Block, Alexander R. and Br\^{a}nzei, Simina and Maji, Hemanta K. and Mehta, Himanshi and Mukherjee, Tamalika and Nguyen, Hai H.},
title = {{P₄free Partition and Cover Numbers \& Applications}},
booktitle = {2nd Conference on InformationTheoretic Cryptography (ITC 2021)},
pages = {16:116:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771979},
ISSN = {18688969},
year = {2021},
volume = {199},
editor = {Tessaro, Stefano},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14335},
URN = {urn:nbn:de:0030drops143357},
doi = {10.4230/LIPIcs.ITC.2021.16},
annote = {Keywords: Secure keys, Secure private randomness, GrayWyner system, Cryptographic complexity, Nondeterministic communication complexity, Leakageresilience, Combinatorial optimization, Product dimension, Zarankiewicz problem, Algebraic lowerbounding techniques, P₄free partition number, P₄free cover number}
}
Keywords: 

Secure keys, Secure private randomness, GrayWyner system, Cryptographic complexity, Nondeterministic communication complexity, Leakageresilience, Combinatorial optimization, Product dimension, Zarankiewicz problem, Algebraic lowerbounding techniques, P₄free partition number, P₄free cover number 
Collection: 

2nd Conference on InformationTheoretic Cryptography (ITC 2021) 
Issue Date: 

2021 
Date of publication: 

19.07.2021 