Two-round maliciously secure computation with super-polynomial simulation

DOI10.1007/978-3-030-90459-3_22MaRDI QIDQ2695653zbMATH OpenOpenAlexFDO

Authors Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_22

zbMATH Keywords

two-round multi-party conditional disclosure of secrets

Mathematics Subject Classification ID

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

Recommendations

• Round optimal concurrent MPC via strong simulation
• Two-round multiparty secure computation from minimal assumptions
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• Perfect secure computation in two rounds

Cites work

• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 1775399 (Why is no real title available?)
• A new approach to round-optimal secure multiparty computation
• A proof of security of Yao's protocol for two-party computation
• Adaptive One-Way Functions and Applications
• Advances in Cryptology – CRYPTO 2004
• Computationally private randomizing polynomials and their applications
• Definitions and properties of zero-knowledge proof systems
• Distinguisher-dependent simulation in two rounds and its applications
• Efficient Round Optimal Blind Signatures
• Four round secure computation without setup
• Mr NISC: multiparty reusable non-interactive secure computation
• Multiparty reusable non-interactive secure computation from LWE
• New and improved key-homomorphic pseudorandom functions
• New notions of security: achieving universal composability without trusted setup
• Non-interactive Zaps and New Techniques for NIZK
• Non-interactive non-malleability from quantum supremacy
• One-message zero knowledge and non-malleable commitments
• Perfect Non-interactive Zero Knowledge for NP
• Promise zero knowledge and its applications to round optimal MPC
• Reusable two-round MPC from DDH
• Round optimal blind signatures
• Round optimal concurrent MPC via strong simulation
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal secure multi-party computation
• Succinct non-interactive secure computation
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Two-round multiparty secure computation from minimal assumptions
• Two-round secure MPC from indistinguishability obfuscation
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

Cited in

(4)

• Round-optimal black-box secure computation from two-round malicious OT
• Round optimal concurrent MPC via strong simulation
• Two-round concurrent 2PC from sub-exponential LWE
• Maliciously-secure MrNISC in the plain model

This page was built for publication: Two-round maliciously secure computation with super-polynomial simulation

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