The paper presents group-oriented (t,n) threshold digital signature schemes based on the difficulty of solving discrete logarithm problem. By employing these schemes, any t out n users in a group can represent this to sign signature. size and verification time are equivalent that an individual In other words, (t, n) scheme has following five properties: (i) is mutually generated by at least members; (ii) signature; (iii) process simplified because there only one public key required; (iv) be...

Sensor networks are composed of a large number low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several pairwise key schemes have been proposed for distributed networks. These randomly select set from pool and install the in memory each sensor. After deployment, sensors can up by using preinstalled keys. Due to lack tamper-resistant hardware, vulnerable node capture attacks. The information gained captured nodes used...

A new type of authentication, call group which authenticates all users belonging to the same is proposed in this paper. The authentication specially designed for group-oriented applications. no longer a one-to-one as most conventional user schemes have one prover and verifier; but, it many-to-many has multiple provers verifiers. We propose basic t-secure m-user n-group scheme ((t, m, n) GAS), where t threshold scheme, m number participated n members group, based on Shamir's (t, secret...

Public-key digital certificate has been widely used in public-key infrastructure (PKI) to provide user public key authentication. However, the itself cannot be as a security factor authenticate user. In this paper, we propose concept of generalized (GDC) that can authentication and agreement. A GDC contains user's information, such information driver's license, birth certificate, etc., signature signed by trusted authority (CA). does not contain any key. Since have private pair, management...

With the increasing popularity and wide application of Internet, users (such as managers data consumers) in Industrial Internet Things (IIoT) can remotely analyze control real-time collected by various smart sensor devices. However, there are many security privacy issues process transmitting through public channels IIoT environment. In order to against illegal access opponents, a novel anonymous user authentication key agreement scheme based on hash elliptic curve encryption is proposed this...

The cryptographic properties of third-order linear feedback shift-register (LFSR) sequences over GF(p) are investigated. A fast computational algorithm for evaluating the kth term a characteristic sequence order 3 is presented. Based on these properties, new public-key distribution scheme and an RSA-type encryption proposed. Their security, implementation, information rate, cost schemes discussed.

The ElGamal type digital signature schemes have received wide attention recently. can provide 'subliminal' channel, message recovery, multisignature, etc. authors investigate the design criteria of scheme and develop a complete list all variations.

Instead of using the conventional m-out-of-n perfect secret sharing scheme to protect a single among n users, authors propose based on one cryptographic assumption multiple secrets. It is shown that, with this relaxation security requirement, and some related secret-sharing problems, such as cheater detection broadcasting, can be solved very efficiently.

Securing data transferred over a WSN is required to protect from being compromised by attackers. Sensors in the must share keys that are utilized transmitted between sensor nodes. There several approaches introduced literature for key establishment WSNs. Designing distribution/establishment scheme WSNs challenging task due limited resources of Polynomial-based distribution schemes have been proposed provide lightweight solution resource-constraint devices. More importantly, polynomial-based...

Physically unclonable functions (PUFs) promise to be a critical hardware primitive for billions of Internet Things (IoT) devices. The arbiter PUF (A-PUF) is one the most well-known circuits. However, its FPGA implementation has poor reliability, and error correction codes (ECCs) are usually needed eliminate noise in responses, which incur additional high overhead require NVM helper data storage. In this paper, we present highly reliable with improved uniqueness using bit-self-test (BST)...

A new digital signature scheme based on the discrete logarithm is presented. The advantages of this over ElGamal are that it simplifies generation process, speeds up verification has a broadband subliminal channel to allow any secret information be concealed in and can only recovered by insiders with key shared signer, provide an efficient multisignature.

Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms. These assumptions appear secure today; but, it is possible that efficient algorithms will be developed in the future to break more of these assumptions. It very unlikely multiple would simultaneously become easy solve. Enhancing security major objective for cryptosystems based on K.S. McCurley (1990) proposed first key distribution system two dissimilar assumptions,...

Recently, Wang introduced a novel (2, <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> ) region incrementing visual cryptographic scheme (RIVCS), which can gradually reconstruct secrets in single image with multiple security levels. In RIVCS, the secret is subdivided into regions such way that any xmlns:xlink="http://www.w3.org/1999/xlink">t</i> shadow images, where 2 ≤ , be used to reveal ( -1) th region. However, Wang's suffers from...

wireless sensor networks (WSNs). This is because nodes are limited in memory storage and computational power. In 1992, Blundo et al. proposed a noninteractive group key establishment scheme using multivariate polynomial. Their can establish of m sensors. Since each share polynomial involving - 1 variables having degree k, needs to store (k + 1) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m-1</sup> coefficients from GF(p), which exponentially...

In wireless sensor networks, the secure end-to-end data communication is needed to collect from source destination. Collected are transmitted in a path consisting of connected links. All existing routing protocols propose solutions which each link uses pairwise shared key protect data. this paper, we novel design communication. We adopt newly published group pre-distribution scheme our design, such that there unique key, called entire path. Specifically, instead using multiple keys...

A digital signature is analogous to an ordinary hand-written used in signing messages. RSA signatures have been adopted by Visa and Mastercard the secure electronic transactions (SET) standard for providing security of transfers credit payment information over internet. In SET, are provide certificates public keys authenticate The authors propose efficient method verifying signatures. Instead one at a time, it proposed batch verify simultaneously. This approach maintains same computational...

He and Dawson recently proposed a multistage (t, n) secret sharing (MSS) scheme (see ibid., vol. 30, no. 19, p. 1591-2, 1994) to share multiple secrets based on any one-way function. The public shift technique is used implement MSS. For k shared among n participants, each participant has keep only one secret; but there are total of kn values. In this Letter, the author shows an alternative implementation which requires same number for keep; k(n-t) This becomes very attractive, especially...

When two individual users wish to carry on a secure conversation, they can use the well-known RSA public key cryptosystem in doing so. This provides these both data secrecy and digital signature very efficient manner. However, many applications, multiple need sign document. In this letter, we propose modified scheme, based which will allow any number of document send it secretly receiver. The length ciphertext remains constant, no matter how great signatories. trade-off is that processing...