IJNSEC
2006
13 years 11 months ago
2006
The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restri...
IJNSEC
2006
13 years 11 months ago
2006
The increasing importance of the Internet has motivated the exploration of new execution models based on mobile and dynamic entities to overcome the limits of the client/server mo...
IJNSEC
2006
13 years 11 months ago
2006
This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complex...
IJNSEC
2006
13 years 11 months ago
2006
IJNSEC
2006
13 years 11 months ago
2006
Password authentication protocols range from complex public-key cryptosystems to simple hash-based password authentication schemes. One common feature of these protocols is that t...
IJNSEC
2006
13 years 11 months ago
2006
Electronic payment systems have gradually become an important issue nowadays because of the popularity and importance of electronic commerce on the Internet. Security and convenie...
IJNSEC
2006
13 years 11 months ago
2006
Nodes in a mobile ad hoc network need to thwart various attacks and malicious activities. This is especially true for the ad hoc environment where there is a total lack of central...
IJNSEC
2006
13 years 11 months ago
2006
The first dynamic threshold decryption scheme from pairing is presented. It is secure in groups equipped with a bilinear map, and caters to some important requirements in real app...
IJNSEC
2006
13 years 11 months ago
2006
The Short Secret Sharing Protocols (S3P), proposed by Roe et al in 1998 [13] and revised in 2003 [14], is a family of protocols that bootstrap secure session keys from weak secret...
IJNSEC
2006
13 years 11 months ago
2006
In this paper we analyze the security of Koyama scheme based on the singular cubic curve for some well known attacks. We provide an efficient algorithm for linearly related plaint...