Active security in multiparty computation over black-box groups

DOI10.1007/978-3-642-32928-9_28MaRDI QIDQ2912815zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Josef Pieprzyk, Ron Steinfeld, Yvo Desmedt

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://eprints.qut.edu.au/69687/2/Authors_draft_Pieprzyk.pdf

zbMATH Keywords

graph colouringmulti-party computationnon-abelian groupblack-boxactive securitygeneral adversary structures

Mathematics Subject Classification ID

Cryptography (94A60) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On Secure Multi-party Computation in Black-Box Groups
• scientific article; zbMATH DE number 1842487
• Scalable and Unconditionally Secure Multiparty Computation
• Multiparty computation for dishonest majority: from passive to active security at low cost
• scientific article; zbMATH DE number 1808209

Cited in

(6)

• Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups
• On Secure Multi-party Computation in Black-Box Groups
• Graph coloring applied to secure computation in non-abelian groups
• Counting Method for Multi-party Computation over Non-abelian Groups
• A subexponential construction of graph coloring for multiparty computation
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups

This page was built for publication: Active security in multiparty computation over black-box groups

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