Abstract
Rate-distortion based secrecy is introduced in communication systems recently, where security is measured by the distortion that an eavesdropper can be forced to attain when reconstructing secret source symbols from an encrypted message. To maximize the distortion, previous works show that at least an unbounded number of secret keys growing with the block length is required for general distortion measure. Instead, in this letter, we will show that if hamming distortion, i.e. symbol error probability, is considered in secrecy systems, maximal hamming distortion is achievable with only a finite and constant number of shared secret keys, no matter how long the block length grows.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
