Optimal Coding for Streaming Authentication and Interactive Communication

DOI10.1109/TIT.2014.2367094MaRDI QIDQ5892401zbMATH OpenFDO

Authors Matthew Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2014.2367094

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29) Authentication, digital signatures and secret sharing (94A62)

Cited in

(11)

• scientific article; zbMATH DE number 7564410 (Why is no real title available?)
• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Efficient error-correcting codes for sliding windows
• Noisy interactive quantum communication
• Capacity of interactive communication over erasure channels and channels with feedback
• Streaming Codes for Variable-Size Messages
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Interactive coding with unbounded noise
• Making Asynchronous Distributed Computations Robust to Channel Noise

This page was built for publication: Optimal Coding for Streaming Authentication and Interactive Communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892401)