The Experts below are selected from a list of 201 Experts worldwide ranked by ideXlab platform
Zhong Chen - One of the best experts on this subject based on the ideXlab platform.
-
scalable byzantine fault tolerant public Key Authentication for peer to peer networks
European Conference on Parallel Processing, 2008Co-Authors: Ruichuan Chen, Liyong Tang, Jianbin Hu, Zhong ChenAbstract:Peer-to-Peer (P2P) communication model has the potential to harness huge amounts of resources. However, due to the self-organizing and self-maintaining nature, current P2P networks suffer from various kinds of attacks. Public Key Authentication can provide a fundamental building block for P2P communication security. In this paper, we propose a scalable Byzantine fault tolerant public Key Authentication scheme for P2P networks, in which each participating peer dynamically maintains a trusted group to perform distributed challenge-response Authentication without centralized infrastructure. To guarantee the Authentication correctness, we additionally present a complementary trusted group maintenance scheme. The experimental results demonstrate that our Authentication scheme can work in various different P2P scenarios effectively and efficiently.
Ruichuan Chen - One of the best experts on this subject based on the ideXlab platform.
-
scalable byzantine fault tolerant public Key Authentication for peer to peer networks
European Conference on Parallel Processing, 2008Co-Authors: Ruichuan Chen, Liyong Tang, Jianbin Hu, Zhong ChenAbstract:Peer-to-Peer (P2P) communication model has the potential to harness huge amounts of resources. However, due to the self-organizing and self-maintaining nature, current P2P networks suffer from various kinds of attacks. Public Key Authentication can provide a fundamental building block for P2P communication security. In this paper, we propose a scalable Byzantine fault tolerant public Key Authentication scheme for P2P networks, in which each participating peer dynamically maintains a trusted group to perform distributed challenge-response Authentication without centralized infrastructure. To guarantee the Authentication correctness, we additionally present a complementary trusted group maintenance scheme. The experimental results demonstrate that our Authentication scheme can work in various different P2P scenarios effectively and efficiently.
Blum Rick - One of the best experts on this subject based on the ideXlab platform.
-
Secret Key Authentication capacity region, Part I: average Authentication rate
2020Co-Authors: Perazzone Jake, Graves Eric, Yu Paul, Blum RickAbstract:This paper investigates the secret Key Authentication capacity region. Specifically, the focus is on a model where a source must transmit information over an adversary controlled channel where the adversary, prior to the source's transmission, decides whether or not to replace the destination's observation with an arbitrary one of their choosing (done in hopes of having the destination accept a false message). To combat the adversary, the source and destination share a secret Key which they may use to guarantee authenticated communications. The secret Key Authentication capacity region here is then defined as the region of jointly achievable message rate, Authentication rate, and Key consumption rate (i.e., how many bits of secret Key are needed). This is the first of a two part study, with the parts differing in how the Authentication rate is measured. In this first study the authenticated rate is measured by the traditional metric of the maximum expected probability of false Authentication. For this metric, we provide an inner bound which improves on those existing in the literature. This is achieved by adopting and merging different classical techniques in novel ways. Within these classical techniques, one technique derives Authentication capability directly from the noisy communications channel, and the other technique derives its' Authentication capability directly from obscuring the source.Comment: First of a two part paper. Large text overlap in introductions. Submitted for possible publicatio
-
Secret Key Authentication capacity region, Part II: typical Authentication rate
2020Co-Authors: Graves Eric, Perazzone Jake, Yu Paul, Blum RickAbstract:This paper investigates the secret Key Authentication capacity region. Specifically, the focus is on a model where a source must transmit information over an adversary controlled channel where the adversary, prior to the source's transmission, decides whether or not to replace the destination's observation with an arbitrary one of their choosing (done in hopes of having the destination accept a false message). To combat the adversary, the source and destination share a secret Key which they may use to guarantee authenticated communications. The secret Key Authentication capacity region here is then defined as the region of jointly achievable message rate, Authentication rate, and Key consumption rate (i.e., how many bits of secret Key are needed). This is the second of a two part study, with the studies separated by how the Authentication rate is measured. Here, the Authentication rate is measured by the minimum of the maximum probability of false acceptance where the minimization is over all highly probable subsets of observations at the adversary. That is, consider the maximum probability of false Authentication as a function of the adversary's observation, and the adversary's observation as a random variable. The Authentication rate is then measured as the smallest number for which the probability that the maximum probability of false Authentication is greater than said number is arbitrary small. This is termed typical Authentication, since it only needs to consider adversarial observations which are typical with the transmission. Under this measure of Authentication matching inner and outer bounds are determined.Comment: Second of a two part paper. Large text overlap in introductions. Submitted for possible publicatio
Jianbin Hu - One of the best experts on this subject based on the ideXlab platform.
-
scalable byzantine fault tolerant public Key Authentication for peer to peer networks
European Conference on Parallel Processing, 2008Co-Authors: Ruichuan Chen, Liyong Tang, Jianbin Hu, Zhong ChenAbstract:Peer-to-Peer (P2P) communication model has the potential to harness huge amounts of resources. However, due to the self-organizing and self-maintaining nature, current P2P networks suffer from various kinds of attacks. Public Key Authentication can provide a fundamental building block for P2P communication security. In this paper, we propose a scalable Byzantine fault tolerant public Key Authentication scheme for P2P networks, in which each participating peer dynamically maintains a trusted group to perform distributed challenge-response Authentication without centralized infrastructure. To guarantee the Authentication correctness, we additionally present a complementary trusted group maintenance scheme. The experimental results demonstrate that our Authentication scheme can work in various different P2P scenarios effectively and efficiently.
Liyong Tang - One of the best experts on this subject based on the ideXlab platform.
-
scalable byzantine fault tolerant public Key Authentication for peer to peer networks
European Conference on Parallel Processing, 2008Co-Authors: Ruichuan Chen, Liyong Tang, Jianbin Hu, Zhong ChenAbstract:Peer-to-Peer (P2P) communication model has the potential to harness huge amounts of resources. However, due to the self-organizing and self-maintaining nature, current P2P networks suffer from various kinds of attacks. Public Key Authentication can provide a fundamental building block for P2P communication security. In this paper, we propose a scalable Byzantine fault tolerant public Key Authentication scheme for P2P networks, in which each participating peer dynamically maintains a trusted group to perform distributed challenge-response Authentication without centralized infrastructure. To guarantee the Authentication correctness, we additionally present a complementary trusted group maintenance scheme. The experimental results demonstrate that our Authentication scheme can work in various different P2P scenarios effectively and efficiently.
