Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 76 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. DTAME: A Unified Approach for ABAC Policy Mining and Efficient Evaluation Using Decision Trees | |||
LAN Ze-Jun, GUAN Jian-Feng | |||
Computer Science and Technology 28 February 2024 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:\justifying Attribute-Based Access Control (ABAC) has been chosen to replace the traditional access control model due to its dynamics, flexibility and scalability recently. However, during the migration and deployment process of ABAC policies, the key issue is how to mine an accurate and concise access control policy collection and quickly evaluate the policies when an access request arrives. Previous studies have typically taken the problems of policy mining and policy evaluation separately. Policy mining primarily focuses on the compactness of the policy itself, while policy evaluation concentrates on assessing the performance of policy matching. The lack of coordination between policy mining and policy evaluation results in that the concise strategy obtained through policy mining cannot maximize the performance of policy evaluation. To trick this issue, this paper proposed a decision tree based ABAC policy mining and policy evaluation (DTAME) scheme that addresses both issues concurrently by introducing an ABAC policy mining and evaluation method based on the decision tree algorithm. On the other hand, some hotspot policy rules are frequently accessed in some scenarios. Therefore, to maximize evaluation performance, this paper also optimizes the algorithm based on access control logs. Experimental results show that the DTAME can enhance the performance of policy evaluation while ensuring that the mined policies remain compact and effective. | |||
TO cite this article:LAN Ze-Jun, GUAN Jian-Feng. DTAME: A Unified Approach for ABAC Policy Mining and Efficient Evaluation Using Decision Trees[OL].[28 February 2024] http://en.paper.edu.cn/en_releasepaper/content/4762310 |
2. User Authentication from Smartwatch Photoplethysmography sensor | |||
TAN ZhiHao,HUANG Qinlong,YANG Yixian | |||
Computer Science and Technology 22 March 2021 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the rapid proliferation of smartwatch, a secure and convenient smartwatch-based user authentication scheme are desired. As the widely deployed bioelectrical signal sensor in smartwatch, Photoplethysmography (PPG) sensors have shown potentials for authentication. Existing authentication solutions usually have some limitations. They require the user to provide an amount of registration data from user to reflect the profile of user, which may impact the experience of user. In this paper, we propose a PPG-based smartwatch authentication scheme. We leverage the Siamese Network to extract the feature of user from the PPG signal affected by the finger-level gesture for authentication. We conduct some experiments to evaluate the performance of the scheme. The experiment results show that our model has an average accuracy rate of 92.43\%. In addition, the authentication model can achieve high authentication accuracy with a small amount of user registration data. | |||
TO cite this article:TAN ZhiHao,HUANG Qinlong,YANG Yixian. User Authentication from Smartwatch Photoplethysmography sensor[OL].[22 March 2021] http://en.paper.edu.cn/en_releasepaper/content/4754180 |
3. PPMT: Privacy-Preserving Genomic Data Sharing with Personalized Medicine Testing in Cloud Computing | |||
YUE Wei,HUANG Qinlong,YANG Yixian | |||
Computer Science and Technology 09 January 2020 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the rapid development of bioinformatics and the availability of genetic sequencing technologies, genomic data ushers in a new era of precision medicine. Cloud computing, features as low cost, rich storage and rapid processing can precisely respond to the challenges brought by the emergence of massive genomic data. Considering the security of cloud platform and the privacy of genomic data, we firstly introduce PPMT which utilizes key-policy attribute-based encryption (KP-ABE) to realize genomic data access control with abundant attributes, and employs KP-ABE with equality test to achieve personalized medicine test by matching digitized single nucleotide polymorphisms (SNPs) directly on the users' ciphertext without encrypting multiple times. We conduct extensive experiments with the dataset ``1000 Genomes", and the results show that PPMT can greatly reduce the computation and communication overhead compared with existing schemes and are practical enough test authorization requirements. | |||
TO cite this article:YUE Wei,HUANG Qinlong,YANG Yixian. PPMT: Privacy-Preserving Genomic Data Sharing with Personalized Medicine Testing in Cloud Computing[OL].[ 9 January 2020] http://en.paper.edu.cn/en_releasepaper/content/4750385 |
4. Secure Task Allocation Based on Anonymous Identity in Mobile Crowdsourcing | |||
HE Yue,HUANG Qinlong,HUANG Qinlong,NIU Xin-Xin,NIU Xin-Xin | |||
Computer Science and Technology 02 January 2020 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Mobile crowdsourcing emerges as a new paradigm, which assembles a group of workers with mobile devices to cooperatively achieve arduous tasks delegated by requester. However, due to varieties of attacks and untrustworthy mobile crowdsourcing server, mobile crowdsourcing inevitably raises secure concerns, in which confidentiality of task and identity privacy of worker will be exposed. Consequently, in this paper, a secure task allocation based on anonymous identity scheme in mobile crowdsourcing is proposed to resist against these threats. It leverages identity-based broadcast proxy re-encryption to distribute task from requester to a crowd of workers without the leakage of task data. In addition, pseudoidentity technique is utilized to protect identity of worker when it submits its identity to apply for task. The extensive analysis illustrates that this scheme can preserve confidentiality of task data and identity privacy of worker and withstand various attacks. Experiments have been conducted to validate the performance of this scheme. | |||
TO cite this article:HE Yue,HUANG Qinlong,HUANG Qinlong, et al. Secure Task Allocation Based on Anonymous Identity in Mobile Crowdsourcing[OL].[ 2 January 2020] http://en.paper.edu.cn/en_releasepaper/content/4750396 |
5. An Attack-Defense Trees model based on Analytic Hierarchy Process | |||
FEI Yu,JIANG Wenbao,Chalermpol Charnsripinyo | |||
Computer Science and Technology 12 March 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Attack-Defense Trees is an important theoretical model for analyzing APT attacks. Aiming at the problem of lacking defense methods and unreasonable node connection mode, a new Attack-Defense Trees model based on AHP is proposed. First, when considering the leaf node, we give both attack and defense leaf node a variety of security attributes. Second, we construct judgement matrix according to the degree that security attributes of leaf node effect the probability of attack events. Third, we obtain the corresponding attribute weights after one-time inspection. Finally, the connection relationship between different branch nodes is given. The calculation results show that the description of the mutual influence between the two sides of the attack and defense is more close to the reality. | |||
TO cite this article:FEI Yu,JIANG Wenbao,Chalermpol Charnsripinyo. An Attack-Defense Trees model based on Analytic Hierarchy Process[OL].[12 March 2018] http://en.paper.edu.cn/en_releasepaper/content/4743660 |
6. controlled quantum secure direct communication with authentication based on four particle cluster state | |||
Zhao Zhezijian,Chen Xiubo | |||
Computer Science and Technology 03 January 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A controlled quantum secure direct communication with authentication protocol using four particle cluster states is presented in this paper. By using identity string, the participants of the communication can authenticate the other communicators.We redesign the authentication method from protocol of Chang et.al[23], a hash function is used to generate a random string in order to guarantee the transmission of the particles, preventing the eavesdropper from stealing the secret message. In our protocol, one particle of the cluster state is used as controller\'s permission and two qubits are used to transmit two classical bit information. At the end of this paper, we discuss the security of our protocol and show that our scheme can against both inside and outside attack. | |||
TO cite this article:Zhao Zhezijian,Chen Xiubo. controlled quantum secure direct communication with authentication based on four particle cluster state[OL].[ 3 January 2018] http://en.paper.edu.cn/en_releasepaper/content/4743047 |
7. A More Efficient Attribute-Based Encryption Scheme With Hidden Access Structure Policy | |||
Qian~Wang, Zhenfu~Cao | |||
Computer Science and Technology 06 May 2017 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:We propose two new ciphertext-policy attribute-based encryption schemes where the access structures defined by And-gate with wildcard are hidden. In the scheme1, we expand the scheme of Phuong so that it can be used in the situation of multi-valued attributes. In the scheme2, we use a new technique to reduce the length of ciphertext and the cost of decryption. By comparison with the scheme1 and phuong's scheme in the same situation, it proved that scheme2 is more efficient as both the length of the cipertext and the cost of the decryption are decreased by half. In our scheme, we use the technique of the notion of 'attributes' position' and 'attributes' possible values' to realize our scheme. Then we proof the selective security of scheme2 under the standard decisional linear and decisional bilinear Diffie-Hellman assumptions. | |||
TO cite this article:Qian~Wang, Zhenfu~Cao. A More Efficient Attribute-Based Encryption Scheme With Hidden Access Structure Policy[OL].[ 6 May 2017] http://en.paper.edu.cn/en_releasepaper/content/4729480 |
8. A Note on Hardness of Testing Functions | |||
Lu Haining | |||
Computer Science and Technology 27 June 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This note presents some hardness results of testing Boolean functions in the random example model. First we present a hardness of testing under arbitrary distributions. As a consequence, we obtain that the class of intersections of halfspaces cannot be tested in arbitrary distributions. Second we present a hardness result of testing under the uniform distribution when assuming weak pseudorandom functions. | |||
TO cite this article:Lu Haining. A Note on Hardness of Testing Functions[OL].[27 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4696165 |
9. Key Recovery on Several Matrix Public-Key Encryption Schemes | |||
WANG Hou-Zhen,ZHANG Huan-Guo, TANG Shao-Hua | |||
Computer Science and Technology 01 June 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: Eight years ago, Pei emph{et. al} described a matrix public-key encryption scheme based on the matrix factorization over a finite field. Recently, Gu and Zheng also proposed a similar scheme based on the nonabelian factorization (NF) assumption. The security of these schemes is essentially based on a two-sidematrices exponentiation (TSME) problem. In this paper, we show that the TSME problem is susceptible to a very efficient linearization equations attack. Regardless of the public key parameters, we can easily find an equivalent key only in polynomial time $mathcal{O}ig(2n^5(log n+1)ig)$ from the public key alone, and thus it is very practical and can be implemented within less than 1/20 of a second on the recommended system parameters of the schemes. | |||
TO cite this article:WANG Hou-Zhen,ZHANG Huan-Guo, TANG Shao-Hua. Key Recovery on Several Matrix Public-Key Encryption Schemes[OL].[ 1 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4692635 |
10. New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem | |||
WANG Hou-Zhen,ZHANG Huan-Guo, MAO Shao-Wu,WU Wan-Qing | |||
Computer Science and Technology 19 May 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: During the last two decades, there has been intensive and fast development in the multivariate public key cryptography (MPKC), which is considered to be an important candidate for post-quantum cryptography. However, it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme (especially encryption scheme) employing the existing trapdoor construction. In this paper, we propose a new key exchange scheme and MPKC scheme based on the Morphism of Polynomials problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem, namely the decisional multivariate Diffie-Hellman(DMDH) problem originated from the Morphism of Polynomials problem. The proposed key agreement is one of several non number theory based protocols, and shall be considered to be a candidate for the post-quantum era. More importantly, by slightly modifying the protocol, we offer a truly original approach to design the secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency, and seems fairly competitive in comparison with the traditional MPKC schemes. | |||
TO cite this article:WANG Hou-Zhen,ZHANG Huan-Guo, MAO Shao-Wu, et al. New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem[OL].[19 May 2016] http://en.paper.edu.cn/en_releasepaper/content/4692638 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated