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.
As cross-domain file sharing is important and existing schemes have some shortcomings, an efficient credential-based scheme is proposed in this paper. Symmetric-key credential, delegation without intervention of any centralized administrator, no need for traditional ACL and mapping remote group names to local identifiers are the features of the scheme. Symmetric-key credential is flexible, computationally...
As unique nonlinear components of most block ciphers, S-boxes provide the most important confusion effect. How to design secure S-boxes is a key problem in the design of block ciphers. There have existed many methods to design S-boxes, among which the method with genetic algorithms has attracted much interest in recent years. In this paper, an effective genetic algorithm is provided for the current...
With the development of cipher instruction set extension, design of s-box instruction has received more and more attention. An s-box instruction named SboxPer is designed in this paper for fast and efficient implementation of s-boxes in common symmetric-key ciphers. By introducing PLUT, this instruction improves the efficiency of table lookup. Half-byte permutation is performed after the table lookup...
Based on bilinear pairings, a proxy signature scheme with proxy signer's privacy protection is proposed, in which a proxy signer signs messages on behalf of the original signer while the proxy signer is anonymous to anyone but the original signer. If necessary, the anonymity can be revoked by the original signer to identify the proxy signer. Neither this scheme needs any trusted third party nor the...
Secure group communication is a research hotspot. The Tree-based Group Diffie-Hellman Protocol is a fairly good key management scheme for dynamic peer group communications. Through analyzing TGDH protocol, the authors have found out that a deficiency exists with its communication mode. A lot of redundant messages are used to complete group re-keying so that more communication bandwidth will be consumed...
The concept of Zaps, two-round witness indistinguish- able proofs, was introduced by Dwork and Naor in 2000. They constructed Zaps based on non-interactive zero- knowledge proof. This left open the following problem: does there exist a non-interactive Zaps? Barak et al. and Groth et al. answered this question affirmatively under the assumption of the existence of Hitting Set Generators against co-nondeterministic...
Fairness and non-repudiation turn out to be increasingly important security services with the fast growth of electronic commerce on the Internet. We have made some game based analysis of multi-party non-repudiation protocols recently. We use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols...
A password-based authenticated key exchange (PAKE) protocol in the three-party setting allows two clients com- municating over a public network to agree on a common session key with the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we propose a new efficient password-based authenticated three-party key ex- change protocol...
In 2007, Shacham and Waters [9] propose the first effi- cient ring signature scheme, without random oracles, based on standard assumptions. And the signature size is linear in the size of the ring. In this paper, we analyze the security of Shacham and Waters ring signature [9] when using the structure of ring signature proposed by [6]. We claim that, in some cases, Shacham and Waters ring signature...
This paper establishes a theorem of generalized chaos synchronization (GCS) for bidirectional discrete systems. Based on this theorem, one can construct new chaotic sys- tems which can achieve GCS among some of the state vari- ables. As a first application, a four dimensional bidirectional GCS discrete system (BGCSDS) is introduced, whose pro- totype is the Sinai map. Numerical simulation shows that...
This paper presents a new authentication and key agreement protocol EMSR for wireless sensor network. The program can achieve mutual authentication and establish a shared session key between nodes by using public key certificate. Meanwhile, it effectively prevents the authentication problems due to the usage of purely symmetric encryption mechanism, and it has small communication cost, fast calculation...
There are well-known methods to construct message au- thentication codes using universal hash functions. This ap- proch is very promising as it provides schemes that are both efficient and provably secure under reasonable as- sumptions. But those schemes all need two keys, one for the universal hash function and one for the block cipher. Hash127MAC, proposed here, uses only one key and can be proved...
In this paper, the authors derive a new sufficient and necessary condition for the high degree congruence x n a (mod p) to have solutions from a known discriminant. Put forward the definition of the trivial solution to the congruence, elaborate two methods of computing the trivial solution in deterministic polynomial time, argue that non-trivial solutions to the congruence can not be obtained cyclically...
In a generalized (t1/n1-t2/n2) proxy signature scheme with known signers, any t1 or more original signers out of n1 original signers (1 t1 n1) can represent the original group to delegate the signing capability, and t2 or more proxy signers out of n2 proxy signers (1 t2 n2) can represent the proxy group to sign message on behalf of the original group. In the paper, we show that Hwang et al.'s generalized...
The Internet worm is a menace for the security of the Internet users. To detect and protect the Internet worm becomes an important research topic in the field of Internet security. A robust estimation method for evaluating worm infection rate is proposed in this paper. The robust estimator of worm infection rate is derived based on the robust maximum likelihood estimation principle at first; The corresponding...
The signature database of intrusion detection system is usually built by the short sequences of system call. The real-time efficiency and accuracy of intrusion detection is greatly influenced by the scale of signature database and the approach of intrusion data analysis. In this paper, a typical set method is provided to compress the normal signature database. Using the data set of UNM CERT sendmail...
Existing intrusion detection systems (IDS) operate inde- pendently from security policy enforcement mechanism. In current IDS the functionality has been restricted to detect- ing only anomaly in system behavior and system misuse. In order to assist system administrators in restoring and strengthening system security after an intrusion is detected this paper proposes a method that will link the security...
To use SVM to detect DDoS precisely, the features vector that can distinguish normal stream from attack stream is required. According to the characters of DDoS, a group of relative values features (RLT features) are proposed. For indicating the existence and intensity of DDoS attack simultaneously, multi-class SVM (MCSVM) is introduced to DDoS detection. As shown in the emulation experiments, our...
Safaa O. Al-Mamory Hong Li Zhang School of Computer Science, School of Computer Science, Harbin Institute of technology, Harbin Institute of technology, Harbin, China Harbin, China Safaa_vb@yahoo.com zhl@pact518.hit.edu.cn Abstract Intrusion alert correlation techniques correlate alerts into meaningful groups or attack scenarios for the ease to understand by human analysts. These correlation techniques...
Supervised anomaly intrusion detection systems (IDSs) based on Support Vector Machines (SVMs) classification technique have attracted much more attention today. In these systems, the characteristics of kernels have great in- fluence on learning and prediction results for IDSs. How- ever, selecting feasible parameters can be time-consuming as the number of parameters and the size of the dataset in-...
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.