Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
DOI10.1145/1835698.1835747zbMATH Open1315.68121OpenAlexW1982490146MaRDI QIDQ5176201FDOQ5176201
Authors: Christoph Lucas, Dominik Raub, Ueli M. Maurer 
Publication date: 2 March 2015
Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1835698.1835747
Recommendations
- Graceful degradation in multi-party computation. (Extended abstract)
- Advances in Cryptology - EUROCRYPT 2004
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Trading robustness for correctness and privacy in certain multiparty computations, beyond an honest majority
- Simple and Efficient Perfectly-Secure Asynchronous MPC
information-theoretic securityuniversal composabilitymulti-party computationcomputational securityhybrid securityparty emulation
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)
Cites Work
Cited In (7)
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Graceful degradation in multi-party computation. (Extended abstract)
- Trading robustness for correctness and privacy in certain multiparty computations, beyond an honest majority
- Insured MPC: efficient secure computation with financial penalties
- Information-theoretically secure MPC against mixed dynamic adversaries
- Advances in Cryptology - EUROCRYPT 2004
Uses Software
This page was built for publication: Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176201)
