Secure Protocol Transformations (Q2829224): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-53008-5_15
+Normal rank
@@ Property / OpenAlex ID @@
+W2495326230
@@ Property / OpenAlex ID: W2495326230 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Algebraic Formulas Using a Constant Number of Registers
+Normal rank
@@ Property / cites work @@
+Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (log             <i>n</i>             ) expected rounds randomized byzantine generals protocol
+Normal rank
@@ Property / cites work @@
+Unconditionally-Secure Robust Secret Sharing with Compact Shares
+Normal rank
@@ Property / cites work @@
+Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
+Normal rank
@@ Property / cites work @@
+Q4250770
@@ Property / cites work: Q4250770 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4783743
@@ Property / cites work: Q4783743 / rank @@
+Normal rank
@@ Property / cites work @@
+Scalable Secure Multiparty Computation
@@ Property / cites work: Scalable Secure Multiparty Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
+Normal rank
@@ Property / cites work @@
+Circuits resilient to additive attacks with applications to secure computation
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+On the Power of Secure Two-Party Computation
@@ Property / cites work: On the Power of Secure Two-Party Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
+Normal rank
@@ Property / cites work @@
+Q3549593
@@ Property / cites work: Q3549593 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure Multi-Party Computation with Identifiable Abort
+Normal rank
@@ Property / cites work @@
+Founding Cryptography on Oblivious Transfer – Efficiently
+Normal rank
@@ Property / cites work @@
+Secure Arithmetic Computation with No Honest Majority
+Normal rank
@@ Property / cites work @@
+Systematizing Secure Computation for Research and Decision Support
+Normal rank
@@ Property / cites work @@
+Must You Know the Code of f to Securely Compute f?
+Normal rank
@@ Property / cites work @@
+How to share a secret
@@ Property / cites work: How to share a secret / rank @@
+Normal rank