How to hide circuits in MPC an efficient framework for private function evaluation

DOI10.1007/978-3-642-38348-9_33MaRDI QIDQ4924432zbMATH OpenOpenAlexFDO

Authors Payman Mohassel, S. Sadeghian

Publication date 31 May 2013

Published in Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38348-9_33

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constant-round private function evaluation with linear complexity
• Actively Secure Private Function Evaluation
• Linear-Complexity Private Function Evaluation is Practical
• Making private function evaluation safer, faster, and simpler
• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions

Cited in

(23)

• Practical attacks against the walnut digital signature scheme
• Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
• Private set operations from oblivious switching
• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
• Improved zero-knowledge argument of encrypted extended permutation
• Secure multiparty computation with free branching
• Efficient and scalable universal circuits
• Secret-shared shuffle
• Maliciously circuit-private multi-key FHE and MPC based on LWE
• Constant-round private function evaluation with linear complexity
• Making private function evaluation safer, faster, and simpler
• Non-interactive secure 2PC in the offline/online and batch settings
• Circuit-private multi-key FHE
• Count me in! Extendability for threshold ring signatures
• Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion
• Linear-Complexity Private Function Evaluation is Practical
• Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
• Constant-round multiparty private function evaluation with (quasi-)linear complexities
• Scalable multi-party private set union from multi-query secret-shared private membership test
• Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
• Efficient permutation correlations and batched random access for two-party computation
• Reducing garbled circuit size while preserving circuit gate privacy
• Secret-shared shuffle from authenticated correlations

This page was built for publication: How to hide circuits in MPC an efficient framework for private function evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924432)