scientific article; zbMATH DE number 1759772

MaRDI QIDQ4536795zbMATH OpenFDO

Authors Yevgeniy Dodis, Silvio Micali

Publication date 28 July 2002

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies and applications (68U99)

Recommendations

• Completeness in two-party secure computation: A computational view
• Completeness in two-party secure computation: a computational view
• A unified characterization of completeness and triviality for secure function evaluation
• Theory of Cryptography
• MPC vs. SFE: Perfect Security in a Unified Corruption Model

Cited in

(12)

• Lower bounds and impossibility results for concurrent self composition
• Adaptive security of multi-party protocols, revisited
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Automata, Languages and Programming
• All complete functionalities are reversible
• Efficient perfectly secure computation with optimal resilience
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Peeking into the future: MPC resilient to super-rushing adversaries
• Is it even possible? On the parallel composition of asynchronous MPC protocols
• Fast and efficient perfectly secure network-agnostic secure computation
• PUFF: maximally \underline{p}roactive sec\underline{u}rity \underline{f}or \underline{f}ree in perfectly secure mpc with guaranteed output delivery

This page was built for publication:

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