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 36 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. Optimizing data drilling with the user interaction weighted minimum description length principle | |||
Tao Fang,Shen Qiwei,Li Wei,Xu Tong | |||
Computer Science and Technology 13 December 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Interaction exploration is an effective way to obtain potential information from the treemap that visualized large-scale data. Data exploration techniques that has been proposed (such as translation and scaling on a two-dimensional plane) provide limited context information only or provide excessive distortion. Query was proposed to get interested view, but it need clear destination. The method that get a detailed view according to scores evaluated by user interaction can\'t get a suitable initial view. To this, we propose an interactive exploration method that performs unbalanced weighting according to the user's focus and uses the minimum description length principle (MDL) for node aggregation. This method can freely expand the focus area in a good degree of aggregation, which can provide the necessary data information and reduce the visual confusion caused by the excessive data set. This enables efficient data mining in large-scale datasets. We further verify the availability of method by experiment. In addition, the interaction mode in this paper has no conflict with the existing interaction modes (such as zooming, rotating, etc.), and the better results can be achieved by selectively combining according to different scenarios. | |||
TO cite this article:Tao Fang,Shen Qiwei,Li Wei, et al. Optimizing data drilling with the user interaction weighted minimum description length principle[OL].[13 December 2018] http://en.paper.edu.cn/en_releasepaper/content/4746669 |
5. Large-scale global optimization using cooperative coevolution with self-adaptive differential grouping | |||
FANG Wei,FANG Wei,MIN Ruigao,ZHOU Jianhong,ZHOU Jianhong,ZHOU Jianhong | |||
Computer Science and Technology 05 December 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Cooperative co-evolution (CC) is a popular evolutionary computation approach that can divide a large problem into a set of smaller sub-problems and solve them independently. CC has been an important divide-and-conquer algorithm for large-scale global optimization (LSGO) problems. Identification of variable interactions is the main challenge in CC to decompose the LSGO problems. Differential Grouping (DG) is a competitive variable grouping algorithm that can address the non-separable components of a continuous problem. As an improved version of DG, Global Differential Grouping (GDG) addresses the drawbacks of DG which are variables interactions missing during grouping and grouping performance sensitive to the threshold. In this paper, a Self-adaptive Differential Grouping (SDG) based on GDG is proposed in order to further improve the grouping accuracy on the CEC'2010 LSGO benchmark suite. The threshold for grouping in SDG can adjust adaptively along with the magnitude of different functions and is determined by only two points which is a randomly sampled point and its corresponding opposite point in the decision space. A self-adaptive pyramid allocation (SPA) strategy that can allocate different computational resource to subcomponents is also studied in this paper. The proposed algorithm, where SDG and SPA working with the optimizer $SaNSDE$ (CCSPA-SDG), is used to optimize the CEC'2010 LSGO benchmark suite. Experimental results show that SDG achieved ideal decomposition of the variables for all the CEC'2010 LSGO benchmark functions. The optimization performance of CCSPA-SDG also outperforms the state-of-the-art results. | |||
TO cite this article:FANG Wei,FANG Wei,MIN Ruigao, et al. Large-scale global optimization using cooperative coevolution with self-adaptive differential grouping[OL].[ 5 December 2018] http://en.paper.edu.cn/en_releasepaper/content/4746608 |
6. 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 |
7. 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 |
8. A Study on IT technology supported online education:An e-Learning Platform (eLP) based on PHP framework's duality | |||
ALQARNI ABDULHADI,XIN Yang | |||
Computer Science and Technology 05 November 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The function of PHP framework as more Object Oriented (OOL) language than a functional programming language (like JavaScript) can in fact be an advantage that makes it more suitable for building reliable e-Learning Platform (eLP) if we take the available options of the two e-Learning systems: the Learning Management System (LMS) and the Learning Object Metadata (LOM). The reason is because a PHP framework e-Learning Platform (eLP) allows better control of the e-learning environment including: more control on the learning resources/modules. better control on managing the academic and students' records, better control and security on assessment/exam records and more importantly keeping the formal identity, culture and orientation of the e-learning environment. All these educational advantages which PHP framework e-Learning Platform (eLP) Virtual Campus Administration will have are because of PHP framework's technical advantages of being more Server-side/ Backend architecture, more Model-view-controller (MVC) and Service Oriented Architecture (SOA) Interfaces, where the Learning Object Metadata (LOM), the Course Management System (CMS) and Learning Management System (LMS) are all in the server of the e-learning environment administration and in the same time save, secure and allows smoother data movement. In addition such PHP framework e-Learning Platform (eLP) will still allow us to access ad benefit from SCORM standards for web-based resources (like Moodle) which means there is nothing will be missed. This research achieved an e-Learning Platform (eLP) model architecture on a PHP framework and makes use of its several advantages to come up with an e-Learning Platform that suits the educational and learning purpose more efficiently. | |||
TO cite this article:ALQARNI ABDULHADI,XIN Yang. A Study on IT technology supported online education:An e-Learning Platform (eLP) based on PHP framework's duality[OL].[ 5 November 2016] http://en.paper.edu.cn/en_releasepaper/content/4707179 |
9. 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 |
10. 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 |
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