May 19, 2017 · We consider secure computation of randomized functions between two users, where both the users (Alice and Bob) have inputs, Alice sends a ...

Abstract: We consider secure computation of randomized functions by two users, where both the users (Alice and Bob) have inputs, Alice sends a message to ...

May 19, 2017 · In this paper we study the remaining two cases (one with privacy only against Bob, and the other with no privacy), and give rate-optimal codes ...

Abstract—We consider secure computation of randomized functions by two users, where both the users (Alice and Bob) have inputs, Alice sends a message to Bob ...

Sep 13, 2024 · Two user secure computation of randomized functions is considered, where only one user computes the output. Both the users are semi-honest; ...

Secure Computation of Randomized Functions: Further Results. Article. Full-text available. May 2017. Deepesh Data · Vinod M. Prabhakaran. We consider ...

We give a single-letter expression for the optimal rate. We also explicitly characterize securely computable randomized functions when input has full support, ...

Abstract: Two user secure computation of randomized functions is considered, where only one user computes the output. Both the users are semi-honest; and ...

It is often convenient to manipulate randomized encodings by concatenating encod- ings of two or more functions and by composing encodings, namely applying one ...

Abstract We investigate the extent to which correlated secret random- ness can help in secure computation with no honest majority. It is known.