The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In 1979, secret sharing scheme was first proposed by Shamir. In a secret sharing scheme, each participant receives a secret share in such a way that only authorized subsets can reconstruct the secret. Compare with Shamir's scheme, Juan and Huang proposed an efficient secret sharing scheme from room square in 2005. Their scheme gave a practical algorithm to reduce the computation complexity by using...
This paper proposes a new key management scheme for wireless sensor networks to reduce the memory and communication overhead, and improve the security capacity. Comparing with the typical key pre-distribution schemes, a new method of establishing keys is adopted, and is analyzed deeply in three important performance indexes. The theory of liner combination is applied to generate the keys using the...
Learning is a central task in computer science, and there are various formalisms for capturing the notion. One important model studied in computational learning theory is the PAC model of Valiant (CACM 1984). On the other hand, in cryptography the notion of "learning nothing'' is often modelled by the simulation paradigm: in an interactive protocol, a party learns nothing if it can produce a...
Bit-Torrent is the most popular peer-to-peer software because of its efficiency for distributing files. However, Bit-Torrent file sharing is infamous for copyright infringement, making the establishment of rights management technologies an urgent need. In this paper, we propose a digital rights management (DRM) mechanism to protect the copyright in Bit-Torrent. It will be a novel business model of...
Simple power analysis attacks with chosen-message techniques were applied to an RSA processor implemented with standard CMOS technology on ASIC, and the different characteristics of power waveforms caused by two types of implementation (ASIC and FPGA) were investigated in detail. We also applied comparative power analysis an advanced power analysis attack in which a pair of input data was used to...
Frequent itemsets (or frequent pattern) mining, which is the basic step during data stream mining, has been paid more and more attention by researchers. Because of the uncertainties and continuities of data stream, the time-efficiency and space-efficiency of many mining algorithms are unaccepted. In this paper, hashed table is introduced to represent the synoptic data structure. By this way, the memory...
We investigate the security difference between DSA and Schnorr's signature. The security of DSA can be reduced to the problem: to find m isin Omega, rho, thetas isin Zq* such that H(m) = P ((gpy)thetas mod p) mod q, where Omega denotes the text space and the message to is not restrained. Unlike DSA evaluates the hash function only at the message to, Schnorr's signature adopts a self-feedback mode...
A peer-to-peer (P2P) system has emerged as one of the most successful ways to share resources in distributed environment, and DHT(distributed hash table) is used as an effective approach to locate shared resources in a P2P system. This paper describes an extended DHT model by combining DHT with B+ tree. The sharing resources are represented by their attributes. Each query request is associated with...
The key and IV setup algorithms of both HC-256 and HC-128 cipher are cryptanalyzed in this paper. Both ciphers are software-efficient stream ciphers, proposed as the candidates of ECRYPT Stream Cipher Project and selected into the final portfolio. Key-schedule is one of the most important parts of designing a security cipher. The weak key initialization process is a fatal potential weakness of a cipher...
Software piracy is a major concern for organizations that create, use, and distribute digital content. Software watermarking is such a technique for protecting software by embedding secret information into the software to identify its copyright owner. This paper presents a novel robust dynamic watermarking scheme based on STBDW that first utilizes the Shamir threshold scheme to split the watermark...
We propose and evaluate the usability and security of Click to Zoom-inside (CTZ); a new graphical password authentication mechanism. Users have to click six times on one point in some given specific regions (pass regions) shown with dotted lines in a theme image displayed on the screen. The selected region is then zoom to create a next image. Exactly, we are not going to zoom the region object of...
Secret key reconciliation is an important step in the process of quantum key distribution. In the protocols used for reconciliation, Winnow has been proved a fast and efficient one. In this paper, we analyze the efficiency of Winnow in terms of amount of leaked information in details. We give the optimal block size in Winnow theoretically and experimentally for different error rate.
Data conversion between different data sets is an important research issue in computer science. Because of its computational complexity and demand for high accuracy, many data conversion problems arising in application can not be solved effectively. Based on the analysis of construction method, a new bijective function hn from natural numbers set N and its n-ary Cartesian product set Nn has been proposed...
In this paper we present an improvement to the preimage attacks on very smooth hash (VSH) function. VSH was proposed as a collision resistant hash function by Contini et al., but it has been found lacking in preimage resistance by Saarinen. With our method, we show how to find preimages of multiple passwords secured by VSH. We also demonstrate that our method is faster in finding preimages of multiple...
RAIDEN is a recent light-weight 128-bit block cipher. We report in this paper a critical weakness in its key schedule. Besides it reduces a 128-bit key down to 112-bit security, the weakness allows us to mount two related-key attacks. The best of the two attacks has a complexity of about 265. More precisely, the algorithm can be broken with one unknown plaintext, at most 33 unknown related keys, and...
Privacy-preserving data mining aims at securely extracting knowledge from two or more parties' private data. Secure multi-party computation is the paramount approach to it. In this paper, we study privacy-preserving add and multiply exchanging technology and present three new different approaches to privacy-preserving add to multiply protocol. After that, we analyze and compare the three different...
As zero-knowledge proof plays a more and more important role in modern cryptography, the need for formal analysis becomes more urgent. In this paper, we make use of formal methods to establish a zero-knowledge result. The formal model is probabilistic applied pi and the zero-knowledge proof is Hamiltonian cycle. By this example, our preliminary work shows how zero-knowledge can be modeled in formal...
In 2008, Lee-Chang pointed out that Saeednia et al.'s scheme would reveal the identity of the signer if the secret key of the signer is compromised. Then, they proposed a new strong designated verifier signature scheme that provides signer ambiguity, even if the secret key of the signer is compromised. Lee-Chang claimed that their proposed scheme is more secure and suitable for the purpose of a strong...
In many business sectors sending secure information over public channels has become a challenging task. Data encryption is not the most efficient method to counteract attacks by adversaries. One form of encryption is to use the same key by the sender for encryption as well as the receiver for decryption. World-wide encryption standards such as DES and AES are used in Government and public domains...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.