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 74 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. 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 (600K 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 |
2. 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 (887K 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 |
3. 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 (219K 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 |
4. 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 (203K 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] |