Multi-party Indirect Indexing and Applications

Franklin, Matthew K.; Gondree, Mark; Mohassel, Payman

doi:10.1007/978-3-540-76900-2_17

Cited by 8 publications

(9 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Franklin et al [7] develop an efficient multiparty Look-Up Table (mLUT) protocol and suggest that one can design a secure SM system by implementing the algorithm of [6, Section 5] into a circuit with access to a RAM. Especially in the multiparty setting, mLUT for array/matrix access reduces the complexity of such a setting to the situation when we have 2 matching authorities as shown in Table 2.…”

Section: Keller Et Al [15]mentioning

confidence: 99%

See 1 more Smart Citation

Toward Practical Secure Stable Matching

Riazi

Songhori

Sadeghi

et al. 2016

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Abstract:The Stable Matching (SM) algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP) and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao's garbled circuit protocol and Oblivious RAM (ORAM). Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.

show abstract

Section: Keller Et Al [15]mentioning

confidence: 99%

“…Franklin et al then improved this system and made it more efficient using an efficient multi-party indirect indexing [6,7]. However, most of the previously proposed protocols for secure SM use a large number of expensive public-key operations and have not been implemented yet.…”

Section: Introductionmentioning

confidence: 99%

Toward Practical Secure Stable Matching

Riazi

Songhori

Sadeghi

et al. 2016

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

show abstract

“…The CTH component can be instantiated using either the HE-based or the SN-based OEP discussed above. We also design a simple and efficient multiparty PGE functionality given a multiparty OT as in [FGM07]. To the best of our knowledge, this is the first multiparty PFE besides the generic solutions of applying MPC to universal circuits.…”

Section: Our Contributionmentioning

confidence: 99%

“…In Appendix H we show a simple construction for this problem based on any multiparty OT (e.g. see [FGM07]). …”

Section: Multi-party Private Function Evaluationmentioning

confidence: 99%

How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation

Mohassel

Sadeghian

2013

Lecture Notes in Computer Science

Self Cite

140

View full text Add to dashboard Cite

We revisit the problem of general-purpose private function evaluation (PFE) wherein a single party P 1 holds a circuit C, while each P i for 1 ≤ i ≤ n holds a private input x i , and the goal is for a subset (or all) of the parties to learn C(x 1 , . . . , x n ) but nothing else. We put forth a general framework for designing PFE where the task of hiding the circuit and securely evaluating its gates are addressed independently: First, we reduce the task of hiding the circuit topology to oblivious evaluation of a mapping that encodes the topology of the circuit, which we refer to as oblivious extended permutation (OEP) since the mapping is a generalization of the permutation mapping. Second, we design a subprotocol for private evaluation of a single gate (PFE for one gate), which we refer to as private gate evaluation (PGE). Finally, we show how to naturally combine the two components to obtain efficient and secure PFE.We apply our framework to several well-known general-purpose MPC constructions, in each case, obtaining the most efficient PFE construction to date, for the considered setting. Similar to the previous work we only consider semi-honest adversaries in this paper.• In the multiparty case with dishonest majority, we apply our techniques to the seminal GMW protocol [GMW87] and obtain the first general-purpose PFE with linear complexity in the circuit size.• In the two-party case, we transform Yao's garbled circuit protocol [Yao86] into a constant-round two-party PFE. Depending on the instantiation of the underlying subprotocol, we either obtain a two-party PFE with linear complexity that improves on the only other work with similar asymptotic efficiency (Katz and Malka, ASIACRYPT 2011 [KM11]), or a two-party PFE that provides the best concrete efficiency to date despite not being linear.• The above two constructions are for boolean circuits. In case of arithmetic circuits, we obtain the first PFE with linear complexity based on any additively homomorphic encryption scheme.Though each construction uses different techniques, a common feature in all three is that the overhead of hiding the circuit C is essentially equal to the cost of running the OEP protocol on a vector of size |C|. As a result, to improve efficiency, one can focus on lowering the cost of the underlying OEP protocol. OEP can be instantiated using a singly homomorphic encryption or any general-purpose MPC but we introduce a new construction that we show is significantly more efficient than these alternatives, in practice. The main building block in our OEP construction is an efficient protocol for oblivious switching network evaluation (OSN), a generalization of the previously studied oblivious shuffling problem which is of independent interest. Our results noticeably improve efficiency of the previous solutions to oblivious shuffling, yielding a factor of 25 or more gain in computation and communication. * email address: pmohasse@cpsc.ucalgary.ca † email address: sadeghis@ucalgary.ca

show abstract

“…Alternatively, perhaps neither Alice nor Bob want to play the role of the server (who pre-computes the basic block function table) but instead want to leverage the resources of one or more external servers, without having to trust them. We can generalize our LCS-length and LCS-backtracking protocols to this scenario using a multiparty generalization of indirect indexing [17,24]. In particular, the multiparty indirect indexing scheme of Ishai et al [24] is a general construction using any 2-round OT protocol.…”

Section: Multiparty Variants Of Lcs-length and Lcs-backtracingmentioning

confidence: 99%

Communication-Efficient Private Protocols for Longest Common Subsequence

Franklin

Gondree

Mohassel

2009

Topics in Cryptology – CT-RSA 2009

Self Cite

View full text Add to dashboard Cite

Abstract. We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to passive adversaries, under reasonable cryptographic assumptions. We benefit from the somewhat surprising interplay of an efficient block-retrieval PIR (GentryRamzan, ICALP 2005) with the classic "four Russians" algorithmic design. This result is the first improvement to the communication complexity for this application over generic results (such as Yao's garbled circuit protocol) and, as such, is interesting as a contribution to the theory of communication efficiency for secure two-party and multiparty applications.

show abstract

Multi-party Indirect Indexing and Applications

Cited by 8 publications

References 35 publications

Toward Practical Secure Stable Matching

Toward Practical Secure Stable Matching

How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation

Communication-Efficient Private Protocols for Longest Common Subsequence

Contact Info

Product

Resources

About