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


	2. A privacy preserving method for community location sensing
	TAN Lei, FAN Hui-Ting, XING Kai
	Computer Science and Technology 07 December 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As the advancement of network and sensing, online/mobile applications get increasing popularity. Participatory sensing provides a promising way for people to understand the world better. Many people show interest to their relative status in their community, that is, ``Where am I in my community?". In this paper, we present a technique that uses EM Algorithm to perform a Gaussian mixture model on distributed data, which controls data sharing and prevents disclosure of individual data items. We also propose a method consisting of several protocols that provide privacy preservation in participatory sensing without revealing individual's privacy information. The experiment results show that our approach can not only answer where they are in their community but also preserve their privacy.
	TO cite this article:TAN Lei, FAN Hui-Ting, XING Kai. A privacy preserving method for community location sensing[OL].[ 7 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4668152

Saved Papers

Saved Papers


	3. Signature Scheme from Trapdoor Functions
	HUANG Qiong
	Computer Science and Technology 21 November 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Digital Signature is a basic cryptographic primitive. Security of signature scheme has been studied for decades. How to build an efficient signature scheme based on simple and standard assumptions without relying on random oracle heuristic has been an interesting problem. In this paper we give a solution to this problem from another angle, and show to construct a signature scheme from adaptive trapdoor functions, which has shown its power in building other important cryptographic primitives. Our construction could be instantiated based on simple assumptions like CDH assumption in the standard model.
	TO cite this article:HUANG Qiong. Signature Scheme from Trapdoor Functions[OL].[21 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4662969


	4. Generic Construction of Privacy-Preserving Optimistic Fair Exchange Protocols
	HUANG Qiong
	Computer Science and Technology 21 November 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Privacy-preserving optimistic fair exchange ($pofe$), introduced by Huang et al. in CT-RSA 2014, is a kind of protocols which aim to solve the fairness problem in the exchange of signature between parties and in the meanwhile protect the privacy of the involved parties. In $pofe$ no one else including the arbitrator, can collect any evidence about an exchange between them even after the resolution of a dispute. In this work we propose a generic construction of $pofe$ and show that it is secure in the standard model.
	TO cite this article:HUANG Qiong. Generic Construction of Privacy-Preserving Optimistic Fair Exchange Protocols[OL].[21 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4662177


	5. A New Privacy-Preserving Smart Grid System
	Jiaping Lin,Xingwen Zhao
	Computer Science and Technology 31 August 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Smart grid can be used to continuously measure, monitor, predict and even control electricity consumption. However, the energy consumption information may reveal the privacy of users. In this paper, we propose a new privacy-preserving smart grid system based on a k-times short dynamic group signature supporting the controllable linkability. Only the group manager can confirm the identity of the signer, so our system can protect the user's privacy. Each user can submit the consumption value up to k times in each time period, e.g. each day. The users can report the consumption value regularly and the service provider will not be subject to heavy computation burden. We show that the proposed scheme is as efficient as other smart grid system, while achieving the additional security feather of times limited authentication.?
	TO cite this article:Jiaping Lin,Xingwen Zhao. A New Privacy-Preserving Smart Grid System[OL].[31 August 2015] http://en.paper.edu.cn/en_releasepaper/content/4652669


	6. The Attacks Against and Suggestions for the Privacy-Preserving Recording & Gateway-Assisted Authentication of Power Usage Information for Smart Grid
	Xiaole Mao,Xingwen Zhao
	Computer Science and Technology 25 August 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The privacy protection in the smart grid is particularly significant, since sometimes the leak of the user power usage habits may lead to serious consequences. In 2015, Yiu and Zhong have proposed a privacy-preserving scheme which can protect each user's future power usage plan. However, some insecure factors exist in this scheme. In this paper, we show two major problems about the scheme. Firstly, it cannot resist the denial attack in which a user can deny having sent certain power plan. Secondly, the gateway smart meter doesn't detect the action that some users may send several different or even contradictory power usage plans to the upper gateway simultaneously, which will lead to the result that the user can always avoid punishment when he use more electricity than usual or obtain discount when he use less electricity than usual. We also put forward our suggestions to avoid the problems at the end of the article..?
	TO cite this article:Xiaole Mao,Xingwen Zhao. The Attacks Against and Suggestions for the Privacy-Preserving Recording & Gateway-Assisted Authentication of Power Usage Information for Smart Grid[OL].[25 August 2015] http://en.paper.edu.cn/en_releasepaper/content/4653172


	7. Analysis and design of secure email system
	SAMASSI Alassane,XIN Yang
	Computer Science and Technology 15 June 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper describes a secure email system especially how to design his personal email system by handling both symmetric-key and public-key techniques. The system consists of a mail server to manage the sending and receipt of the email, a data base to manage the certificates corresponding to different emails. A model is implemented to check the certificate from the certification authority then save it into the database, then another model implemented to encrypt the email by using first the symmetric-key with AES encryption then use the public key technique to encrypt the symmetric-key with RSA encryption technology before sending. A model is designed to sign the email with the sender's private key to minimize spam and others virus and threats, to be sure of the email source. With all its commands, the library OpenSSL will be a very important toolkit. As a result of the project on building automation, the tool interface used is the command line interface. All the sending email process must be transparent to the user, easily handy and especially reliable with all security precautions.
	TO cite this article:SAMASSI Alassane,XIN Yang. Analysis and design of secure email system[OL].[15 June 2015] http://en.paper.edu.cn/en_releasepaper/content/4643782


	8. Parameterized Approximation Algorithms for the Shallow-Light Steiner Tree Problem
	GUO Longkun, LIAO Kewen, SHEN Hong
	Computer Science and Technology 02 June 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Let $G=(V,, E)$ be a given graph with non-negative integral edgecost and delay, $Ssubseteq V$ be a terminal set and $rin S$ bethe selected root. The shallow-light Steiner tree (emph{SLST}) problemis to compute a minimum cost tree spanning the terminals of $S$,such that the delay between $r$ and every other terminal is boundedby a given delay constraint $Dinmathbb{Z}_{0}^{+}$. It is knownthat the emph{SLST} problem is NP-hard and unless $NPsubseteq DTIME(n^{loglog n})$there exists no approximation algorithm with ratio $(1,,gammalog^{2}n)$for some fixed $gamma>0$. Nevertheless,under the same assumption it admits no approximation ratio betterthan $(1,,gammalog\|V\|)$ for some fixed $gamma>0$ even when $D=2$.This paper first gives an exact algorithm with time complexity$O(3^{t}nD+2^{t}n^{2}D^{2}+n^{3}D^{3})$,where $n$ and $t$ are the numbers of vertices and terminals of thegiven graph respectively. This is a pseudo polynomial time parameterizedalgorithm with respect to the parameterization ``number of terminals''.Later, this algorithm is improved to a parameterized approximationalgorithm with a time complexity $O(3^{t}rac{n^{2}}{epsilon}+2^{t}rac{n^{4}}{epsilon^{2}}+rac{n^{6}}{epsilon^{3}})$and a bifactor approximation ratio $(1+epsilon,,1)$. That is, forany small real number $epsilon>0$, the algorithm computes a Steinertree with delay and cost bounded by $(1+epsilon)D$ and the optimumcost respectively.
	TO cite this article:GUO Longkun, LIAO Kewen, SHEN Hong . Parameterized Approximation Algorithms for the Shallow-Light Steiner Tree Problem[OL].[ 2 June 2015] http://en.paper.edu.cn/en_releasepaper/content/4640692


	9. Approximating Algorithms for Computing Energy Constrained MinimumCost Steiner Trees
	ZOU Nianchen, GUO Longkun, HUANG Peihuang
	Computer Science and Technology 30 May 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Green data transmission is important for wireless networks, such assensor networks, mobile networks, etc. This paper gives approximationalgorithms for constructing energy constrained minimum cost Steinertrees (ECMST), a topology for data multicast considering both savingenergy and minimizing the occupied resource. For a given undirectedgraph, in which each edge is with nonnegative integral cost and energyconsumption, the ECMST problem is to compute a minimum cost tree spanningall specified terminals and satisfying a given energy consumptionconstraint. Apparently ECMST is NP-hard, since it includes the minimumSteiner tree problem which is known NP-hard.The paper first presents an approximation algorithm by extendingByrka et al.'s method via Lagrangian relaxation. Then, the paper improves the ratio of the approximation algorithm to $(2,,3)$by replacing components of the computed Steiner tree. The improvementis mainly based on three ingredients: a generalization of the $k$-Steinerratio against ECMST, the observation that ECMST is pseudo-polynomialsolvable when the number of the terminals are fixed, and the extensionof Byrka and et al.'s approximation algorithm. To the best of ourknowledge, our algorithm is with the best ratio in the current stateof the art. Although Ravi and Goemanshave proposed a $(1+epsilon,,1)$-approximation algorithm for thespecial case when all vertices are terminals, their method can notbe applied to ECMST, since their method is based on a matroid propertywhich doesn't hold for ECMST.
	TO cite this article:ZOU Nianchen, GUO Longkun, HUANG Peihuang. Approximating Algorithms for Computing Energy Constrained MinimumCost Steiner Trees[OL].[30 May 2015] http://en.paper.edu.cn/en_releasepaper/content/4640705


	10. Universal Designated Verifier Transitive Signatures for Graph-based Big Data
	Shuquan Hou , Xinyi Huang ,Joseph K. Liu ,Jin Li ,Li Xu
	Computer Science and Technology 25 March 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we propose a new type of digital signatures which is specifically designed for graph-based big data system. The properties of the proposed signatures are twofold. On one side it possesses the features of transitive signatures: One can sign a graph in such a way that, given two signatures on adjacent edges $(i, j)$ and $(j, k)$, anyone with public information can compute a signature on edge $(i, k)$. The efficiency advancement ($O(1)$ communication overhead) in transitive signatures is especially important in big data paradigm. On the other side, it is universal designated verifiable: It allows any signature holder to prove to a designated verifier that a message has been signed by the signer, but the verifier cannot convince (even sharing all secret information) any other third party of this fact. The new notion is called Universal Designated Verifier Transitive Signatures ($mathrm{UDVTS}$ for short). As an integration of transitive signatures and universal designated verifier signatures, $mathrm{UDVTS}$ can efficiently address privacy issues associated with dissemination of transitive signatures of graph-based big data. We further prove that our proposed design is secure in the random oracle model.
	TO cite this article:Shuquan Hou , Xinyi Huang ,Joseph K. Liu , et al. Universal Designated Verifier Transitive Signatures for Graph-based Big Data[OL].[25 March 2015] http://en.paper.edu.cn/en_releasepaper/content/4634119

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