Coding theorem for secret sharing communication systems with two noisy channels

DOI10.1109/18.30979MaRDI QIDQ3832457zbMATH OpenOpenAlexFDO

Authors Hirosuke Yamamoto

Publication date 1989

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

Full work available at URL https://semanticscholar.org/paper/cd547427921a002cecf8dcb2182de41fddd6c299

zbMATH Keywords

broadcast channelcoding theoremnoisy channelssecret sharing communication system

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On secret sharing communication systems with two or three channels
• Coding Theorems on the Threshold Scheme for a General Source
• scientific article; zbMATH DE number 1759327
• scientific article; zbMATH DE number 1095500
• Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs

Cited in

(5)

• A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
• Basics of secrecy coding
• On secret sharing communication systems with two or three channels
• Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation

This page was built for publication: Coding theorem for secret sharing communication systems with two noisy channels

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