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 2 3 4 5 6 7 8 Next > Last >>

Select Subject

All (8830)

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 2 3 4 5 6 7 8 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. Reexamination of the security of arbitrated quantum signatures
	ZHANG Ke-Jia, WEN Qiao-Yan, QIN Su-Juan
	Computer Science and Technology 04 February 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As a new model for signing both quantum and classical messages, the arbitrated quantum signature (AQS) protocols have recently attracted alot of attentions. In this paper, we analyze their security by discussing the receiver's forgery of the signature. Different from the previous analysis,we summarize an explicit formalization of the present AQS protocols and propose the necessary and sufficient conditions against the receiver's forgeryattack. Based on the conditions, it can be verified that the attempt to design an improved optimal encryption by modifying the encryption operators isuseless to prevent the receiver's forgery of the signature. Moreover, we study the security of AQS signed for classical messages, and find it is stillsusceptible to the receiver's forgery. Finally, we provide some assistant security strategies to recover the security and discuss several potentialsecurity problems of AQS in the further research.
	TO cite this article:ZHANG Ke-Jia, WEN Qiao-Yan, QIN Su-Juan. Reexamination of the security of arbitrated quantum signatures[OL].[ 4 February 2013] http://en.paper.edu.cn/en_releasepaper/content/4519594


	2. Characteristic Behavior Sequence Based Attack Detection Method for Browser Extension
	Xu Guangquan ,Junjie Wang
	Computer Science and Technology 08 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Browser extensions enhance the browser to help meet the varied needs of a broad user population through adding personalized features to browser. However, extensions can also expose user to disastrous attacks from the web. This paper took Firefox as an example to thoroughly study its extension mechanism and security problem, designed and implemented a monitoring system, which was depended on a behavior sequence knowledge base and used to find ongoing attacks. To show the practicality of our system, we described the characteristic behavior sequences of five typical kinds of attacks. Experiments showed that our system successfully find 11 from 18 times tentative attacks.
	TO cite this article:Xu Guangquan ,Junjie Wang. Characteristic Behavior Sequence Based Attack Detection Method for Browser Extension[OL].[ 8 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4506732

Saved Papers

Saved Papers


	3. Parallel hash function using DM-based integer-valued chaotic maps network
	Liao Dong,Wang Xiaomin
	Computer Science and Technology 10 December 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A parallel hash function using DM-based integer-valued chaotic maps network is proposed which combines the advantage of both chaotic system and DM scheme. And the algorithm has avoided the flaw of the forgery attack of the exiting parallel hash functions. The algorithm can be used to calculate hash values of 128, 160, 192, 256, 384 and 512 bits with little difference in performance for the different hash values. The message is partitioned into message blocks with fixed length and each message block is processed by the integer-valued chaotic maps network in parallel. The final hash value is generated with a sponge-like construction， which confuses the mixed result of all the outputs of the integer-valued chaotic maps network. The hash function is mainly implemented by extend integer-valued tent maps and can work in a parallel mode, which guarantees good security and high efficiency. Theoretical and simulation results show that the proposed hash algorithm has strong diffusion and confusion capability and good collision resistance. These properties make it a good candidate for hash on platforms that support parallel processing.
	TO cite this article:Liao Dong,Wang Xiaomin. Parallel hash function using DM-based integer-valued chaotic maps network[OL].[10 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4500967


	4. Secure Cloud Storage with Data De-duplication
	Wan Lei,Wang Chunlu,Liu Chuanyi
	Computer Science and Technology 15 June 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:reducing the amount of data need to be transferred, stored, and managed becomes a crucial for cloud storage. On the other hand, as user data are stored and processed by outsourced cloud provider, encryption becomes a necessary before updating data into the cloud. However, the above two goals are greatly opposed to each other. In order to solve the above conflict, a policy-based de-duplication proxy scheme is proposed in this paper. It suggests a policy-based de-duplication proxy scheme to enable different trust relations among cloud storage components, de-duplication related components and different security requirements. Further proposes a key management mechanism to access and decrypt the shared de-duplicated data chunks based on Proxy Re-encryption algorithms. This paper finally analyses the security of the scheme.
	TO cite this article:Wan Lei,Wang Chunlu,Liu Chuanyi. Secure Cloud Storage with Data De-duplication[OL].[15 June 2012] http://en.paper.edu.cn/en_releasepaper/content/4482237


	5. Cryptanalysis of a Handover Authentication Protocol Based on Bilinear Pairing Functions
	He Debiao
	Computer Science and Technology 18 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recently, He et al. proposed a novel handover authentication protocol based on bilinear pairing functions. They claimed that their protocol could withstand various attacks. However, in this letter, we will show that He et al.'s protocol is not secure at all, i.e. the adversary could get a user's private key from transmitted messages.
	TO cite this article:He Debiao. Cryptanalysis of a Handover Authentication Protocol Based on Bilinear Pairing Functions[OL].[18 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4473987


	6. Deniable Message Transmission Authenticator Based on Weak Signature Schemes
	TianHaibo
	Computer Science and Technology 10 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper shows how to use signature schemes for deniableauthentication. Deniable authentication means that a messagereceiver R, although received a message m from a sender S,cannot convince a third party that the sender S has sent R themessage m. Obviously, signature schemes secure againstexistential forgery are unsuitable for such a deniabilityproperty. However, if signature schemes are just secure againstselective forgery, we can construct a deniable authenticationprotocol. The protocol is presented in the extension framework ofRaimondo et al. as a deniable message transmission (MT)authenticator.
	TO cite this article:TianHaibo. Deniable Message Transmission Authenticator Based on Weak Signature Schemes[OL].[10 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4474877


	7. A trusted multi-party authentication scheme based on proactive-ElGamal threshold secret sharing system
	YANG Yuguang,CHAI Haiping
	Computer Science and Technology 12 March 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In most existing authentication schemes users are authenticated by the server one by one which results in lower efficiency of authentication when the number of users is large. Aiming at the drawback, we propose an efficient trusted multi-party authentication scheme based on threshold secret sharing, the discrete logarithm problem and ElGamal cryptosystem. Using (t,n) threshold secret sharing idea, we propose a (t,n) threshold authentication scheme which can not only simultaneously authenticate t users satisfying some specific conditions, but also authenticate new users dynamically by distributing a new authentication key for the new user which was produced by t old users and the new user together. Finally, the security and efficiency of the proposed scheme are analyzed.
	TO cite this article:YANG Yuguang,CHAI Haiping. A trusted multi-party authentication scheme based on proactive-ElGamal threshold secret sharing system[OL].[12 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4471290


	8. Conditionally Anonymous Ring Signature \ Scheme without Random Oracles
	Zeng Shengke,Qin Zhiguang,Lu Qing
	Computer Science and Technology 08 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Compared to the original ring signature scheme, conditionally anonymous ring signature allows to revoke the anonymity of the actual signer without the group manager's help, i.e., in case of dispute, the actual signer can be traced through signer's confirmation or the non-signers' disavowal. However, the previous conditionally anonymous ring signature schemes rely on random oracles, in the other words, the security of such schemes depend on the randomness of the hash functions. In order to improve the security, this paper proposes a ring signature scheme with traceability without random oracles in the common reference string model.
	TO cite this article:Zeng Shengke,Qin Zhiguang,Lu Qing. Conditionally Anonymous Ring Signature \ Scheme without Random Oracles[OL].[ 8 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4463457


	9. A note on asynchronous multi-exponentiation algorithm using binary representation
	Da-Zhi Sun
	Computer Science and Technology 08 January 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A basic but expensive operation in implementations of several famous public-key cryptosystems is the computation of the multi-exponentiation in a certain finite multiplication group. In 2007, Yang et al. presented an interesting asynchronous multi-exponentiation algorithm called the SUt method, which uses the binary representations for the exponents. In this note, we analyze the computational efficiency of the SUt method by modeling the scanning process as a Markov chain. It shows that their computational efficiency result is incorrect. Moreover, we make a performance comparison among the published techniques and show the performance of a modified sliding window method is better than that of the SUt method, when there are 4 or more additional registers. We hope that our research will be convenient to the development of the cryptographic devices.
	TO cite this article:Da-Zhi Sun. A note on asynchronous multi-exponentiation algorithm using binary representation[J].


	10. Adaptive window method for multi-scalar multiplication under resource-constrained environments
	Da-Zhi Sun
	Computer Science and Technology 04 January 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A basic but expensive operation in implementations of several famous public-key cryptosystems is the computation of the multi-scalar multiplication in a certain finite additive group defined by an elliptic curve. In this paper, we propose an adaptive window method for the multi-scalar multiplication, which can balance the computation cost and the memory cost under the resource-constrained environments. By modeling the scanning process as a Markov chain, we analyze the computational efficiency of this adaptive window method using the non-adjacent form (NAF) representation. When there are 2-4 extra registers, the adaptive window method using the NAF representation on average requires 11%-19% fewer additions than the Shamir trick using the joint sparse form (JSF) representation. In order to reduce the number of required registers, our strategy in the adaptive window method is not to store all values of the possible block pairs in the certain representations of two integers, but only to store those values with high probabilities.
	TO cite this article:Da-Zhi Sun. Adaptive window method for multi-scalar multiplication under resource-constrained environments[OL].[ 4 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4458858

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