Paper Info
Title
On the separation of encryption and compression in secure distributed source coding
Abstract
We study a secure distributed source coding problem. Two terminals with correlated observations would like to send their observations securely to a receiver using minimal transmission rates and key rates. By providing a converse, we show the optimality of a natural structure, in which Slepian-Wolf distributed compression is followed by an application of a onetime pad for encryption. Hence, in contrast to many multiuser setting, the separation of compression and encryption is optimal for this particular case. The optimality of the separation can simplify practical algorithm design. In addition, we constructively demonstrate that switching the order of compression and encryption does not incur any performance loss. Finally, we show that if one requires perfect secrecy and zero error probability, the required rates increase significantly and data compression becomes unnecessary.
Year
DOI
Venue
2011
10.1109/ITW.2011.6089527
ITW
Keywords
Field
DocType
cryptography,multiuser setting,transmission rates,slepian-wolf distributed compression,data compression,secure distributed source coding,encryption,source coding,zero error probability,error statistics,key rates,error probability,algorithm design,decoding,distributed source coding,source code
Cryptography,Computer science,Theoretical computer science,Encryption,Distributed source coding,Information-theoretic security,Probabilistic encryption,Data compression,Variable-length code,Context-adaptive binary arithmetic coding
Conference
ISBN
Citations 
PageRank 
978-1-4577-0438-3
2
0.43
References 
Authors
2
3
Name
Order
Citations
PageRank
Siu-Wai Ho119526.35
Lifeng Lai22289167.78
Alex J. Grant374861.08