On \(d\)-multiplicative secret sharing (Q604627): Difference between revisions

@@ Property / DOI @@
-.1007/s00145-010-9056-z
@@ Property / DOI: 10.1007/s00145-010-9056-z / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00145-010-9056-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2043307264
@@ Property / OpenAlex ID: W2043307264 / rank @@
+Normal rank
@@ Property / cites work @@
+Computationally private randomizing polynomials and their applications
+Normal rank
@@ Property / cites work @@
+Communication Complexity of Simultaneous Messages
@@ Property / cites work: Communication Complexity of Simultaneous Messages / rank @@
+Normal rank
@@ Property / cites work @@
+Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
+Normal rank
@@ Property / cites work @@
+Q5302091
@@ Property / cites work: Q5302091 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249652
@@ Property / cites work: Q4249652 / rank @@
+Normal rank
@@ Property / cites work @@
+Security and composition of multiparty cryptographic protocols
+Normal rank
@@ Property / cites work @@
+Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
+Normal rank
@@ Property / cites work @@
+Secure Computation from Random Error Correcting Codes
+Normal rank
@@ Property / cites work @@
+A Zero-One Law for Boolean Privacy
@@ Property / cites work: A Zero-One Law for Boolean Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374918
@@ Property / cites work: Q3374918 / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+OT-Combiners via Secure Computation
@@ Property / cites work: OT-Combiners via Secure Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Player simulation and general adversary structures in perfect multiparty computation
+Normal rank
@@ Property / cites work @@
+Q4737161
@@ Property / cites work: Q4737161 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549593
@@ Property / cites work: Q3549593 / rank @@
+Normal rank
@@ Property / cites work @@
+Founding Cryptography on Oblivious Transfer – Efficiently
+Normal rank
@@ Property / cites work @@
+Privacy and Communication Complexity
@@ Property / cites work: Privacy and Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Secure multi-party computation made simple
@@ Property / cites work: Secure multi-party computation made simple / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+How to share a secret
@@ Property / cites work: How to share a secret / rank @@
+Normal rank
@@ Property / cites work @@
+A Geometric Approach to Information-Theoretic Private Information Retrieval
+Normal rank
@@ Property / cites work @@
+Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
+Normal rank
@@ Property / DOI @@
+.1007/S00145-010-9056-Z
@@ Property / DOI: 10.1007/S00145-010-9056-Z / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:604627