Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness

Bar Alon, Olga V. Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-22365-5_19

Related papers

On Lower Bounds and Size Reduction for Correlated Randomness in Secure Two-party Computation

Keitaro Hiwatashi

•Mar 21, 2024•0 citations

Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose

Yan Huang, Jonathan I. Katz, David Evans

Lecture notes in computer science•Jan 1, 2013•118 citations

Towards Characterizing Securely Computable Two-Party Randomized Functions

Deepesh Data, Manoj Prabhakaran

Lecture notes in computer science•Jan 1, 2018•7 citations

Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation

Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

Lecture notes in computer science•Jan 1, 2009•49 citations

Correlated Randomness Reduction in Domain-Restricted Secure Two-Party Computation

Keitaro Hiwatashi, Koji Nuida

Secure two-party computation is a cryptographic tool that enables two parties to compute a function jointly without revealing their inputs. It is known that any function can be realized in the correlated randomness (CR) model, where a trusted dealer distributes input-independent CR to the parties beforehand. Sometimes we can construct more efficient secure two-party protocol for a function g than that for a function f, where g is a restriction of f. However, it is not known in which case we can construct more efficient protocol for domain-restricted function. In this paper, we focus on the size of CR. We prove that we can construct more efficient protocol for a domain-restricted function when there is a “good” structure in CR space of a protocol for the original function, and show a unified way to construct a more efficient protocol in such case. In addition, we show two applications of the above result: The first application shows that some known techniques of reducing CR size for domain-restricted function can be derived in a unified way, and the second application shows that we can construct more efficient protocol than an existing one using our result.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 3, 2023•0 citations

On the Power of Correlated Randomness in Secure Computation

Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard +2 more

Lecture notes in computer science•Jan 1, 2013•117 citations
Secure two-party computation is a cryptographic tool that enables two parties to compute a function jointly without revealing their inputs. It is known that any function can be realized in the correlated randomness (CR) model, where a trusted dealer distributes input-independent CR to the parties beforehand. Sometimes we can construct more efficient secure two-party protocol for a function g than that for a function f, where g is a restriction of f. However, it is not known in which case we can construct more efficient protocol for domain-restricted function. In this paper, we focus on the size of CR. We prove that we can construct more efficient protocol for a domain-restricted function when there is a “good” structure in CR space of a protocol for the original function, and show a unified way to construct a more efficient protocol in such case. In addition, we show two applications of the above result: The first application shows that some known techniques of reducing CR size for domain-restricted function can be derived in a unified way, and the second application shows that we can construct more efficient protocol than an existing one using our result.