Constant-round black-box construction of composable multi-party computation protocol

DOI10.1007/978-3-642-54242-8_15MaRDI QIDQ5746344zbMATH OpenOpenAlexFDO

Authors Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Publication date 18 February 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-54242-8_15

Mathematics Subject Classification ID

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

Recommendations

• Round-efficient black-box construction of composable multi-party computation
• Round-efficient black-box construction of composable multi-party computation
• Round-optimal secure multi-party computation
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Black-box constructions of composable protocols without set-up

Cited in

(24)

• Unbounded ABE via bilinear entropy expansion, revisited
• A new approach to black-box concurrent secure computation
• Round-efficient black-box construction of composable multi-party computation
• A black-box construction of non-malleable encryption from semantically secure encryption
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• Round-optimal black-box commit-and-prove with succinct communication
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Improved, black-box, non-malleable encryption from semantic security
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• Adaptive hardness and composable security in the plain model from standard assumptions
• Round-efficient black-box construction of composable multi-party computation
• Black-box constructions of composable protocols without set-up
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Round-optimal black-box two-party computation
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Concurrently composable security with shielded super-polynomial simulators
• On the exact round complexity of self-composable two-party computation
• Maliciously-secure MrNISC in the plain model
• Round-optimal black-box secure computation from two-round malicious OT
• Concurrently composable non-interactive secure computation
• Two-round concurrent 2PC from sub-exponential LWE
• Improved black-box constructions of composable secure computation
• Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH

This page was built for publication: Constant-round black-box construction of composable multi-party computation protocol

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