Secure multi-party computation
From MaRDI portal
Collections of articles of miscellaneous specific interest (00B15) Data encryption (aspects in computer science) (68P25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Cryptography (94A60)
Recommendations
- Secure multiparty computation and secret sharing
- Recent results in scalable multi-party computation
- Multiparty computation, an introduction
- scientific article; zbMATH DE number 1952886
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
Cited in
(25)- Perfect secure computation in two rounds
- A theoretical and empirical evaluation of an algorithm for self-healing computation
- Secure non-interactive simulation: feasibility and rate
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Size-Hiding Computation for Multiple Parties
- An equational approach to secure multi-party computation
- Secure Multi-party Shuffling
- scientific article; zbMATH DE number 5283568 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1303136 (Why is no real title available?)
- On the inner product predicate and a generalization of matching vector families
- scientific article; zbMATH DE number 7267018 (Why is no real title available?)
- Secure Multi-Party Computation for Elliptic Curves
- Three-party quantum summation without a trusted third party
- Secure multiparty computation and secret sharing
- Secure Multiparty Computation
- Secure non-interactive simulation from arbitrary joint distributions
- Secure non-interactive reducibility is decidable
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
- Optimally-fair multi-party exchange without trusted parties
- Additive randomized encodings from public key encryption
- Efficient secure two-party protocols. Techniques and constructions
This page was built for publication: Secure multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841734)
