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 132 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. 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 |
2. A Technology Based on Melody Key Points in Query by Humming | |||
LV Anchao,LIU Gang | |||
Computer Science and Technology 26 December 2017 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:As one of the important modules in query by humming system, humming feature extraction aims to extract the stable melody features. There are three typical personalization factors lead to instability of humming features, which are the base pitch shifting, the dynamic range changing and the humming rate changing. According to the characteristic of inconsistent humming rate, this paper mines the key point information that is stable to the change of melody rhythm. The melody is segmented and index is created first according to the key points, and the features in the segment are extracted. Then, a feature extraction method based on key point segmentation is proposed. Besides, using the theory of music theory and statistics, this paper takes the non-uniform segmentation statistic features and rhythm statistic features as the final humming features. Finally, numerical results are carried out to evaluate the validity and rapidity of the proposed schemes. | |||
TO cite this article:LV Anchao,LIU Gang. A Technology Based on Melody Key Points in Query by Humming[OL].[26 December 2017] http://en.paper.edu.cn/en_releasepaper/content/4742916 |
3. 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 |
4. An Ant Colony System Based Virtual Network Embedding Algorithm | |||
Jia-Bin Wang,Wei-Neng Chen | |||
Computer Science and Technology 02 May 2017 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The virtual networking embedding (VNE) problem is a core issue in network virtualization. This is also a challenging problem as it contains different kinds of constraints, and its complexity becomes even higher in an online VNE problem with thousands of virtual network (VN) requests. In this paper, we proposed an ant colony system based VNE algorithm, called ACS-VNE, for the online VNE problem. The benefits of ACS-VNE are threefold. First, it is an ACS based algorithm so it can take full advantage of the dynamically changing heuristic information and pheromone to improve the quality of a solution. Second, different from previous work that only considers the resource of nodes in node mapping phase, we take the distance message related to links into consideration so that we can reduce the cost of VN requests. The last but not least, the algorithm tries to reduce the cost for every single VN and it helps to increase the possibility of accepting more future VN requests. The proposed method is tested on both the single VN request VNE problem and the online VNE problem. Experimental results show that the proposed algorithm outperforms some previous approaches in terms of average revenue and acceptance ratio, and the results also have a relatively low cost. | |||
TO cite this article:Jia-Bin Wang,Wei-Neng Chen. An Ant Colony System Based Virtual Network Embedding Algorithm[OL].[ 2 May 2017] http://en.paper.edu.cn/en_releasepaper/content/4729688 |
5. 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 |
6. Molecular model checking for a branching time logic | |||
ZHU Weijun | |||
Computer Science and Technology 29 July 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The computation using Deoxyribonucleic Acid (DNA) molecules provides a huge parallel way that break through the limitations of efficiency of traditional electronic computers. The Model checking is a popular formal verification technique which has been widely used in many fields of computations, and it is also a famous complex problem in the computing theory. Up to now, the branching-time logics seems hardly to be conducted model checking via DNA computing. To this end, Adleman's model based on DNA computing is employed in this paper. On the basis of it, a series of DNA-computing-based model checking algorithms for checking some basic formulas in a representative branching-time logic is proposed. As a result, a core of the DNA version of this model checking problem is solved in this way. The simulated experimental results show that the new algorithms are valid in computational logic, and they can be properly implemented in molecular biology. | |||
TO cite this article:ZHU Weijun. Molecular model checking for a branching time logic[OL].[29 July 2016] http://en.paper.edu.cn/en_releasepaper/content/4701489 |
7. 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 |
8. 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 |
9. 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 |
10. 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 |
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