Secure Multi-party Computation: Information Flow of Outputs and Game Theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1024014
- Rationality and Adversarial Behavior in Multi-party Computation
- Multiparty computation secure against continual memory leakage
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security against covert adversaries: Efficient protocols for realistic adversaries
Cites work
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A lattice model of secure information flow
- A new approach to practical active-secure two-party computation
- A proof of security of Yao's protocol for two-party computation
- A semantic approach to secure information flow
- Algebraic foundations for quantitative information flow
- Better preprocessing for secure multiparty computation
- Cryptography made simple
- Enumeration of Nash equilibria for two-player games
- How to share a secret
- scientific article; zbMATH DE number 1759770 (Why is no real title available?)
- scientific article; zbMATH DE number 1878568 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Multiparty Computation from Somewhat Homomorphic Encryption
- On the Foundations of Quantitative Information Flow
- Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6--10, 2015
- Quantitative information flow as safety and liveness hyperproperties
- Secure multiparty computation and secret sharing
- Secure multiparty computation goes live
Cited in
(5)
This page was built for publication: Secure Multi-party Computation: Information Flow of Outputs and Game Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304808)
