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 > Data-Security-and-Computer-Security

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

Results per page:

77 Total, 8 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)

Rank

Results per page:

77 Total, 8 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. 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


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

Saved Papers

Saved Papers


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


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


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


	6. Applying Twin Support Vector Machines and Clustering to Intrusin Detection
	HE Jun,XU Guosheng
	Computer Science and Technology 08 May 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Intrusion detection system (IDS) is becoming a critical component of network security. However, the detection rates of many proposed intelligent intrusion detection models are still not high enough to be applied to real network security. This paper presents a novel intrusion detection model with twin support vector machines. In addition, a k-means clustering sampler is designed to avoid the possible loss of significant data when sampled randomly. The performance of the proposed IDS is evaluated with KDD'99 dataset and compare to other intrusion detection models. The results demonstrate the superiority of the proposed IDS.
	TO cite this article:HE Jun,XU Guosheng. Applying Twin Support Vector Machines and Clustering to Intrusin Detection[OL].[ 8 May 2014] http://en.paper.edu.cn/en_releasepaper/content/4595869


	7. A novel proxy signature scheme from factorization
	Yu yong
	Computer Science and Technology 15 January 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Proxy signature is a useful cryptographic primitive for delegating the signing powers and has been suggested for use in many real world applications. The existing proxy signature scheme from factorization assumption are either insecure or inefficient. In this paper, we propose a novel, efficient and provably secure proxy signature scheme from factorization. Our construction makes use a factorization based key-exposure free chameleon hash function in the delegation phase and the proxy signer needs only to find a collision to a chameleon hash value to generate a valid proxy signature. As a result, our scheme is highly efficient in terms of the computation of the proxy signer. We also provide a formal security proof by classifying the adversaries into three categories. Comparisons demonstrate that the new scheme outperforms the known ones in terms of security, computational efficiency and the length of the public key.
	TO cite this article:Yu yong. A novel proxy signature scheme from factorization[OL].[15 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4579313


	8. Malware Process Detecting Via Hypervisor
	Shengdong Chen,Yang Zhang
	Computer Science and Technology 14 January 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recent malware processes are armed with stealthy techniques to detect, subvert malware detection facilities of the victim. Traditional host-based detection tools execute inside the very hosts they are protecting, which makes them vulnerable to deceive and subvert. To address this limitation and improve the effectiveness and accuracy of detection and the ability of tamper resistance, a VMM-based hidden process detection system is designed and implemented. The system is placed outside the protected virtual machine, using virtual machine introspection mechanism to inspect the low-level state of the protected virtual machine, and then reconstructs the guest OS data structures by guest view casting technique. Based on view comparison detection, the system indentifies the missing of the critical processes and the target hidden process. What's more, this system provides process management operations such as terminate and restart. User can configure the corresponding response mechanism with configuration files.
	TO cite this article:Shengdong Chen,Yang Zhang. Malware Process Detecting Via Hypervisor[OL].[14 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4578252


	9. Two Quantum Direct Communication Protocols Based on Quantum Search Algorithm
	XU Shu-Jiang,CHEN Xiu-Bo,NIU Xin-Xin,YANG Yi-Xian
	Computer Science and Technology 25 December 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Based on the properties of two-qubit Grover's quantum search algorithm, we propose two quantum direct communication protocols, including a deterministic secure quantum communication and a quantum secure direct communication protocol. Secret messages can be directly sent from the sender to the receiver by using two-qubit unitary operations and the single photon measurement. Theoretical analysis shows that the security of the proposed protocols can be highly ensured.
	TO cite this article:XU Shu-Jiang,CHEN Xiu-Bo,NIU Xin-Xin, et al. Two Quantum Direct Communication Protocols Based on Quantum Search Algorithm[OL].[25 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4576543


	10. A NOVEL QUANTUM STEGANOGRAPHY PROTOCOL BASED ON PROBABILITY MEASUREMENTS
	Wei Zhanhong, Chen Xiubo,Niu Xinxin,Yang Yixian
	Computer Science and Technology 24 December 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Quantum steganography is the art of hiding the fact that communications, which transmit the secret message in an insecure quantum channel, are occurring. This paper presents a novel quantum steganography protocol based on probability measurements for transmitting $n$ qubits secret message in an insecure quantum channel. In the protocol, senders embed the secret message into the cover data by POVM measurements. Then, receivers can correctly extract the secret message and recover the cover data with a certain probability by selecting two sets of appropriate protective measurement operators to act projective measurements, respectively. More importantly, the existence of the secret message has no influence on the cover data. In addition, the security of our protocol does not rely on other protocols. The paper analyzes the secrecy and the security in detail.
	TO cite this article:Wei Zhanhong, Chen Xiubo,Niu Xinxin, et al. A NOVEL QUANTUM STEGANOGRAPHY PROTOCOL BASED ON PROBABILITY MEASUREMENTS[OL].[24 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4577880

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