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 36 papers published in subject: > since this site started.

Results per page:

36 Total, 4 Pages | << First < Previous 1 2 3 4 Next > Last >>

Select Subject

All (8831)

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:

36 Total, 4 Pages | << First < Previous 1 2 3 4 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. 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


	2. Joint Error Linear Complexity of pn-Periodic Multisequences Over Fp
	Ming Su
	Computer Science and Technology 29 November 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recent developments in stream ciphers point towards aninterest in vectorized stream ciphers. According to the definitionof the joint linear complexity of multisequence, we extend it to thejoint error linear complexity of multisequence to study thestability of multisequences. We investigate the counting functionsof the joint error linear complexity of t-multiple 2n and pn-periodic multisequences with a few term errors in each singlesequence. Moreover, we propose efficient algorithms for computingthe joint error linear complexity of these kinds of multisequences,as well as the algorithms for determining all the error vectors thatgive the joint error linear complexity. Being familiar with thedistribution and having the efficient algorithms for computing thejoint error linear complexity, we can choose the parameters of t -multiple multisequence of these kinds of multisequences forlarge joint error linear complexity purpose.
	TO cite this article:Ming Su. Joint Error Linear Complexity of pn-Periodic Multisequences Over Fp[OL].[29 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4452389

Saved Papers

Saved Papers


	3. A new strong multiple designated verifiers signature for broadcast propagation
	Tian Haibo
	Computer Science and Technology 21 August 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A strong multiple designated verifiers signature (SMDVS) enables a signer to convince a set ofverifiers by generating one signature, of which the verification needs the private key of averifier. After a brief survey of the current SMDVS schemes, there are noschemes suitable to the broadcast propagation, where the simulation needs only one verifier's private key.Motivated by this discovery, this paper proposes a broadcast SMDVS scheme.The new scheme is proven secure in the random oracle model.
	TO cite this article:Tian Haibo. A new strong multiple designated verifiers signature for broadcast propagation[OL].[21 August 2011] http://en.paper.edu.cn/en_releasepaper/content/4439843


	4. Modeling and Analysis of Self-stopping BT Worms Using Dynamic Hit List in P2P Networks
	Luo Jiaqing,Xiao Bin,Zhou Shijie
	Computer Science and Technology 05 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Worm propagation analysis, including exploring mechanisms of worm propagation and formulating effects of network/worm parameters, has great importance for worm containment and host protection in P2P networks. Previous work only focuses on topological worm propagation where worms search a hosts neighbor-list to find new victims. In BitTorrent (BT) networks, the information from servers or trackers, however, could be fully exploited to design effective worms. In this paper, we propose a new approach for worm propagation in BT-like P2P networks. The worm, called Dynamic Hit-List (DHL) worm, locates new victims and propagates itself by requesting a tracker to build a dynamic hit list, which is a self-stopping BT worm to be stealthy. We construct an analytical model to study the propagation of such a worm: breadth-first propagation and depth-first propagation. The analytical results provide insights of the worm design into choosing parameters that enable the worm to stop itself after compromising a large fraction of vulnerable peers in a P2P network. We finally evaluate the performance of DHL worm through simulations. The simulation results verify the correctness of our model and show the effectiveness of the worm by comparing it with the topological worm.
	TO cite this article:Luo Jiaqing,Xiao Bin,Zhou Shijie. Modeling and Analysis of Self-stopping BT Worms Using Dynamic Hit List in P2P Networks[OL].[ 5 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4403654


	5. Analyzing Security Issues in Peer-to-Peer Networks with Threat Modeling
	Li Sai
	Computer Science and Technology 15 November 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The increasing use of Peer-to-Peer (P2P) Networks has brought its security issues under the scrutiny of the public eyes and under the close observation of the malicious users. Since the P2P communication model differs from that of conventional server and client system, P2P Networks meet more threats than traditional networks. However, there is the lack of a comprehensive process to designing P2P Networks protection solutions. In this paper, we discuss the Threat Modeling Process for analyzing security issues in P2P Networks, which aims at organizing system threats and vulnerabilities into general classes to be addressed with known protection techniques. Although there has been prior work on threat modeling primarily for software applications, to our knowledge this is the first attempt at threat modeling for P2P Networks. We summarize protection challenges unique to P2P Networks and propose a process to creating a threat model for P2P Networks, which based on the following security principles: Confidentiality, Integrity, Availability, Authentication, Anonymity, and Trust (CIAAAT). We hope this initial work will give some inspirations to P2P Network designers and start a discussion on how to better design and implement protection solutions for P2P Networks.
	TO cite this article:Li Sai. Analyzing Security Issues in Peer-to-Peer Networks with Threat Modeling[OL].[15 November 2010] http://en.paper.edu.cn/en_releasepaper/content/4391680


	6. applications of proxy re-encryption in multi-decryptor encryption environments
	Wang Hongbing,Cao Zhenfu
	Computer Science and Technology 01 April 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Among multi-user cryptography, multi-decrypter encryption shows its particular applications. In multi-decrypter encryption, a message encrypted under multiple decrypters can only be decrypted when all the decrypters cooperate. However, the decryption fails if one of these decrypters can not access to the Internet. In this letter, we propose a simple method to ensure the decryption be successful when some of these decrypters are not online by using proxy re-encrypton. Considering the typical appliction of multi-decrypter encryption, our method seems more valuable.
	TO cite this article:Wang Hongbing,Cao Zhenfu. applications of proxy re-encryption in multi-decryptor encryption environments[OL].[ 1 April 2010] http://en.paper.edu.cn/en_releasepaper/content/41455


	7. Finite Automata Theory with Membership Values in Lattices
	Li Yongming
	Computer Science and Technology 05 February 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we study finite automata with membership values in a lattice, which are called lattice-valued finite automata. The extended subset construction of lattice-valued finite automata is introduced, then the equivalences between lattice-valued finite automata, lattice-valued deterministic finite automata and lattice-valued finite automata with varepsilon$-moves are proved. We give a simple characterization of lattice-valued languages recognized by lattice-valued finite automata, then we prove that the Kleene theorem holds in the frame of lattice-setting. A minimization algorithm of lattice-valued deterministic finite automata is presented. In particular, the role of the distributive law for the truth valued domain of finite automata is analyzed: the distributive law is not necessary to many constructions of lattice-valued finite automata, but it indeed provides some convenience in simply processing lattice-valued finite automata.
	TO cite this article:Li Yongming. Finite Automata Theory with Membership Values in Lattices[J].


	8. Centroid-based semi-fragile audio watermarking in hybrid domain
	Hong-Xia Wang,Ming-Quan Fan
	Computer Science and Technology 31 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Most of the previous (semi-) fragile audio watermarking schemes adopted binary image as watermark, which might reduce the security of watermarking systems. Moreover, the applicability of content or feature-based second generation digital watermarking is limited, and partial feature points may be damaged under watermarking operations and various common signal processing. Aiming at these problems, a novel centroid-based semi-fragile audio watermarking scheme in hybrid domain is proposed in this paper. The theoretical lower limit of signal to noise ratio (SNR) used to objectively evaluate the imperceptibility of watermarked audio signal is deduced and given. In addition, the watermark embedding capacity and the ability of tamper detection are also theoretically analyzed. Initially, the centroid of each audio frame is computed, and Hash function is performed on the obtained centroid in order to get the watermark. Finally, the audio sub-band which carries centroid of audio frame is performed with discrete wavelet transform (DWT) and discrete Cosine transform (DCT), and the encrypted watermark bits are embedded into the hybrid domain. Theoretical analysis and experimental results show that the proposed scheme is inaudible and suitable to different kinds of audio. Furthermore, the ability of tamper detection and tolerance against common signal processing operations are all excellent. Comparison with the existing schemes, the proposed scheme can not only resolve the issue of the veracity and integrity of audio content authentication effectively, but also popularize the applicability of content -based audio watermarking scheme.
	TO cite this article:Hong-Xia Wang,Ming-Quan Fan. Centroid-based semi-fragile audio watermarking in hybrid domain[OL].[31 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38354


	9. A Novel Image-hiding Scheme Based on Quantizing Factor and Matching Factor in DWT
	Xiang Yong,Chen Yong
	Computer Science and Technology 23 November 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A novel image-hiding scheme is proposed in this paper. On the basis of analysing the correlation between the cover-image and the secret-image in DWT, by adjusting quantizing factor and matching factor, the stego-image quality and security of image hiding can be greatly improved. Experimental results show that the stego-image has a high quality , the stego-image is almost the same as the cover-image, and image-hiding scheme has a good robustness.
	TO cite this article:Xiang Yong,Chen Yong. A Novel Image-hiding Scheme Based on Quantizing Factor and Matching Factor in DWT[OL].[23 November 2009] http://en.paper.edu.cn/en_releasepaper/content/36924


	10. Fast Identity-Based Encryption Using Combined Public Keys
	Jiqiang Liu,Sheng Zhong
	Computer Science and Technology 20 March 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Identity-based encryption (IBE) is a very useful tool in cryptography. It has many potential applications. However, existing IBE schemes are signicantly slower than regular public key cryptosystems; thus, they may not be able to meet the need of some applications in practice. In this paper, we propose a simple IBE scheme, using a technique of combined public keys. Our IBE scheme is very fast, having time costs close to those of a regular public key cryptosystem, the ElGamal cryptosystem. We show that our IBE scheme is semantically secure under the Decisional Diffie-Hellman (DDH) Assumption. In addition, we give an identity-based signature scheme using the same technique.
	TO cite this article:Jiqiang Liu,Sheng Zhong. Fast Identity-Based Encryption Using Combined Public Keys[OL].[20 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30527

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