Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Basic-Subject-of-Computer-science-and-technology

There are 133 papers published in subject: > since this site started.

Results per page:

133 Total, 14 Pages | << First < Previous 1 2 3 4 5 6 7 Next > Last >>

Select Subject

All (8828)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Third-level Subject

Algorithm Theory(22)
Automata Theory(1)
Computability Theory(4)
Computer Reliability Theory(4)
Data Security and Compute...(76)
Data Structure(0)
Other Subjects of Basic S...(13)

Rank

Results per page:

133 Total, 14 Pages | << First < Previous 1 2 3 4 5 6 7 Next > Last >>

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Cooperative Attribute-Based Access Control
	LI Mengting , HUANG Xinyi , LIU Joseph K. , XU Li , WU Wei
	Computer Science and Technology 16 January 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper we introduce a cooperative attribute-based access control mechanism, which is specifically designed for enterprise computing system. In our system, users are divided into different groups and they are affiliated with different attributes. Only members from the same group can combine their signing keys to form the signing key of a larger union set of attributes, but users from different groups cannot make it. With the union of the attributes, users can generate a signature which can be used to grant access right to the enterprise cloud system. The applications range from private cloud of a small and medium enterprise (SME) to a large public cloud of electronic healthcare system. We give an efficient design of this mechanism, formally prove its security and implement the prototype of our scheme.
	TO cite this article:LI Mengting , HUANG Xinyi , LIU Joseph K. , et al. Cooperative Attribute-Based Access Control[OL].[16 January 2015] http://en.paper.edu.cn/en_releasepaper/content/4629802


	2. 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

Saved Papers

Saved Papers


	3. A New Improved Algorithm for Secure Outsourcing of Modular Exponentiations
	Ye Jun, Chen Xiaofeng, Ma Jianfeng
	Computer Science and Technology 30 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Outsourcing computation allows for outsourced function evaluation from a resource-constrained client to a powerful server which may be not honest. The client invests some off-line computations to obtain a transformation of its function which is then passed to the server, who returns the result of the computation. In this paper we propose an outsourcing algorithm of modular exponentiations. In the computation process, the sensitive information during the modular exponentiation computation is hidden to the server, while the computation results can be efficiently verified by the client.
	TO cite this article:Ye Jun, Chen Xiaofeng, Ma Jianfeng. A New Improved Algorithm for Secure Outsourcing of Modular Exponentiations[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4626109


	4. Fully Simulatable Oblivious Transfer via Proof of Partial Knowledge
	Wei Xiao-Chao, Zhao Chuan, Jiang Han, Xu Qiu-Liang
	Computer Science and Technology 30 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract: Oblivious transfer (OT) is an important cryptographic basic tool and can be used to construct many other cryptographic scheme, such as the secure two-party computation protocol. As a sub-component of one scheme, the OT protocol must meet the security requirement of the outside scheme. For example, when constructing a secure two-party computation protocol in the presence of malicious adversary, the OT protocol used should be fully simulated in the malicious model. We propose a OT$^2_1$ protocol with full simulation under the assumption of DDH problem, relying on the notion of zero-knowledge proof of knowledge of partial (subset) Diffie-Hellman tuples.
	TO cite this article:Wei Xiao-Chao, Zhao Chuan, Jiang Han, et al. Fully Simulatable Oblivious Transfer via Proof of Partial Knowledge[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4624947


	5. Solving the Fixed Spectrum Frequency Assignment Problem via Iterated Tabu Search
	Zhipeng L"u, Zhaojing Luo, Tao Ye
	Computer Science and Technology 03 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper presents an Iterated Tabu Search (ITS) algorithm for solving the fixed spectrum frequency assignment problem (FS-FAP), which integrates several distinguishing features, such as a novel dynamic tabu tenure mechanism and three kinds of perturbation operators. Computational results assessed on two sets of 47 public benchmark instances demonstrate the efficacy of the proposed ITS algorithm in terms of both solution quality and efficiency. Particularly, for the first set, ITS is able to find new best objective values for 16 instances while matching the previous best objective values for 21 ones, and for the COST 259 benchmark set, compared with reference algorithm, ITS obtains 2 better results in a reasonable time. Furthermore, several important ingredients of the ITS algorithm are also analyzed.
	TO cite this article:Zhipeng L"u, Zhaojing Luo, Tao Ye. Solving the Fixed Spectrum Frequency Assignment Problem via Iterated Tabu Search[OL].[ 3 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4619809


	6. Memetic Search for the Bandwidth Coloring Problem
	LU Zhipeng
	Computer Science and Technology 18 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper presents a memetic algorithm for solving the Bandwidth Coloring Problem (BCP) and the Bandwidth MultiColoring Problem (BMCP), which incorporates a tabu search algorithm into the framework of an evolutionary algorithm. The proposed algorithm is assessed on two sets of totally 66 benchmark instances commonly used in the literature. Computational results demonstrate that the memetic algorithm is highly competitive in terms of both solution quality and efficiency compared to some highly efficient algorithms in the literature. The investigations of some key elements of the proposed method show the importance of the tabu search algorithm and the perturbation strength for the performance of the algorithm.?????
	TO cite this article:LU Zhipeng. Memetic Search for the Bandwidth Coloring Problem[OL].[18 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4616450


	7. Buyer-seller watermarking protocols suitable for probabilistic privacy homomorphisms
	ZENG Peng
	Computer Science and Technology 10 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A common limitation of some recently proposed watermarking protocols lies in the requirement of deterministic privacy homomorphisms which would result in an inevitable contradiction between the security and the robustness of watermarks. The present paper provides afix to two important buyer-seller watermarking protocols by removingthis limitation. In addition, the improved protocols solve thesecure verification problem existing in the original ones.
	TO cite this article:ZENG Peng. Buyer-seller watermarking protocols suitable for probabilistic privacy homomorphisms[OL].[10 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4617972


	8. Seesaw based Molecule Adders with Debugging Method$^dagger$
	Xiangrong Liu, Juan Suo,Quan Zou,Xiangxiang Zeng
	Computer Science and Technology 05 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Reviews: Biological molecules have been found to have the potential to be used in the construction of various computing devices. With complex and uncertain parameters (concentration, temperature, threshold, and so on) to balance, molecular circuits always function abnormally. Therefore, developing a molecular circuit debugging method is of great significance to the development of biomolecular computing. In this study, we first construct several adders, including half, full, and serial binary adders, using a new concept of “seesaw” gate, which is based on a reversible DNA strand branch process. Through simulation on a virtual experiment platform, the half and full adders are found to function properly as designed. However, an unexpected exception is noted in the simulation of the serial binary adder. To identify and address the exception, we propose a new method for debugging the molecular circuit. The main idea for this method is to add fan-outs to monitor the circuit in a reverse stepwise manner. These fan-outs are fluorescent signals that can obtain the real-time concentration of the target molecule. The exception is identified and located by analyzing the monitoring result. Finally, examples of XOR and serial binary adders are described to prove the practicability and validity of the proposed molecular circuit debugging method.
	TO cite this article:Xiangrong Liu, Juan Suo,Quan Zou, et al. Seesaw based Molecule Adders with Debugging Method$^dagger$[OL].[ 5 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4617180


	9. Time-free Tissue P Systems for Solving the Hamilton Path Problem
	Xiangxiang Zeng, Ningxiang Ding,Fei Xing,Xiangrong Liu
	Computer Science and Technology 05 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Reviews: Tissue P systems are distributed and parallelcomputing models inspired by the communication behavior of livingcells in tissues. Theoretically, tissue P systems can generateexponential working space in linear time, which makes it feasible tosolve computational hard problems in polynomial time. In traditionaltissue P systems, the execution of each rule takes exactly one timeunit, thus making the system work synchronously. However, therestriction does not correspond with the biological fact, sincebiochemical reactions may vary in unpredicted conditions. In thiswork, we define the timed tissue P systems by adding a time mappingto each rules to specify the execution time for them. Furthermore, auniform and time-free solution to Hamilton Path Problems is obtainedby a family of such systems, where the execution time of rules canchange and the output produced is always correct.
	TO cite this article:Xiangxiang Zeng, Ningxiang Ding,Fei Xing, et al. Time-free Tissue P Systems for Solving the Hamilton Path Problem[OL].[ 5 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4617177


	10. Security Enhancement to a User Authentication Scheme for Multi-Server Environment
	ZENG Peng
	Computer Science and Technology 29 October 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:User authentication schemes for multi-server setting allow a remote user to obtain services from multiple servers without the need to separately register with every individual server.In general, user authentication schemes for a multi-server environment should provide the following properties: single registration,low computation, no need for verification table, mutual authentication and key agreement, and security.Recently Wang, Juang, and Lei proposed a privacy-preservation user authentication scheme based on the quadratic residue and claimed the scheme meets all five requirements.In this paper, we demonstrate that their scheme is, unfortunately, vulnerable to a previously unpublished parallel-session attack.In other words, this attack enables a malicious user to impersonate legitimate users and obtain services from participating application servers without the victims' knowledge.We then show how the flaw in Wang emph{et al.}'s scheme can be fixed.
	TO cite this article:ZENG Peng. Security Enhancement to a User Authentication Scheme for Multi-Server Environment[OL].[29 October 2014] http://en.paper.edu.cn/en_releasepaper/content/4615680

	Check out RSS, or use RSS reader to subscribe this item