How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
From MaRDI portal
Publication:4924432
DOI10.1007/978-3-642-38348-9_33zbMath1312.94081OpenAlexW84835382MaRDI QIDQ4924432
Payman Mohassel, Saeed Sadeghian
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_33
Related Items (14)
Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Practical attacks against the walnut digital signature scheme ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Secure multiparty computation with free branching ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Efficient and scalable universal circuits ⋮ Count me in! Extendability for threshold ring signatures ⋮ Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion ⋮ Secret-shared shuffle ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ Circuit-Private Multi-key FHE ⋮ Private set operations from oblivious switching ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings
This page was built for publication: How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
