Optimal coding for streaming authentication and interactive communication

DOI10.1007/978-3-642-40084-1_15MaRDI QIDQ5891187zbMATH OpenOpenAlexFDO

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

Publication date 17 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40084-1_15

zbMATH Keywords

adversarial noiseauthenticationdata streaminteractive communicationprivate codestree codes

Mathematics Subject Classification ID

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

Recommendations

• Efficient error-correcting codes for sliding windows
• Towards optimal deterministic coding for interactive communication
• Bridging the capacity gap between interactive and one-way communication
• Efficient Error-Correcting Codes for Sliding Windows
• Optimal error rates for interactive coding. I: Adaptivity and other settings

Cited in

(6)

• Reliable communication over highly connected noisy networks
• Interactive non-malleable codes
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Capacity of interactive communication over erasure channels and channels with feedback
• Streaming Codes for Variable-Size Messages
• Efficient error-correcting codes for sliding windows

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 Q5891187)