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.
Formal and efficient protocol analysis by pen and paper is highly desired when informal and model-checking methods are not trusted in proving correctness of complicated e-commerce protocols. Based on strand spaces, this paper presents a method for fairness analysis of offline fair exchange protocols. With the new method, this paper formally analyzes an important offline fair exchange protocol -- the...
Non-functional requirements (NFRs), apparently, have different characteristics from their functional counterparts. The ways to develop conceptual models of NFRs, therefore, do not akin to the one for functional requirements (FRs). This paper proposes a method to analyze, specify and modeling non-functional requirements especially the ones that can be manifested as operational/functional features,...
How to overcome the conspiracy attacks on threshold signature is very important problem. To resist the conspiracy attacks, many threshold signature schemes are based on the complicated variants of the Lagrange interpolation sharing scheme. Based on Asmuth-Bloom modular secret sharing, a new threshold signature scheme is proposed. The scheme can resist the conspiracy attacks, and is more efficient...
Recently, two chaotic image encryption schemes were presented, in which shuffling the positions and changing the grey values of image pixels were combined to confuse the relationship between the cipher-image and the plain-image. In this paper, we provide the known/chosen plaintext attack to recover the corresponding plaintext of a given ciphertext. Furthermore, we point out that the two schemes are...
In this paper, a novel deterministic secure quantum communication scheme with four-qubit W states is proposed. By utilizing four kinds of unitary operations, the two legitimate users can directly transmit the secret messages based on the Bell measurements and some additional classical information. Analysis shows that our scheme has a high capacity as each W state can carry two bits of secret information,...
A modified threshold visual cryptography scheme (k, l, n)-VCS is proposed, which is used to analyze the relationship between the pixel expansion and the range of the participants?? number. Based on (k, l, n)-VCS, a more precise definition of multi-secret sharing visual cryptography scheme is given, and a new method is presented. Experimental results demonstrate that both pixel expansion and relative...
The fair exchange protocol is one of the most fundamental cryptographic tool in many security applications such as contract signing protocols, certified e-mail systems, and e-payment schemes. BLS short signature (due to Boneh, Lynn, and Shacham) is among the most popular cryptographic primitives in pairing-based cryptography. We propose a new fair exchange protocol which can be used to exchange BLS...
In this article, we propose an improvement on the universally composable password-based key exchange protocol. We replace one-time signature with message authentication codes which reduce the bandwidth consumption. For typical security parameters our improvement saves as much as 12 Kbytes of bandwidth in a protocol execution. Our protocol can be efficiently instantiated using either the DDH or the...
We present the formalization of a recent electronic voting scheme using GSM mobile technology (GVS) in the applied pi calculus and analyze its privacy property. A refined threat model considering not only the attacks from outsiders but also from the insiders and the collusion between them, is defined to represent the hostile voting environment, in which the privacy property is analyzed.
A new and feasible trusted remediation model was put forward, and the functions as well as the work flow of remediation model were explained in detail. Moreover, the communication and authentication process of remediation model were discussed. Simulations results show that by the proposed model, not only the safety and reliability of network can be ensured, but also the convenient and reliable remediation...
Malware detection is a crucial aspect of software security. Traditional signature-based detection method cannot detect zero-day attacks and some malware adopting some circumvention techniques such as polymorphic, metamorphic, obfuscation and packer. So some anomaly-based detection techniques are introduced to overcome this drawback, but these techniques have high false alarm rate and the complexity...
We present the first and efficient multi-authority fuzzy identity-based key encapsulation mechanism (fuzzy-IB-KEM) scheme which is chosen ciphertext secure (CCA) without random oracle in the selective-ID model. Our main idea is to enhance Chase's "large universe" construction, chosen-plaintext secure (CPA) fuzzy-IBE, by adding some redundant information to the ciphertext to make it CCA-secure.
An efficient audio watermarking algorithm with strong robustness is proposed in this paper. This algorithm firstly makes non-negative matrix factorization(NMF) transformation to host audio carrier, secondly does singular value decomposition (SVD) decomposition to the coefficient matrix, then the algorithm introduces hybrid computing model, embeds watermark into the singular value of the coefficient...
There are rare researches on how to evaluate trust models. Notation of trust is extended to make trust models comparable. An evaluation framework of trust model is proposed. The actions?? parameters are described. Two evaluation metrics are designed to present the performance of trust models objectively. Experiments are implemented to get the evaluation metrics of Josang model and Beth model. The...
Random number generators represent basic cryptographic primitives. They are widely used in modern security schemes including security protocols, computer security and password sources. In some algorithms (e.g. DSA) or protocols (e.g. zero-knowledge), random numbers are intrinsic to the computation [3]. In all these applications, strength of security depends greatly on the quality of randomness of...
Shacham-waters proposed an efficient ring signature scheme without random oracle, and proved that it??s unforgeable in their security model. But, it??s insecure in another security model proposed by Masayuki Abe et al. This article shows an existential forgery attack on the scheme, and improves this scheme in order to resist this attack.
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.