Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-20901-7_8
+Normal rank
@@ Property / OpenAlex ID @@
+W2230862395
@@ Property / OpenAlex ID: W2230862395 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
+Normal rank
@@ Property / cites work @@
+Generalized privacy amplification
@@ Property / cites work: Generalized privacy amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Privacy Amplification by Public Discussion
@@ Property / cites work: Privacy Amplification by Public Discussion / rank @@
+Normal rank
@@ Property / cites work @@
+Fast consensus in networks of bounded degree.
@@ Property / cites work: Fast consensus in networks of bounded degree. / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Fault Tolerance and Secure Computation on Sparse Networks
+Normal rank
@@ Property / cites work @@
+Perfectly secure message transmission
@@ Property / cites work: Perfectly secure message transmission / rank @@
+Normal rank
@@ Property / cites work @@
+Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
+Normal rank
@@ Property / cites work @@
+Towards Optimal and Efficient Perfectly Secure Message Transmission
+Normal rank
@@ Property / cites work @@
+An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
+Normal rank
@@ Property / cites work @@
+Q4249650
@@ Property / cites work: Q4249650 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure Message Transmission with Small Public Discussion
+Normal rank
@@ Property / cites work @@
+Fully Polynomial Byzantine Agreement for <i>n</i> &gt; 3<i>t</i> Processors in <i>t</i> + 1 Rounds
+Normal rank
@@ Property / cites work @@
+Almost-Everywhere Secure Computation
@@ Property / cites work: Almost-Everywhere Secure Computation / rank @@
+Normal rank
@@ Property / cites work @@
+On Expected Constant-Round Protocols for Byzantine Agreement
+Normal rank
@@ Property / cites work @@
+Almost Secure (1-Round, n-Channel) Message Transmission Scheme
+Normal rank
@@ Property / cites work @@
+Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
+Normal rank
@@ Property / cites work @@
+Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
+Normal rank
@@ Property / cites work @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Reaching Agreement in the Presence of Faults
@@ Property / cites work: Reaching Agreement in the Presence of Faults / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient perfectly secure message transmission in synchronous networks
+Normal rank
@@ Property / cites work @@
+On Optimal Secure Message Transmission by Public Discussion
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology – CRYPTO 2004
@@ Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Tolerating linear number of faults in networks of bounded degree
+Normal rank