The Experts below are selected from a list of 35097 Experts worldwide ranked by ideXlab platform
Dong Hoon Lee - One of the best experts on this subject based on the ideXlab platform.
-
trapdoor Security in a searchable public key encryption scheme with a designated tester
Journal of Systems and Software, 2010Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:We study a secure searchable public-key encryption scheme with a designated tester (dPEKS). The contributions of this paper are threefold. First, we enhance the existing Security model to incorporate the realistic abilities of dPEKS attackers. Second, we introduce the concept of ''trapdoor indistinguishability'' and show that trapdoor indistinguishability is a sufficient condition for thwarting keyword-guessing attacks. This answers the open problem of how to construct PEKS (dPEKS) schemes that are provably secure against keyword-guessing attacks. Finally, we propose a dPEKS scheme that is secure in the Enhanced Security model. The scheme is the first dPEKS scheme that is secure against keyword-guessing attacks.
-
improved searchable public key encryption with designated tester
Computer and Communications Security, 2009Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:Recently, Baek et al. proposed an efficient public key encryption scheme with keyword search based on the scheme of Boneh et al., However, the Security model of Baek et al. seriously limits the ability of the adversary. In this paper, we enhance the Security model of the public key encryption with keyword search to properly incorporate the ability of an adversary. We also construct a public key encryption scheme with keyword search secure in the Enhanced Security model.
Hyun Sook Rhee - One of the best experts on this subject based on the ideXlab platform.
-
trapdoor Security in a searchable public key encryption scheme with a designated tester
Journal of Systems and Software, 2010Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:We study a secure searchable public-key encryption scheme with a designated tester (dPEKS). The contributions of this paper are threefold. First, we enhance the existing Security model to incorporate the realistic abilities of dPEKS attackers. Second, we introduce the concept of ''trapdoor indistinguishability'' and show that trapdoor indistinguishability is a sufficient condition for thwarting keyword-guessing attacks. This answers the open problem of how to construct PEKS (dPEKS) schemes that are provably secure against keyword-guessing attacks. Finally, we propose a dPEKS scheme that is secure in the Enhanced Security model. The scheme is the first dPEKS scheme that is secure against keyword-guessing attacks.
-
improved searchable public key encryption with designated tester
Computer and Communications Security, 2009Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:Recently, Baek et al. proposed an efficient public key encryption scheme with keyword search based on the scheme of Boneh et al., However, the Security model of Baek et al. seriously limits the ability of the adversary. In this paper, we enhance the Security model of the public key encryption with keyword search to properly incorporate the ability of an adversary. We also construct a public key encryption scheme with keyword search secure in the Enhanced Security model.
Jong Hwan Park - One of the best experts on this subject based on the ideXlab platform.
-
trapdoor Security in a searchable public key encryption scheme with a designated tester
Journal of Systems and Software, 2010Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:We study a secure searchable public-key encryption scheme with a designated tester (dPEKS). The contributions of this paper are threefold. First, we enhance the existing Security model to incorporate the realistic abilities of dPEKS attackers. Second, we introduce the concept of ''trapdoor indistinguishability'' and show that trapdoor indistinguishability is a sufficient condition for thwarting keyword-guessing attacks. This answers the open problem of how to construct PEKS (dPEKS) schemes that are provably secure against keyword-guessing attacks. Finally, we propose a dPEKS scheme that is secure in the Enhanced Security model. The scheme is the first dPEKS scheme that is secure against keyword-guessing attacks.
-
improved searchable public key encryption with designated tester
Computer and Communications Security, 2009Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:Recently, Baek et al. proposed an efficient public key encryption scheme with keyword search based on the scheme of Boneh et al., However, the Security model of Baek et al. seriously limits the ability of the adversary. In this paper, we enhance the Security model of the public key encryption with keyword search to properly incorporate the ability of an adversary. We also construct a public key encryption scheme with keyword search secure in the Enhanced Security model.
Willy Susilo - One of the best experts on this subject based on the ideXlab platform.
-
trapdoor Security in a searchable public key encryption scheme with a designated tester
Journal of Systems and Software, 2010Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:We study a secure searchable public-key encryption scheme with a designated tester (dPEKS). The contributions of this paper are threefold. First, we enhance the existing Security model to incorporate the realistic abilities of dPEKS attackers. Second, we introduce the concept of ''trapdoor indistinguishability'' and show that trapdoor indistinguishability is a sufficient condition for thwarting keyword-guessing attacks. This answers the open problem of how to construct PEKS (dPEKS) schemes that are provably secure against keyword-guessing attacks. Finally, we propose a dPEKS scheme that is secure in the Enhanced Security model. The scheme is the first dPEKS scheme that is secure against keyword-guessing attacks.
-
improved searchable public key encryption with designated tester
Computer and Communications Security, 2009Co-Authors: Hyun Sook Rhee, Jong Hwan Park, Willy Susilo, Dong Hoon LeeAbstract:Recently, Baek et al. proposed an efficient public key encryption scheme with keyword search based on the scheme of Boneh et al., However, the Security model of Baek et al. seriously limits the ability of the adversary. In this paper, we enhance the Security model of the public key encryption with keyword search to properly incorporate the ability of an adversary. We also construct a public key encryption scheme with keyword search secure in the Enhanced Security model.
Shihao Yan - One of the best experts on this subject based on the ideXlab platform.
-
covert wireless communication in presence of a multi antenna adversary and delay constraints
IEEE Transactions on Vehicular Technology, 2019Co-Authors: Khurram Shahzad, Xiangyun Zhou, Shihao YanAbstract:Covert communication hides the transmission of a message from a watchful adversary, while ensuring reliable information decoding at the receiver, providing Enhanced Security in wireless communications. In this work, covert communication in the presence of a multi-antenna adversary and under delay constraints is considered. Under the assumption of quasi-static wireless fading channels, we analyze the effect of increasing the number of antennas employed at the adversary on the achievable throughput of covert communication. It is shown that in contrast to a single-antenna adversary, a slight increase in the number of adversary's antennas drastically reduces the covert throughput, even for relaxed covertness requirements.
-
covert wireless communication in presence of a multi antenna adversary and delay constraints
arXiv: Information Theory, 2019Co-Authors: Khurram Shahzad, Xiangyun Zhou, Shihao YanAbstract:Covert communication hides the transmission of a message from a watchful adversary while ensuring reliable information decoding at the receiver, providing Enhanced Security in wireless communications. In this letter, covert communication in the presence of a multi-antenna adversary and under delay constraints is considered. Under the assumption of quasi-static wireless fading channels, we analyze the effect of increasing the number of antennas employed at the adversary on the achievable throughput of covert communication. It is shown that in contrast to a single-antenna adversary, a slight increase in the number of adversary's antennas drastically reduces the covert throughput, even for relaxed covertness requirements.
