Counting Method for Multi-party Computation over Non-abelian Groups (Q5502759): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-89641-8_12
+Normal rank
@@ Property / OpenAlex ID @@
+W2109904811
@@ Property / OpenAlex ID: W2109904811 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374918
@@ Property / cites work: Q3374918 / rank @@
+Normal rank
@@ Property / cites work @@
+Scalable Secure Multiparty Computation
@@ Property / cites work: Scalable Secure Multiparty Computation / rank @@
+Normal rank
@@ Property / cites work @@
+On Secure Multi-party Computation in Black-Box Groups
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q3787498
@@ Property / cites work: Q3787498 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-avoiding walks and trails on the 3.12<sup>2</sup> lattice
+Normal rank
@@ Property / cites work @@
+Q4783721
@@ Property / cites work: Q4783721 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2707411
@@ Property / cites work: Q2707411 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Multiparty Computation with Linear Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q4341806
@@ Property / cites work: Q4341806 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5502759