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 25 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. 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 |
2. 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 |
3. 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 |
4. 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 |
5. 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 |
6. 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 |
7. 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 |
8. An Architecture-Centric Approach for Security Technical Debt Quantification | |||
Yang Jun,Rami Bahsoon,Liu Jiqiang | |||
Computer Science and Technology 30 March 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Security managers and architects often have trouble in making decision among various security technologies when the budget is limited. At this time, a compromise between effective security technologies and limited budget may hurt the system's long-term health and introduce technology debt. This paper presents an architecture-centric cost-benefit method for quantifying technology debt caused by different security deployment solutions, in order to help security managers to manage technology debts and make decisions. The proposed method is an extension of the Security Attribute Evaluation Method (SAEM) to reason about the debt in secure architectures. A case study is adopted to exemplify the process of method. The result indicates that the method provides an angle of technology debt beyond the plain SAEM method to help security manager make choice and manage long-term benefit and cost. | |||
TO cite this article:Yang Jun,Rami Bahsoon,Liu Jiqiang. An Architecture-Centric Approach for Security Technical Debt Quantification[OL].[30 March 2016] http://en.paper.edu.cn/en_releasepaper/content/4681192 |
9. A New Efficient Request-Based Comparable Encryption Scheme | |||
CHEN Peng, YE Jun, CHEN Xiao-Feng | |||
Computer Science and Technology 30 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Privacy-preserving comparisons over encrypted entries of a database is a hot topic in academic research. Although order preserving encryption (OPE) basically achieves this target, when all the numbers in a certain scope are encrypted by an OPE, an attacker can retrieve the original numbers from their order. Furukawa puts forth a novel digit number encryption method called request-based comparable encryption (comparable encryption for short). but the disadvantages is that the token and cipher generations are inefficient. In this paper, we propose a new scheme based on comparable encryption by using sliding window method, which performs better than original comparable encryption both in storage and in computation workload. In our scheme, the users can obtain a trade-off between security and efficiency through adaptively setting the window size according to their real scenario. | |||
TO cite this article:CHEN Peng, YE Jun, CHEN Xiao-Feng. A New Efficient Request-Based Comparable Encryption Scheme[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4626112 |
10. ModuleGuard: A Gatekeeper for Dynamic Module Loading Against Malware | |||
Fu Jianming,Ding Shuang,Peng Bichen | |||
Computer Science and Technology 13 April 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In the open environment such as Internet, end-user host or machine is easily compromised and infected malicious code or malware due to vulnerabilities or user's mindlessness. This infection procedure may include a bootstrap to plant and load malware. Some researchers focus on detection this bootstrap, which locates at stack or heap, and others may concentrate on the detection malware at planting stage according to predefined patterns or signatures. The former detection depends on the structure and semantics of bootstrap, and may be intractable because code and data may be mixed in an input of normal program. Moreover, the later detection has the limitation to handle unknown malware. We analyze the attack steps of malware, and focus on the malware loading. Our assumption is that a malware contains no less than one module, so monitoring module loading is indispensable to defeat malware. Moreover, we design security policies, and employ these policies when a module is loaded by operating system. These policies depend on properties of module, the connection to created modules, and the link to user intention. The properties of module and this connection can improve the accuracy of malware detection. User intention can be helpful to handle unknown module, and enhances the flexibility of policy. Finally, ModuleGuard, a gatekeeper for dynamic module loading against malware, has been designed and implemented, which is integrated these security policies. Our experimental results have shown the feasibility and effectiveness of our method. | |||
TO cite this article:Fu Jianming,Ding Shuang,Peng Bichen. ModuleGuard: A Gatekeeper for Dynamic Module Loading Against Malware[OL].[13 April 2013] http://en.paper.edu.cn/en_releasepaper/content/4537813 |
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