2020
DOI: 10.1007/s11071-020-05463-3
|View full text |Cite
|
Sign up to set email alerts
|

An authentication protocol based on chaos and zero knowledge proof

Abstract: Port Knocking is a method for authenticating clients through a closed stance firewall, and authorising their requested actions, enabling severs to offer services to authenticated clients, without opening ports on the firewall. Advances in port knocking have resulted in an increase of complexity in design, preventing port knocking solutions from realising their potential. This paper proposes a novel port knocking solution, named Crucible, which is a secure method of authentication, with high usability and featu… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 34 publications
0
11
0
Order By: Relevance
“…Hence the suggested cryptosystem has 256 states so the maximum information entropy will be approached to 8. The information entropy 'm' can be estimated by utilising the formula as H(m) = 2 K −1 i=0 p(m i ) log b (1/p(m i )) (12) whereas p(m i ) is the probability of the message 'm', the 2 K in the above equation is the number of possible outcomes for the number of bits 'K' included for each message. The entropy values are evaluated for different standard images having a size of 512 × 512 × 3 and channels wise having a size of 512 × 512.…”
Section: Entropymentioning
confidence: 99%
See 2 more Smart Citations
“…Hence the suggested cryptosystem has 256 states so the maximum information entropy will be approached to 8. The information entropy 'm' can be estimated by utilising the formula as H(m) = 2 K −1 i=0 p(m i ) log b (1/p(m i )) (12) whereas p(m i ) is the probability of the message 'm', the 2 K in the above equation is the number of possible outcomes for the number of bits 'K' included for each message. The entropy values are evaluated for different standard images having a size of 512 × 512 × 3 and channels wise having a size of 512 × 512.…”
Section: Entropymentioning
confidence: 99%
“…Chaos-based encryption technique is preferred over some other existing methods because of less computational power, fast, and accurate. The future work is also extended to the direction of quantum-based cryptography, chaos quantum-based cryptography, and post-quantum random bit generators [4][5][6][7][8][9][10][11][12].In the last few years, a large number of encryption algorithms schemes were proposed to secure the digital information from eavesdroppers and advertisers such as international data encryption algorithm (IDEA), data encryption standard (DES), and advanced encryption standard (AES) [13][14][15][16][17][18][19][20][21][22]. The foremost importance is given in implementing resolute protection while studying the hybrid properties of confusion and diffusion which was proposed by Claude Shannon as in [23,24].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Chaotic systems can produce random data that can be employed in a cryptosystem [38]. In [38][39][40][41], researches have reported a number of encryption schemes that used chaotic maps, which are well suited for light weight encryption and offer ergodicity, sensitivity, and randomness. [38][39][40][41].…”
Section: Related Workmentioning
confidence: 99%
“…In [38][39][40][41], researches have reported a number of encryption schemes that used chaotic maps, which are well suited for light weight encryption and offer ergodicity, sensitivity, and randomness. [38][39][40][41]. In our work, we have also used the aforementioned properties of chaos and proposed a scheme for protection data from attackers.…”
Section: Related Workmentioning
confidence: 99%