Secure distributed source coding with side-information

This letter develops codes for the scenario in which users with correlated messages are to encipher and compress their messages without collaboration and without the use of cryptographic keys or other secret materials. We consider an eavesdropper that has access to an encoded message and in addition...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 12; no. 4; pp. 310 - 312
Main Authors: Luh, W., Kundur, D.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.04.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Application software
Applied sciences
Coding
Coding, codes
Collaboration
Correlation
Cryptography
Decoding
Encoding
Exact sciences and technology
Galois fields
Information, signal and communications theory
Keys
Meetings
Messages
Performance analysis
Power engineering and energy
Reed-Solomon codes
Secret
Signal and communications theory
Source coding
Symbols
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Reed Solomon code
Performance evaluation
Source coding
distributed source coding
Distributed source signal
Security of data
Reed- Solomon codes
Cryptography
Security
Algorithm
Secrecy
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter develops codes for the scenario in which users with correlated messages are to encipher and compress their messages without collaboration and without the use of cryptographic keys or other secret materials. We consider an eavesdropper that has access to an encoded message and in addition, some side-information in the form of uncoded symbols corresponding to the encoded message. Our codes are an extension of distributed source coding using syndromes (DISCUS) with the additional requirement of providing secrecy for the scenario described above. We state a secrecy condition that the subcodes of DISCUS must satisfy, and develop a general encoding algorithm meeting these conditions. We analyze the performance of the proposed code for the case of multiple eavesdropped messages.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2008.080070.