Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation

DOI10.1007/978-3-662-46497-7_22MaRDI QIDQ5261691zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Oxana Poburinnaya, Shafi Goldwasser

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46497-7_22

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Adaptively Secure Two-Party Computation with Erasures
• Two-round adaptively secure multiparty computation from standard assumptions
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• One-Sided Adaptively Secure Two-Party Computation
• scientific article; zbMATH DE number 1256784
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• scientific article; zbMATH DE number 1304080
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Cited in

(22)

• Leakage resilience from program obfuscation
• Adaptively secure computation for RAM programs
• On constructing one-way permutations from indistinguishability obfuscation
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• Incentive-driven attacker for corrupting two-party protocols
• Two-round adaptively secure multiparty computation from standard assumptions
• Limits on the power of indistinguishability obfuscation and functional encryption
• Constant-round leakage-resilient zero-knowledge from collision resistance
• Better two-round adaptive multi-party computation
• On constructing one-way permutations from indistinguishability obfuscation
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Constant round adaptively secure protocols in the tamper-proof hardware model
• Adaptively Secure Two-Party Computation with Erasures
• Multiparty reusable non-interactive secure computation from LWE
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Adaptively secure MPC with sublinear communication complexity
• On Adaptively Secure Multiparty Computation with a Short CRS
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• How to obfuscate MPC inputs
• Efficient one-sided adaptively secure computation
• One-Sided Adaptively Secure Two-Party Computation

This page was built for publication: Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation

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