Certificateless public key cryptosystem overcomes the problem of certificate management in certificate-based and inherent escrow identity-based cryptosystem. Signcryption is a cryptographic primitive that combines both functions digital signature encryption logical single step with lower computational costs communication overheads than traditional then approach. In this paper, we proposed new scheme which more efficient all schemes available. Our based on CDH DL assumption. Moreover,...

Encrypted traffic classification plays a vital role in cybersecurity as network encryption becomes prevalent. First, we briefly introduce three mechanisms: IPsec, SSL/TLS, and SRTP. After evaluating the performances of support vector machine, random forest, naïve Bayes, logistic regression for classification, propose combined approach entropy estimation artificial neural networks. is classified encrypted or plaintext with estimation. then further using We packet’s sizes, packet's...

Aggregate signatures are excellent in simultaneously verifying the validity of multiple signatures, which renders them highly suitable for bandwidth-constrained environments. The certificateless public key system is among most advanced cryptosystems at present. Scholars have combined their advantages to develop aggregate signature schemes, applicable secure communication Vehicular Ad-hoc Networks (VANETs). Recently, Cahyadi E F et al. put forward a scheme specifically designed use VANETs....

Hall’s sextic residue sequences of prime period [Formula: see text] with have some desirable features pseudorandomness, such as high linear complexity, two-level periodic autocorrelation, nice aperiodic auto-correlation measure (correlation order text]) and in particular the 2-adic complexity for special (related to difference set). In this study, we prove a lower bound on all text], which implies that is at least expected value text]-periodic binary sequences. However, numerical analysis...

Data deduplication can solve the problem of resource wastage caused by duplicated data. However, due to limited resources Internet Things (IoT) devices, applying data IoT scenarios is challenging. Existing frameworks for are prone inefficiency or trust crises random allocation edge computing nodes. Furthermore, side-channel attacks remain a risk. In addition, after devices store in cloud through deduplication, they cannot share their efficiently. this paper, we propose secure and efficient...

Cloud data auditing is essential to ensure the integrity of cloud data. The main idea entrust audit task a third-party auditor (TPA) with powerful computing ability. However, TPA may lead leakage and become single point failure. Recently, blockchain has been introduced solve these problems by TPA. dynamic storage structure developed traditional does not apply blockchain. This paper proposes blockchain-based collaborative public scheme for We design service provider(CSP) generate challenge...

Digital signature, as an important cryptographic primitive, has been widely used in many application scenarios, such e-commerce, authentication, cloud computing, and so on. Certificateless Public Key Cryptography (PKC) can get rid of the certificate management problem traditional Infrastructure (PKI) eliminate key-escrow identity-based PKC. Lately, a new Signature (CLS) scheme proposed by Kyung-Ah Shim (IEEE SYSTEMS JOURNAL, 2018, 13(2)), which claimed to achieve provable security standard...

We define a family of 2e+1-periodic binary threshold sequences and p2-periodic by using Carmichael quotients modulo 2e(e>2) 2p (p is an odd prime), respectively. These are extensions the construction derived from Fermat prime in our earlier work. determine exact values linear complexity, which larger than half period. For cryptographic purpose, complexities this letter desired values.

An m-sequence is the one of largest period among those produced by a linear feedback shift register. It possesses several desirable features pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation for applications to communications. However, it also undesirable low complexity. Here we prove nontrivial upper bound on its arithmetic autocorrelation, another figure merit introduced Mandelbaum error-correcting codes later investigated Goresky Klapper FCSRs. The...

We investigate the $ k$-error linear complexity of pseudorandom binary sequences period p^{\mathfrak{r}} derived from Euler quotients modulo p^{\mathfrak{r}-1} $, a power an odd prime p for \mathfrak{r}≥2 $. When \mathfrak{r} = 2 this is just case polynomial (including Fermat quotients) $p which has been studied in earlier work Chen, Niu and Wu. In work, we establish recursive relation on k $-error \mathfrak{r}≥3 also state exact values 3 From results, can find that (of $) does not decrease...

Summary Range‐free localization is a widely concerned technique that supports many essential network applications like coverage and clustering. Most existing technologies assume nodes are uniformly distributed in regular with no obstacles propagation paths between pairwise close to straight lines. However, real‐world scenarios, topology usually irregular, resulting estimated distances differ significantly from the corresponding physical poor anchor deployment. These will lead erroneous...

We extend the construction of $p^2$-periodic binary thresholdsequences derived from Fermat quotients to $d$-ary case where $d$is an odd prime divisor $p-1$, and then by defining cyclotomic classesmodulo $p^{2}$, we present exact values linear complexityunder condition $d^{p-1}\not \equiv 1 \pmod {p^2}$. Also, weextend results Euler modulo $p^{r}$ with oddprime $p$ $r \geq 2$. The complexity is very close theperiod desired value for cryptographic purpose. Theresults corresponding...

Certificate less Public Key Cryptography (CLPKC) as a new paradigm was introduced by Al-Riyami and Paterson in Asia crypt 2003, which removes the use of certificate to ensure authenticity user's public key traditional certificate-based cryptography also overcomes escrow problem identity-based cryptography. However, it does suffer from an attack called Denial-of-Decryption (DOD) its nature is similar well known Denial-of-Service(DOS)attack. In ASIACCS 2007, K. Liu, M. Au W. Susilo proposed...