On the Necessary and Sufficient Assumptions for UC Computation (Q3408190): Difference between revisions

@@ Property / cites work @@
+Q4940695
@@ Property / cites work: Q4940695 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4783717
@@ Property / cites work: Q4783717 / rank @@
+Normal rank
@@ Property / cites work @@
+Resettable zero-knowledge (extended abstract)
@@ Property / cites work: Resettable zero-knowledge (extended abstract) / rank @@
+Normal rank
@@ Property / cites work @@
+Universally composable two-party and multi-party secure computation
+Normal rank
@@ Property / cites work @@
+Q4035738
@@ Property / cites work: Q4035738 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-interactive and reusable non-malleable commitment schemes
+Normal rank
@@ Property / cites work @@
+Founding Cryptography on Oblivious Transfer – Efficiently
+Normal rank
@@ Property / cites work @@
+Q5750403
@@ Property / cites work: Q5750403 / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility results for universal composability in public-key models and with fixed inputs
+Normal rank
@@ Property / cites work @@
+A unified framework for concurrent security
@@ Property / cites work: A unified framework for concurrent security / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
+Normal rank
@@ Property / cites work @@
+Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
+Normal rank
@@ Property / cites work @@
+Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank