Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation

by   Mitali Bafna, et al.

We study the role of interaction in the Common Randomness Generation (CRG) and Secret Key Generation (SKG) problems. In the CRG problem, two players, Alice and Bob, respectively get samples X_1,X_2,... and Y_1,Y_2,... with the pairs (X_1,Y_1), (X_2, Y_2), ... being drawn independently from some known probability distribution μ. They wish to communicate so as to agree on L bits of randomness. The SKG problem is the restriction of the CRG problem to the case where the key is required to be close to random even to an eavesdropper who can listen to their communication (but does not have access to the inputs of Alice and Bob). In this work, we study the relationship between the amount of communication and the number of rounds of interaction in both the CRG and the SKG problems. Specifically, we construct a family of distributions μ = μ_r, n,L, parametrized by integers r, n and L, such that for every r there exists a constant b = b(r) for which CRG (respectively SKG) is feasible when (X_i,Y_i) ∼μ_r,n,L with r+1 rounds of communication, each consisting of O( n) bits, but when restricted to r/2 - 3 rounds of interaction, the total communication must exceed Ω(n/^b(n)) bits. Prior to our work no separations were known for r ≥ 2.


page 1

page 2

page 3

page 4


Round Complexity of Common Randomness Generation: The Amortized Setting

We study the effect of rounds of interaction on the common randomness ge...

Resource-Efficient Common Randomness and Secret-Key Schemes

We study common randomness where two parties have access to i.i.d. sampl...

Efficient Certifiable Randomness from a Single Quantum Device

Brakerski et. al [BCM+18] introduced the model of cryptographic testing ...

Compressed Communication Complexity of Longest Common Prefixes

We consider the communication complexity of fundamental longest common p...

How much does randomness help with locally checkable problems?

Locally checkable labeling problems (LCLs) are distributed graph problem...

Physical Layer Secret Key Generation in Static Environments

We consider the problem of symmetric secret key generation in quasi-stat...

Learning without Interaction Requires Separation

One of the key resources in large-scale learning systems is the number o...

Please sign up or login with your details

Forgot password? Click here to reset