Interactive Secure Function Computation

12/10/2018
by   Deepesh Data, et al.
0

We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2020

Secure Computation to Hide Functions of Inputs

We consider a two-user secure computation problem in which Alice and Bob...
research
05/12/2020

Private Two-Terminal Hypothesis Testing

We study private two-terminal hypothesis testing with simple hypotheses ...
research
02/28/2022

Making Concurrency Functional

The article bridges between two major paradigms in computation, the func...
research
06/12/2019

Action-Sensitive Phonological Dependencies

This paper defines a subregular class of functions called the tier-based...
research
01/28/2022

Function Computation Without Secure Links: Information and Leakage Rates

Consider L users, who each holds private data, and one fusion center who...
research
06/29/2023

Gaussian Data Privacy Under Linear Function Recoverability

A user's data is represented by a Gaussian random variable. Given a line...
research
05/26/2020

Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms

We find separation rates for testing multinomial or more general discret...

Please sign up or login with your details

Forgot password? Click here to reset