DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, Won Taek | ko |
dc.contributor.author | Choi, Jinho | ko |
dc.contributor.author | Ha, Jeongseok | ko |
dc.date.accessioned | 2013-03-12T10:53:22Z | - |
dc.date.available | 2013-03-12T10:53:22Z | - |
dc.date.created | 2012-08-22 | - |
dc.date.created | 2012-08-22 | - |
dc.date.issued | 2012-08 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, v.7, no.4, pp.1414 - 1418 | - |
dc.identifier.issn | 1556-6013 | - |
dc.identifier.uri | http://hdl.handle.net/10203/102078 | - |
dc.description.abstract | We introduce a binary erasure wiretap channel of type II in which the number of eavesdropped bits mu becomes available a posteriori. We aim at achieving perfect secrecy over such a channel model. The most appropriate application is a secret key agreement scheme. We present a secret key agreement scheme that adopts the formulation S = HX of Wyner-Ozarows's linear coset coding. The scheme is based on the following simple observation: even if some information on a secret message S leaked out, I(S; X-mu) > 0, where X-mu is a binary sequence of length mu, it is still possible to have perfect secrecy I(S-J; X-mu) for some subsequence S-J of S. Our secret key agreement scheme achieves perfect secrecy by taking only those subsequences S-J that are independent of the eavesdropped bits X-mu. Our secret key agreement scheme naturally leads to defining a security measure D-H(mu) for parity-check matrices H such that the eavesdropper gets zero information on S-J as long as the length of S-J is less than D-H(mu). We study basic properties of D-H(mu) and prove the perfect secrecy of our key agreement scheme. For parity-check matrices of small sizes, we perform an exhaustive search for matrices maximizing D-H(mu). | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | KEY AGREEMENT | - |
dc.subject | POLAR CODES | - |
dc.subject | TAP CHANNEL | - |
dc.subject | CRYPTOGRAPHY | - |
dc.subject | INFORMATION | - |
dc.title | Perfect Secrecy Over Binary Erasure Wiretap Channel of Type II | - |
dc.type | Article | - |
dc.identifier.wosid | 000306520900026 | - |
dc.identifier.scopusid | 2-s2.0-84863959227 | - |
dc.type.rims | ART | - |
dc.citation.volume | 7 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 1414 | - |
dc.citation.endingpage | 1418 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY | - |
dc.identifier.doi | 10.1109/TIFS.2012.2199629 | - |
dc.contributor.localauthor | Ha, Jeongseok | - |
dc.contributor.nonIdAuthor | Song, Won Taek | - |
dc.contributor.nonIdAuthor | Choi, Jinho | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Coset code | - |
dc.subject.keywordAuthor | key rate | - |
dc.subject.keywordAuthor | security measure | - |
dc.subject.keywordAuthor | wiretap channel | - |
dc.subject.keywordPlus | KEY AGREEMENT | - |
dc.subject.keywordPlus | POLAR CODES | - |
dc.subject.keywordPlus | TAP CHANNEL | - |
dc.subject.keywordPlus | CRYPTOGRAPHY | - |
dc.subject.keywordPlus | INFORMATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.