Optimal Coding for Streaming Authentication and Interactive Communication
Matthew K. Franklin,Ran Gelles,Rafail Ostrovsky,Leonard J. Schulman +3 more
- pp 258-276
Reads0
Chats0
TLDR
This work considers the task of communicating a data stream over a channel with adversarial noise, and constructs a (nonefficient) constant-rate interactive protocol that succeeds with overwhelming probability against noise rates up to 1/2, and proves that no constant- rate protocol can withstand noise rates > 1/1.Abstract:
Error correction and message authentication are well studied in the literature, and various efficient solutions have been suggested and analyzed. This is however not the case for data streams in which the message is very long, possibly infinite, and not known in advance to the sender. Trivial solutions for error-correcting and authenticating data streams either suffer from a long delay at the receiver’s end or cannot perform well when the communication channel is noisy.read more
Citations
More filters
Proceedings ArticleDOI
Towards coding for maximum errors in interactive communication
Mark Braverman,Anup Rao +1 more
TL;DR: It is shown that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 - ϵ) fraction of all symbols transmitted by the parties are corrupted adversarially, at a cost of increasing the communication in the protocol by a multiplicative factor that depends only on ϵ.
Proceedings ArticleDOI
Optimal error rates for interactive coding I: adaptivity and other settings
TL;DR: In this article, the authors consider the task of interactive communication in the presence of adversarial errors and present tight bounds on the tolerable error-rates in a number of different settings, including adaptive interactive communication where the communicating parties decide who should speak next based on the history of the interaction.
Book
Coding for Interactive Communication: A Survey
TL;DR: Coding for interactive communication as mentioned in this paper augments coding theory to the interactive setting: instead of communicating a message from a sender to a receiver, here the parties are involved in an interacti...
Journal ArticleDOI
Efficient Coding for Interactive Communication
TL;DR: It is shown that a randomly generated tree code is an efficiently decodable potent tree code with overwhelming probability and is able to partially derandomize this result by means of epsilon-biased distributions using only O(N) random bits, where N is the depth of the tree.
Proceedings ArticleDOI
Interactive Channel Capacity Revisited
TL;DR: In this paper, the authors provided the first capacity approaching coding schemes that robustly simulate any interactive protocol over an adversarial channel that corrupts any eps fraction of the transmitted symbols.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Proceedings ArticleDOI
Efficient authentication and signing of multicast streams over lossy channels
TL;DR: This work proposes two efficient schemes, TESLA and EMSS, for secure lossy multicast streams, and offers sender authentication, strong loss robustness, high scalability and minimal overhead at the cost of loose initial time synchronization and slightly delayed authentication.
Journal ArticleDOI
On-line/off-line digital signatures
TL;DR: A new type of signature scheme, which consists of two phases, which is supposed to be very fast, is proposed, which uses one-time signature schemes, which are very fast for the on-line signing and an ordinary signature scheme is used for the off-line stage.
Journal ArticleDOI
Codes which detect deception
TL;DR: If the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1, and several encoding functions Φ(.,.) are given, some of which achieve this bound.