The Experts below are selected from a list of 834 Experts worldwide ranked by ideXlab platform
Tomohiko Uyematsu - One of the best experts on this subject based on the ideXlab platform.
-
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2020Co-Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdropper's random variable are statistically independent. There are three kinds of Security criteria for the key distilled by the privacy amplification: the normalized divergence Criterion, which is also known as the weak Security Criterion, the variational distance Criterion, and the divergence Criterion, which is also known as the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for the privacy amplification if we employ the criteria other than the weak one.Comment: 10 pages, no figure, A part of this paper will be presented at 2009 IEEE International Symposium on Information Theory in Seoul, Korea. Version 2 is a published version. The results are not changed from version 1. Explanations are polished and some references are added. In version 3, only style and DOI are edite
-
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2010Co-Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:Privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdropper's random variable are statistically independent. There are three kinds of Security criteria for the key distilled by privacy amplification: the normalized divergence Criterion, which is also known as the weak Security Criterion, the variational distance Criterion, and the divergence Criterion, which is also known as the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for privacy amplification if we employ the criteria other than the weak one.
-
ISIT - Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
2009 IEEE International Symposium on Information Theory, 2009Co-Authors: Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a hash function so that the distilled key and an eavesdropper's random variable is statistically independent. There are two kinds of Security criteria for the key distilled by the privacy amplification: the weak Security Criterion and the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a hash function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a hash function for the privacy amplification if we employ the strong Security Criterion.
-
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
2009 IEEE International Symposium on Information Theory, 2009Co-Authors: Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a hash function so that the distilled key and an eavesdropper's random variable is statistically independent. There are two kinds of Security criteria for the key distilled by the privacy amplification: the weak Security Criterion and the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a hash function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a hash function for the privacy amplification if we employ the strong Security Criterion.
Ryutaroh Matsumoto - One of the best experts on this subject based on the ideXlab platform.
-
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2020Co-Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdropper's random variable are statistically independent. There are three kinds of Security criteria for the key distilled by the privacy amplification: the normalized divergence Criterion, which is also known as the weak Security Criterion, the variational distance Criterion, and the divergence Criterion, which is also known as the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for the privacy amplification if we employ the criteria other than the weak one.Comment: 10 pages, no figure, A part of this paper will be presented at 2009 IEEE International Symposium on Information Theory in Seoul, Korea. Version 2 is a published version. The results are not changed from version 1. Explanations are polished and some references are added. In version 3, only style and DOI are edite
-
Strong Security and separated code constructions for the broadcast channels with confidential messages
arXiv: Information Theory, 2010Co-Authors: Ryutaroh Matsumoto, Masahito HayashiAbstract:AbstractThe strong Security Criterion in the information theoretic Security re-quires the mutual information between the secret information and the eaves-dropped information converges to zero as the code length goes to the infinity,even when the mutual information is not divided by the code length, whilethe weak Security Criterion requires only the mutual information divided bythe code length converges to zero. The capacity region of the broadcastchannels with confidential messages remains unknown when th e strong se-curity is required. We prove that the capacity region under the strong secu-rity Criterion is the same as that under the weak one. Our proof techniqueattaches inverses of hash functions to a random coding argument for thebroadcast channel with degraded message sets, whose analysis on the de-coding error probability is carried over to our proof without change. Thus,our proof technique separates the analysis of secrecy from that of decod-ing error probability, and an advance in the upper bound on the decodingerror probability over the broadcast channels with degraded message setsautomatically also advances the decoding probability analysis of our prooftechnique.
-
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2010Co-Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:Privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdropper's random variable are statistically independent. There are three kinds of Security criteria for the key distilled by privacy amplification: the normalized divergence Criterion, which is also known as the weak Security Criterion, the variational distance Criterion, and the divergence Criterion, which is also known as the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for privacy amplification if we employ the criteria other than the weak one.
-
A construction of universal secure network coding
arXiv: Information Theory, 2010Co-Authors: Ryutaroh MatsumotoAbstract:We construct a universal secure network coding. Our construction just modifies the transmission scheme at the source node and works with every linear coding at an intermediate node. We relax the Security Criterion such that the mutual information between the message and the eavesdropped signal is sufficiently small instead of strictly zero. Our construction allows the set of eavesdropped links to change at each time slot.
-
ISIT - Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
2009 IEEE International Symposium on Information Theory, 2009Co-Authors: Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a hash function so that the distilled key and an eavesdropper's random variable is statistically independent. There are two kinds of Security criteria for the key distilled by the privacy amplification: the weak Security Criterion and the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a hash function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a hash function for the privacy amplification if we employ the strong Security Criterion.
Shun Watanabe - One of the best experts on this subject based on the ideXlab platform.
-
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2020Co-Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdropper's random variable are statistically independent. There are three kinds of Security criteria for the key distilled by the privacy amplification: the normalized divergence Criterion, which is also known as the weak Security Criterion, the variational distance Criterion, and the divergence Criterion, which is also known as the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for the privacy amplification if we employ the criteria other than the weak one.Comment: 10 pages, no figure, A part of this paper will be presented at 2009 IEEE International Symposium on Information Theory in Seoul, Korea. Version 2 is a published version. The results are not changed from version 1. Explanations are polished and some references are added. In version 3, only style and DOI are edite
-
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2010Co-Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:Privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdropper's random variable are statistically independent. There are three kinds of Security criteria for the key distilled by privacy amplification: the normalized divergence Criterion, which is also known as the weak Security Criterion, the variational distance Criterion, and the divergence Criterion, which is also known as the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for privacy amplification if we employ the criteria other than the weak one.
-
ISIT - Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
2009 IEEE International Symposium on Information Theory, 2009Co-Authors: Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a hash function so that the distilled key and an eavesdropper's random variable is statistically independent. There are two kinds of Security criteria for the key distilled by the privacy amplification: the weak Security Criterion and the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a hash function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a hash function for the privacy amplification if we employ the strong Security Criterion.
-
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
2009 IEEE International Symposium on Information Theory, 2009Co-Authors: Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko UyematsuAbstract:The privacy amplification is a technique to distill a secret key from a random variable by a hash function so that the distilled key and an eavesdropper's random variable is statistically independent. There are two kinds of Security criteria for the key distilled by the privacy amplification: the weak Security Criterion and the strong Security Criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a hash function for the privacy amplification if we employ the weak Security Criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a hash function for the privacy amplification if we employ the strong Security Criterion.
Alexander Vardy - One of the best experts on this subject based on the ideXlab platform.
-
ISIT - A new polar coding scheme for strong Security on wiretap channels
2013 IEEE International Symposium on Information Theory, 2013Co-Authors: Eren Sasoglu, Alexander VardyAbstract:The problem of achieving the secrecy capacity of wiretap channels explicitly and with low complexity has been open since the work of Wyner in 1975. Recently, Mahdavifar and Vardy presented a solution to this problem, based on polar codes, for the class of symmetric and degraded wiretap channels. Their polar coding scheme achieves both Security and reliability under the weak Security Criterion, but does not guarantee reliability under the strong Security Criterion. The main difficulty in providing both strong Security and reliability using polar codes is the existence of a small number of bit-channels that are both unreliable and unsecure. In this paper, a multi-block polar coding scheme that resolves this difficulty is presented. It is shown that this coding scheme achieves the secrecy capacity of symmetric degraded wiretap channels while guaranteeing both reliability and strong Security.
-
A new polar coding scheme for strong Security on wiretap channels
IEEE International Symposium on Information Theory - Proceedings, 2013Co-Authors: Eren Sasoglu, Alexander VardyAbstract:The problem of achieving the secrecy capacity of wiretap channels explicitly and with low complexity has been open since the work of Wyner in 1975. Recently, Mahdavifar and Vardy presented a solution to this problem, based on polar codes, for the class of symmetric and degraded wiretap channels. Their polar coding scheme achieves both Security and reliability under the weak Security Criterion, but does not guarantee reliability under the strong Security Criterion. The main difficulty in providing both strong Security and reliability using polar codes is the existence of a small number of bit-channels that are both unreliable and unsecure. In this paper, a multi-block polar coding scheme that resolves this difficulty is presented. It is shown that this coding scheme achieves the secrecy capacity of symmetric degraded wiretap channels while guaranteeing both reliability and strong Security.
Sarah Johnson - One of the best experts on this subject based on the ideXlab platform.
-
RA-inspired codes for efficient information theoretic multi-path network Security
2014 International Symposium on Information Theory and its Applications, 2014Co-Authors: Tao Ye, Darryl Veitch, Sarah JohnsonAbstract:Mobile devices have multiple network interfaces, some of which have Security weaknesses, yet are used for sensitive data despite the risk of eavesdropping. We describe a data-splitting approach which, by design, maps exactly to a wiretap channel, thereby offering information theoretic Security. Being based on the deletion channel, it perfectly hides block boundaries from the eavesdropper, which enhances Security further. We provide an efficient Repeat Accumulate inspired code design, which satisfies the Security Criterion, and explore its Security rate as a function block size and other parameters.