Secure Message Transmission by Public Discussion: A Brief Survey
From MaRDI portal
Publication:3005585
DOI10.1007/978-3-642-20901-7_8zbMath1272.94003OpenAlexW2230862395MaRDI QIDQ3005585
Clint Givens, Juan A. Garay, Rafail Ostrovsky
Publication date: 8 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_8
Network protocols (68M12) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items
Broadcast (and Round) Efficient Verifiable Secret Sharing, Almost-everywhere secure computation with edge corruptions
Cites Work
- Unnamed Item
- Unnamed Item
- Fast consensus in networks of bounded degree.
- Efficient perfectly secure message transmission in synchronous networks
- Secure Message Transmission with Small Public Discussion
- Improved Fault Tolerance and Secure Computation on Sparse Networks
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- Privacy Amplification by Public Discussion
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Perfectly secure message transmission
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Generalized privacy amplification
- On Optimal Secure Message Transmission by Public Discussion
- Advances in Cryptology – CRYPTO 2004
- Tolerating linear number of faults in networks of bounded degree
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Almost-Everywhere Secure Computation
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- On Expected Constant-Round Protocols for Byzantine Agreement
