2019
DOI: 10.21533/pen.v7i3.624
|View full text |Cite
|
Sign up to set email alerts
|

Lightweight novel trust based framework for IoT enabled wireless network communications

Abstract: For IoT enabled networks, the security and privacy is one of the important research challenge due to open nature of wireless communications, especially for the networks like Vehicular Ad hoc Networks (VANETs). The characteristics like heterogeneity, constrained resources, scalability requirements, uncontrolled environment etc. makes the problems of security and privacy even more challenging. Additionally, the high degree of availability needs of IoT networks may compromise the integrity and confidentially of c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…Merkle and Hellman convert it to a Trapdoor Knapsack [4], which hard to solve -choose A=(a 1 ,a 2 ,….a n ) , a i  -choose U2a n  -choose W so that gcd(U,W)=1 -compute W -1 = W (u)-1 mod U -compute E A =W*A mod U Where E A is public-key,A and W -1 are secrete to encipher is : C=E A *M To decipher : C'=w -1 *C mod U you have A and C' solve linearly form C'=A*M 2.3.1 Example: if A=(1,3,5,10) -U=20 -W=7 , gcd(7,20)=1 -then W -1 =W (U)-1 mod U =7 (7)-1 mod 7 =7 6-1 mod 7 =3 -E A =(7,1,15,10) (7*1 mod 20 , 7*3 mod 20 ,7*5 mod 20 ,7*10 mod 20) let the plaintext (M=13) then M=(1,1,0,1) to encipher is: C=E A *M=(7+1+10)=18 to decipher is: C'=C*W -1 mod U =3*18 mod 20 =14 C'=A*M=14= (1,3,5,10).M by snap(14,A*M) ,we get M=(1,1,0,1)…”
Section: Trapdoor Knapsackmentioning
confidence: 99%
See 2 more Smart Citations
“…Merkle and Hellman convert it to a Trapdoor Knapsack [4], which hard to solve -choose A=(a 1 ,a 2 ,….a n ) , a i  -choose U2a n  -choose W so that gcd(U,W)=1 -compute W -1 = W (u)-1 mod U -compute E A =W*A mod U Where E A is public-key,A and W -1 are secrete to encipher is : C=E A *M To decipher : C'=w -1 *C mod U you have A and C' solve linearly form C'=A*M 2.3.1 Example: if A=(1,3,5,10) -U=20 -W=7 , gcd(7,20)=1 -then W -1 =W (U)-1 mod U =7 (7)-1 mod 7 =7 6-1 mod 7 =3 -E A =(7,1,15,10) (7*1 mod 20 , 7*3 mod 20 ,7*5 mod 20 ,7*10 mod 20) let the plaintext (M=13) then M=(1,1,0,1) to encipher is: C=E A *M=(7+1+10)=18 to decipher is: C'=C*W -1 mod U =3*18 mod 20 =14 C'=A*M=14= (1,3,5,10).M by snap(14,A*M) ,we get M=(1,1,0,1)…”
Section: Trapdoor Knapsackmentioning
confidence: 99%
“…In the same manner of soft simple Knapsack . as example if -A=(1,3,5,10,20,80,160) -U=320 -W=7 ,gcd(7,320)=1 -compute W -1 =7 (320)-1 mod320 =7 63 mod320=183 -E A =W*A mod U =(1*7 mod 320,7*7 mod 320,5*7 mod320,10*7mod320,20*7 mod320,40*7mod320,80*7mod320,160*7 mod320) = (7,21,35,70,140,280,240,160) let H 1 =(01000111) then to encipher is: C=E A *H=701 to decipher is: C'=C*W -1 mod U =701*183 mod 320=283 C'=A*H 5 =5= (1,3,5,10,20,40,80,160…”
Section: Soft Trapdoor Knapsackmentioning
confidence: 99%
See 1 more Smart Citation
“…Parallel encryption mechanisms can be used but have their disadvantages. Tsudik highlighted the [1] disadvantages such as speed, cost factor, optimization of data sizes and so on. These methods combine the functions of confidentiality and authentication.…”
Section: Introductionmentioning
confidence: 99%
“…The researchers in the security of the WSNs have suggested many security systems that have been improved for these networks with resource limitations. A number of safe and effective routing protocols [3,4][5] [6] and encryption techniques [7,8] [9] and secure data aggregation [10,11] [12], and the key management [13,14] [15] were suggested by many WSNs security researchers. The paper is structured as follows.…”
Section: Introductionmentioning
confidence: 99%