scientific article; zbMATH DE number 1759772
From MaRDI portal
Publication:4536795
zbMATH Open0989.68555MaRDI QIDQ4536795FDOQ4536795
Authors: Yevgeniy Dodis, Silvio Micali 
Publication date: 28 July 2002
Title of this publication is not available (Why is that?)
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
Computing methodologies and applications (68U99) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (7)
- Efficient perfectly secure computation with optimal resilience
- All complete functionalities are reversible
- Automata, Languages and Programming
- A full proof of the BGW protocol for perfectly secure multiparty computation
- 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
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)
