With the rapid development of wireless networks, security and accessibility are two crucial issues in device-to-device (D2D) transmission. These networks are typically created for data morality and confidentiality. They could easily acquire wireless sensor nodes because of their design. Additionally, the group's operational nodes are the most alluring to attackers. Therefore, research on data aggregation security is crucial in order to address this security threat. To secure data aggregation in sensor networks in this situation, a number of encryption techniques with high communication overhead have been proposed. We have developed the Secure Information Sharing protocol (SeIS), which stands out for using homomorphic encryption. We choose Elliptic Curve Cryptography (ECC) curve 25519 with a general discrete-logarithm algorithm for optimization in order to distinguish participants who are exchanging data with other parties by keeping track of the current state of wireless devices and to identify function by key trace communication among User Devices (UD) and other developed nodes. We use advanced ORCID: 0000-0001-9737-3273 (Mohsin Ali); 0000-0003-0254-8670 (Nurgul Nalgozhina); 0000-0003-1120-5741 (Olzhas Tasmagambetov); 0000-0002-5172-8339 (Yerzhan N Seitkulov)
AES operations for performance evaluation because they have a shorter computational time, very little communication overhead, and a small increase in calculation that is negligible compared to correspondence costs, which increases the network's lifespan.
Wireless sensor networks have captured significant research attention in recent years due to their widespread solicitations in numerous home and commercial applications [1]. A wireless sensor network is constructed using a number of base stations and small sensor devices with constrained battery life, memory, bandwidth, and processor power. The network's lifespan is harmed by the energy consumption of these devices' communication [25]. Energy needed for communication [35] is especially much more advanced than the energy needed for calculation [2]. As a result, a technique that significantly slows down communication movement [3] in wireless sensor networks has been proposed to reduce the volume of data packets that are communicated through sensor nodes. Security in wireless sensor networks is a crucial issue [24].
Proceedings of the 7th International Conference on Digital Technologies in Education, Science and Industry (DTESI 2022), October 20–21,
2022 Copyright for this paper by its authors. Data packets are encrypted once and only decrypted at the base station in an end-to-end or concealed data aggregation scheme [37]. Homomorphism-based cryptosystems are employed for this privacy [26]. These cryptosystems directly process the ciphertexts, reducing communication overhead and security flaws at intermediate nodes [27]. Furthermore, Priyadharshini, T. [36] previously presented a key distribution scheme, but it cannot be used for decentralised D2D communication. To ensure message confidentiality and generate a shared session key for encryption, we have suggested the secure information sharing protocol (SeIS).
The recipient is expected to send a crucial piece of information to the evolved node B (eNB) in order to decode the facts; as a result, performing acceptance is not rejected, which is a crucial aspect of the proposed protocol. We choose the Elliptic Curve Cryptography (ECC) curve 25519 to optimise the algorithm. This paper makes two main contributions: 1) During configuration, we provide a SeIS protocol in wireless transmission environments to distribute the property among the customers in a morally and secretively manner across end-to-end encoding. Additionally, the receiver can alert the manager to the incident by authenticating signatures and reporting a response. As a result, the false information might not reach other customers. 1.1.
Contribution • We create a register table in eNB (Evolved Node B) in favour of unbounded-voyage identification to improve the accessibility of SeIS protocol at the key allotment stage. The register table is also in use, suggesting the artificial individuality to the associated original individuality to ensure monitorability. • We use the curve 25519 optimal expansion field for quick multiplication and quick inversion in order to optimise the security features. 1.2.
3 provides background information and an explanation of the suggested protocol's fundamentals. The intended protocol is generated and listed in Section 4; Section 5 also includes a security analysis. The suggested protocol's implementation is evaluated in Section 6 using thorough simulations. A case study is presented in Section 7 and this paper is concluded in Section 8.
We look at the method used to connect devices in a wireless network. Through wireless networks, consumers can access their profiles, which can be used to foster customer authenticity. Wireless is typically used to distribute media components among communal networks, but some UEs can recognise the nodes and gather these communications. As a result, rather than speaking with a cellular base station, another person can immediately communicate with those UEs to obtain sensitive information. We look at a three-layer calm stratified framework. Sensing layer quiet with a variety of surveillance tools are used to collect data first, which is then transferred to a set of entrances that combine the collected data before sending it over the internet to a centre for implementation.
network.
The procedure includes of , , and . : Sharing public key for existents, and producing the secure boundaries.
: Combining mobile UEs and wireless network server.
: Illustrating the individual user equipment.
Therefore, the bilinear map ̂: 1 × 1 → 2 gratifying the subsequent characteristics, 1) Bilinear: for the entire , ∈ 1 and ∀ , ∈ ∗, where ∗ = { ∈ |0 ≤ < , ( , ) = 1}. We have ̂( ,
) = ̂( , ) . 2) Symmetric: ̂( , ) = ̂( , ).
∈ 1, we have ̂( , ) = 1 2 if = 1 1 or = 1 1 .
pairing over elliptic curve as well as a 160-bit prime order q is supposed to achieve an 80-bit security level. In our chosen curve 25519, a 255-bit integer might be separate into 4 or 8 or 10 or 12 parts to adapt the capabilities of various processors to collect 128 bit security level; an optimal expansion field is linked to a specific number of fragments. 3.2.
The cipher text of message 1 and 2 can smoothly identify the decrypted solution of ( 1) ⋅ ( 2) is similar to the decrypted communication ( 1 + 2). This assumes the adjunct conclusion about dual various plain texts possible to acquire through formerly relevant coded texts, instead of combining system collectively within plain texts prior to encrypt. Such characteristic will be completely utilized among the biography identical procedure.
protocol that combines the advantages of symmetric and public key cryptography. To achieve the goal of protection in wireless transmission, we investigate unite PKI-supported signature as symmetric key encryption. Entity verification and data influence are accomplished through the use of digital signatures.
4.1.
System Parameter origination:
produces the system parameter assembling ( , 1, 2, 1, 2, ̂), as well as two unique manner hash functions 0: {0,1}∗ → ∗, 1: {0,1}∗ → . Moreover, chooses individual secure symmetric encryption algorithm ). Ultimately, the system parameters is being released, (⋅) as well as an Elliptic Curve ( , = ( , 1, 2, 1, 2, ̂, 0, 1, (⋅), , ) (1) Suppose detecting items maintaining { }
detected principles and desiring to convey authorities through utilization essence across a distributed network of intelligent equipments. Suggested elliptic curve arguments are submitted in NSA suite cryptology [6]. A planning operation should maintain the strategy of this additive homomorphic characteristic, through supplement of two plaintexts ( 1 + 2) designed for the sake of adjunct of their identical elliptic curve items 1 + 2 = ( 1) + ( 2). We utilized the mapping operation explained in [7] which plots an integer ∈ for the sake ofitem acquired through summing the creator point to independently periods.
: After dispatching a bunch application, the gateway arbitrarily chooses from announce her public key
. Every detection element , in occupancy about a detected measure , chooses a arbitrary ∈ and estimates the pair ( , + ( )) where = ( ). This couple of items are the encryption of , which is utilizing the elliptic bend elgamal cryptographic system.
Individually such two elements relate about elliptic curve as well as contains two counterparts and of the volume of the modulus (e.g. 255 bits). Such couple of thing is encoding of , which is utilized elliptic curve elgamal cryptographic system. By this point squeezing methods, besides of align, just single additional bit is needed for illustrate the y align (whereas here is merely two remedies for Weirstrass formula to illustrates the curve), consequent within a element of length 1 + segments. Therefore for describe ( ), we integrate the two points to acquire a ciphertext 2 of and ∈ length 2(1 + 2 ) bits. We notice =
( ). : Next to encoding, every detection item i allocates the acquired ciphertext to n intelligent targets utilizing ( , ) Shamir secret distribution method. Next, the item haphazardly picks a polynomial in
were remains a bigger prime compare to encoded contents, e.g. 328 segments as of length 163 bits. A polynomial
is the extent of − 1 and over steady collaborative the ciphertext . Thus item allocates allowances to nodes as { ( ( ))} , where ( ( )) becomes dividend, obtained through entity (among community attributive ( )) based on detection element . Through utlizing identifiers we ensure that portions obtained along with a mixing entity are assessments of various polynomials at the identical index ( ), that permits their association. polynomial
= ∑
macro- portion = ∑ =1
( ( )). Such macro-portion is further the analysis of the super =1 at ( ), ( ( )). After that is transferred to the portal for furthur : Every object merges the
segments, obtained from detecting elements form a dispatch them to the monitoring center across the Internet. After obtaining shares { ( ( ))} =1, gateway interposes them to retrieve the brilliant polynomial holding as steady factor of the sum of ciphertexts ∑ =1
. Utlizing this complete accumulative homomorphic attribute of the encryption system which is explained in (1), this aggregate might be decrypted to the summation of plaintexts the pair (
Server Registration: The records to through . first estimates ), and makes the Paillier encryption public key and private key ( , ) for , ) will be safely delivered to . release to the system.
= . Next the vital private key 0, and public key 0 = 1 0.
User Enrollment: calculates = 0( ) while enrolls to the method with . Next arbitary choices an integer ∈ ∗ while the private key of as well as settles the public key = 1 . The combination ( , ) transmit to through the safe channel. Additionally, establish 4.2. User Enrollment Corresponding in WNS and individually present their enrollment solicit to the through safe channel. transfers the message { ∥ ( ) ∥ | | ∥
∥ }, wherever ( ) PK is encoded through the Paillier homomorphic algorithm. becomes artificial - individuality of . | | is the complete concern Moreover, illustrates the user’s geographical position. is the instants. Through all substances enlisted within the framework the
decides an authenticity among consumers: 1) calculates ( ) =( ) ⋅ ( )
, since we referred earlier, in this Paillier homomorphic encryption, presents the summation effect for two consumers’ concern vectors. be able to decrypt ( )
by utlizing own Paillier private key.
1 1 1 1 1 0 1 1 … … … |
| indicate the ordinary benefit about as well as . Thus, an equation uniformity record might be measured as below, ( , ) =
| | √| |⋅| | (2)
Based on above mention, the highest reliable contestant in may be identified through their reliability. The complete method of
is explained as follows.
1) The consumer arbitary selects ∈ [1, − 1] those needs to obtain the details in wireless network and estimates = . After that he transfers the wishing message { ∥ ∥ ℎ( ) ∥ ∥ (⋅)} over
. Indicate such ℎ( ) becomes exponent of media substance . 2) During obtaining communication from , initially verifies the morality of this message as well as the consumer’s uniqueness. Next dispatches the asking message to in favour of investigating a conveing applicant as per Table 3. Later, refunds the trustworthiness of candidate.
selects 0 ∈ [1, − 1] and calculates 0 ∈ [1, − 1] as well as estimates 0 = 0 ⋅ produces the sign of the claimed media substance as well as the share key 0 through . dispatches message { 0 ∥ 1 ∥ ∥ 0(⋅)} to , where is the sign of desired media substance signed by . verifies the signature of as well as produces the share key for obtaining the decryption key. To notify , transmits message { ∥ ∥ 0 ∥ 1 ∥ ∥ 0(⋅)} to him. Therefore might dispatch the media content to . 4) Obtained the message from
, confirms the fairness of the communication through verifying
0(⋅) and 1. Next chooses ∈ [1, − 1] and calculates = as key clue for . calculates the exchange key
= and encrypts records . Thereafter, produces the sign 2 of the message. Next he transfers the communication { ∥ ∥ ∥ ∥ ∥ (⋅)} to . choices ∈ [1, − 1] and calculates after produces distribute key 0 through . utilizes
0 to communication { ∥ ∥ 2 ∥ ′ ∥ ∥ ∥ encrypt ′ =
0 (⋅)} to
. ( ). Lastly, transmits the 5)
controls the fairness and sign over the obtained message from . Afterwards produces the share key 0 that is utilized to decode the message = 0 ( ′). additionally, re-encrypts
demonstrated in this way. 5.1.
can join through the security provisions. The assessment ′′ = 0 ( ) as well as transfers message to . decrypts = 0 ( ′′) and produces = . So, the required matter may be decrypted.
(⋅). After getting the shared key information may be decrypted on time. Although acceptor cannot decipher the message even if he gets the clue until he gets the other one from .
in accordance with the presumptions whereas the private key or even may not be extract. So, the data secrecy may be obtained. In addition, (⋅) is utilized to deliver data morality and information verification avoiding the message from individual-in-the-central attack. For supply the authorization and validity, the genuine matter had been approved by before broadcast. So, the reliable influence of actual content may be demonstrated through checking 1. 5.2.
interchange message among themselves, the individual verification is conducted through the regular cellular transmission. Moreover, the validates the participation with monitoring though the matches among the false recognition in the member register Table 3.
authentication of the signature 2. Before transmitting the information to other equipment, the communicator is pretended to build a signature upon its false individuality as well as the recipient be able to authenticate the signature to verify the false character of the transmitter. 5.3.
The formalities may offer non- rejection through verifying the sign 1 or 2, such signatures indicate whether communicator utilizes the private key which one has designated to sign the message. Moreover, recipient may authenticate the signature through utilizing this public key from sender. Through certifying the sign, the recipient may follow if the communicator is within the framework or not. 5.4.
verify the user’s genuine individuality (e.g. SIM card digit) to validates its accuracy. The verification among and is carried out through verifying the authenticity of signature 1 or 2. Every transmission loop needs the sender to produce a digital signature in favor of the message he dispatch. Therefore, the protocol can produce cooperative validation. 5.5.
renewed after each record circulation incident. Through mention to the element share frequency in the table, it is simple to determine the people who sets in minimum attempt on exchange data among else. 5.6.
The system's power is established over coated security is accepted, those intervals the method is as significantly difficult as smashes a portal cryptography cover extended among the elliptic curve cryptography cover. Assume an attacker needs to enter a controlled variable s i; first, he wants to recognise only k items holding portions in favour of matching ciphertext C i; then, he wants to decode the acquired ciphertext. We are currently concentrating on the strength of the next stage. Therefore, we presume negotiated nodes for combine as well as determine to expose distinct tiny - dividends through insertion and desire to build the polynomial as well as therefore retrieve the ciphertext .
Consequently, they achieve a pair = ( , + ( )).
To get , the assaulter, who is presumed to recognize together G as well as the public key , desires to search this private key for calculate and ( ) and therefore deduct the first phrase among twin from the alternate to receive . Though searching the private key measures to work out = especially recognised in term of the elliptic curve discrete logarithm problem also considered as additional inflexible compare to parallel Discrete Logarithm Problem DLP through restricted areas. The is developed like this: 5.7.
Pollard's rho method [11] is the most well-known method for solving the discrete log problem using a set of elliptic curve elements on the area of numerals cluster. Despite the fact that the new NSA (National Security Agency) cryptographic criteria [6] recommend using 256-bit elliptic curve cryptography ECC, [12] states that due to more time, 160-bit ECC may be securely implemented. This fractional time will work out the ECDLP concurrently through the tiny key lengths that are concerned (tiny ciphertexts) in order to defend our choice of elliptic curve cryptography ECC over RSA. In [13], the authors compare ECC and RSA to provide security levels against the required key sizes. 5.8.
application overlay to properly rebuild this addition result among the negotiated nodes. We need to indicate during the previous segment which is aggregate of supervised variables and whether k appropriate to n massive-portions are obtained, assuming the number of negotiated nodes is less than n-k. The following concept offers the possibility of a successful renovation.
Additionally bilinear pairing, elliptic curve point aggregation as wll as encryption or decryption process take a major part. Thus, we examine just these exercise in during contrasting among another associated method. In article [14], the performance time of various activities was evaluated on 3 one processor. The functioning time is 4.5 in favor of one bilinear pairing as well as 0.6 in order to numerical performance. This executing period of one in favour of 64 Bytes is 0.984 that was evaluated on 1.8
processor [15]. So we may roughly compute the functional period of for data through bytes on 1.50
processor. This is almost ((0.984 × 1.8)/1.50 × / 64 = 1.9 × 10−5
) based on the article [16]. In addition to the execution peiod of single elliptic curve point multiplication need around 1.8 over 3 microprocessor, this specific calculation period is demonstrated on Table 4.
times bilinear pairing. For the sake of acquire the digital signature the algorithms through decline of 19% and 29% of numerical procedure with 6 times symmetric encryption to ensure the secrecy. Therefore, the complete calculational period of our protocol is achieved. Through contrast with another associated protocol, the benefits of our protocol is indicated. In calculational period is intended in addition we contrast with protocol, the complete protocol [17]. Though we demonstrated in Table 5.
Description
Whereas requires the much computational time. 6.1.
Our chosen curve is Curve 25519 and the curve equation is 2 = 3 + 486662 2 + ( ). Where ( ) is established by 3 < ⩽ 2255 − 19, with a established-point of = 9 is a Montgomery curve. Specify is the prime 2255 − 19. Identify as the prime field / = /(2255 − 19))[√2]. Specify = 486662. Indicate that 4866622 − 4 is not a square in . Define as elliptic curve 2 = 3 + 2 + over . Identify a function 0 : ( 2) → 2 in this way: 0(∞) = 0; 0( , ) = . Specify a function : ( 2) → ∞ ∪ 2 in this way: (∞) = ∞; ( , ) = .
Currently we state that, specified ∈ 2254 + 80,1,2,3. . . , 2251 − 1, ∈ and the curve 25519 operation generates , there is a unique integer ∈ 0,1,2,3. . . , 2255 − 20 with the pursuing attribute: = 0( ) for all ∈ ( 2) so that 0( ) = mod 2255 − 19. Lastly, curve 25519( , ) is determined as . A 255-bit integer may be divided through 4 or 8 or 10 or 12 fragments to adapt the capacity of different processors; an optimal extension field is connected to a particular number of portions. Prime 2255 − 19 tracks the status: authority of 2 preserve time in field activities (as in, e.g, [18], with no impact on (presumed) security level.
Quick -coordinate point addition on our chosen elliptic curve 2 = 3 + 486662 2 + ; describes speedy -coordinate scalar multiplication, i.e., quick estimation of curve 25519. Our evaluated ( ) for each ∈ 2254 + 8{0,1. . . , 2251 − 1} with 255 doublings and 255 additions beginning from ( ); (0); ( ). At the initial and final some repetitions might be easy. The last ( ), as another values, is described as a segment / . We examine 0( ) = −2 utilizing a direct series of 254 squarings and 11 multiplications [19]. These actions contain of determined - point multiplication, scalar multiplication, point expansion, point doubling, augmentative reverse and confirmation. FazHernández et al. [30] as well as Chou [31] utlized progressed curve activities in comparatively much strong CPUs through improve direction which is unable to provided by 8-bit CPUs. For this reason our effort’s CPU price is little upper than Faz-Hernández et al. (2019) as well as Chou (2015). This is perceptible that our suggested method applies effective curve procedure in making 128-bit encryption keys. Table 7 summarizes contrast our encryption execution with available methods wherever the procedures applied identical curve forms (Montgomery) as well as hardware (AVR class) to create encrypted keys through 160-bit area. The methods endorsed various libraries as well as characteristics to enhance encoded keys’ safety and execution. Liu et al. [32] utlized optimal prime field (OPF) library to enhance scalar multiplication method and match over past performance with Gallant-Lambert
The execution proficiency of trusts upon computing a established-point or scalar-point multiplication, provide this outcome points , . Execution price of scalar multiplication mostly relies over two curve process i.e., (Point Addition) and (Point Doubling). Curve 25519 is quicker and be able to resist timing, boundary passage, twists over curve, stairs and numerical attacks (Dong et al. 2018). In our suggested technique, we obtain only 160-bit security which the cost-effective in source restrained independent equipment. We present superior execution in encrypting 128-bit keys. It may be finalized suchlike our effort produced 128-bit encrypted keys through inexpensive inner memory usage and permitted 8-bit in performing elliptic curve supported strong adjacent encryption.
1 extent polynomial assessment at a component in the restricted area . This was displayed in [23], such assessments be able to performed in ( ( 2 )2) arithmetic actions of expense (( 2 )2) individually.
executed through transfer items. This includes in counting stocks to pattern a macro-share through every supplement of expence ( 2 ), ensuing in a complexity of × ( 2 ). We may communicate entire expenses with conditions of whereas 2 = 2(1 + 2 ).
B. Communication Cost
Within allocation, a detection element transfers shares to various nodes through every portion of measure 2 ensuing in 2 conveyed bits. Within composite, every smart apparatus accepts stocks from detecting elements ruling to 2 obtained bits, merges system into single comprehensive - part that is a component of and therefore of length 2 bits. Such comprehensive - part is therefore dispatched to the entrance. As provision for a 328-bit prime , whether we examine acceptance as well as communication of estimate charges, we receive a bandwidth operating expense of 328 bits transmitted through a detecting element, and 328( + 1) bits interchanged through a transferal equipment.
It is clear that for the engaged parameters, wherever we presumed ∥ ∥= 2 ∥ ∥, the key size ∥ ∥ is the volume of 160 or 256 bits, although this remain of parameters (( , ) in favour of private exchange as well as in favour of the amount of controlled variables) be organized of twenty like utmost within this technique that certifies the high spirits through this method additionally its fitness in favour of assets restrained intelligent items.
scheme. The computational complexity of the proposed protocol is investigated across strong ECC supported 160 bit low-cost security to source restricted wireless equipment. The curve 25519 is used to provide fast performance when producing private keys using the OPF library. The proposed method in terms of performance time (clock cycles) involves encryption of 128-bit keys to generate encoded keys over a 160-bit field. To improve scaler multiplication, we used the optimal prime field (OPF) library. The information on the voltage usage of each zone is gathered, pre-processed, and sent via fixed gateways to a service location via internet determination.
These accumulated data are examined for a variety of purposes, such as broadcast administration, remote apparatus supervision, and so on. As a result, these data will be mostly used to change the status of forwarded spirits. If the circumference of the gateway is not used to overcome such an entrance, the entrance will not transmit the details into focus. To carry out such a procedure, the gateway needs to calculate the total utilised strength across the boundary, which is entirely relevant to internal usage stages. Elliptic curve cryptography implementations in wireless equipment are available events and deficiencies. Wireless equipment is limited for stream/block cypher methods that require 32-bit computation power and a large storage capacity. As a result, quickCPUs and modern encoding algorithms (which require additional storage and clock periods) can be used smoothly.
The main goal of our effort is to use the OPF library for relevant arithmetic estimations in order to maintain roughly identical security levels and strong encrypted blocks using an 8-bit CPU that only used 1-2 Kbytes of RAM. The OPF library enabled us to quickly implement curve actions in order to generate 128-bit keys and large arbitrary prime integers. Because of the in advance calculation approach, our novel protocol performed faster within encryption and provided low-cost 160-bit security. The action must be carried out without jeopardising the secrecy and confidentiality of the consumers' private data.
We have proposed the secure information sharing protocol (SeIS) for wireless transmission. The protocol is carefully set up to achieve the desired results, with the exception of adding to the load on cellular networks. The suggested protocol is suitable for wireless communication's secure informationsharing strategy. Each node in the network is able to communicate with legitimate attendees. For general brute attack, a thorough security evaluation had been introduced. The performance indicates that SeIS has less computational time than the efficiency evaluation, which had been fully estimated. To enable secure and effective association of various detected variables without displaying all of them, the suggested method accumulates homomorphic encryption through a gateway for confidential exchange.
Through a flexible gateway and private distribution, the strategy benefits from both basic security and small-scale elliptic curve cryptography. We focus on the paper by allowing for secrecy and integrity among the updated data, even though validation is a crucial area to focus on in our best effort. In our upcoming work, we'll demonstrate secure data sharing between devices that doesn't require the use of an eNB. We'll also study more general and complex application setups where the service time isn't actually present, and we'll make use of how mobility affects security in D2D transmission.
This research is funded by the Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant No. BR18574045). 10.References [1] A. Razaque, and S. S. Rizvi, Secure data aggregation using access control and authentication for wireless sensor networks, Computers & security 70 (2017) 532-545. [2] S. B. Othman, A. A. Bahattab, A. Trad, and H. Youssef, Confidentiality and integrity for data aggregation in WSN using homomorphic encryption, Wireless Personal Communications 80.2 (2015) 867-889. [3] K.A. Shim, Ch.-M. Park, A secure data aggregation scheme based on appropriate cryptographic primitives in heterogeneous wireless sensor networks, IEEE transactions on parallel and distributed systems, 26.8 (2014) 2128-2139. [4] J. L. Fernández-Alemán, C. S. Inmaculada, P. Á. O. Lozoya, and A. Toval, Security and privacy in electronic health records: A systematic literature review, Journal of biomedical informatics 46.3 (2013) 541-562, 2013. [5] A. Razaque, V. Alexandrov, M. Almiani, B. Alotaibi, M. Alotaibi, and A. Al-Dmour, Comparative
of QR Code Vulnerabilities, in Proceedings of the 2021 Eighth International Conference on
[6] M. Almiani, A. Razaque, T. Aidja, and A. Al-Dmour, Context-aware latency reduction protocol for secure encryption and decryption, International Journal of High Performance Computing and Networking 12.3 (2018) 251-260. [7] J. M. Adler, W. Dai, R. L. Green, and C. A. Neff, Computational details of the vote here homomorphic election system, in: Proc. Ann. Intl Conf. Theory and Application of Cryptology and Information Security, ASIACRYPT, 2000. [8] X. Wang, M. Chen, Zh. Han, D. O. Wu, and T. T. Kwon, TOSS: Traffic offloading by social network service-based opportunistic sharing in mobile social networks, in: Proceedings of the
2354. [9] H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, and F. Vercauteren (eds.),
[10] H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, and F. Vercauteren (eds.).
Handbook of elliptic and hyperelliptic curve cryptography, CRC press, 2005, p. 480. [11] J. M. Pollard, Monte Carlo methods for index computation ( ), Mathematics of computation, 32.143 (1978) 918-924. [12] J. Bos, M. Kaihara, T. Kleinjung, A. K. Lenstra, and P. L. Montgomery, On the Security of 1024bit RSA and 160-bit Elliptic Curve Cryptography, No. REP_WORK, 2009. [13] D. Mahto, D. A. Khan, and D. K. Yadav, Security analysis of elliptic curve cryptography and RSA, in: Proceedings of the World Congress on Engineering, 1, 2016, pp. 419-422. [14] A. J. Augusto, M. Scott, and R. Dahab, Implementing cryptographic pairings over Barreto-Naehrig curves, in: Proceedings of the International Conference on Pairing-Based Cryptography, Springer, Berlin, Heidelberg, 2007, pp. 197-207. [15] D. He, J. Bu, S. Zhu, S. Chan, and Ch. Chen, Distributed access control with privacy support in wireless sensor networks, IEEE Transactions on wireless communications, 10.10 (2011) 34723481. [16] A. Zhang, J. Chen, R. Q. Hu, and Y. Qian, SeDS: Secure data sharing strategy for D2D communication in LTE-Advanced networks, IEEE Transactions on Vehicular Technology, 65.4 (2015) 2659-2672. [17] Y. Hao, J. Tang, and Y. Cheng, Secure cooperative data downloading in vehicular ad hoc networks,
[18] A. Bender, G. Castagnoli, On the implementation of elliptic curve cryptosystems, MR 91d:11154, 16 (1990) 186–192. [19] D. J. Bernstein, Curve25519: new Diffie-Hellman speed records, in: Proceedings of the
228. [20] H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, and F. Vercauteren (eds.)
Handbook of elliptic and hyperelliptic curve cryptography, CRC press, 2005. [21] J. Girao, D. Westhoff, and M. Schneider, CDA: Concealed data aggregation for reverse multicast traffic in wireless sensor networks, In IEEE International Conference on Communications, 5 (2005) 3044-3049. [22] D. Boneh, and M. Franklin, Identity-based encryption from the Weil pairing, in: Proceedings of the Annual International Cryptology Conference, Springer, Berlin, Heidelberg, 2001, pp. 213-229. [23] H.-T. Kung, Fast evaluation and interpolation, Carnegie-Mellon University, Department of
[24] R. Rahim, S. Murugan, S. Priya, S. Magesh, and R. Manikandan, Taylor based grey wolf optimization algorithm (TGWOA) for energy aware secure routing protocol, International Journal of Computer Networks and Applications (IJCNA), 7.4 (2020) 93-102. [25] R. Sahu, S. Sharma, and M. A. Rizvi, ZBLE: zone based leader election energy constrained AOMDV routing protocol, International Journal of Computer Networks and Applications, 6.3 (2019) 39-46. [26] F. Farokhi, I. Shames, and N. Batterham, Secure and private control using semi-homomorphic encryption, Control Engineering Practice, 67 (2017) 13-20. [27] Zh. Zhang, P. Cheng, J. Wu, and J. Chen, Secure state estimation using hybrid homomorphic encryption scheme, IEEE Transactions on Control Systems Technology, 29.4 (2020) 1704-1720. [28] T. Oliveira, J. López, H. Hışıl, A. Faz-Hernández, and F. Rodríguez-Henríquez, How to (pre-) compute a ladder, in: Proceedings of the International Conference on Selected Areas in
[29] H. Fujii, and D. F. Aranha, Curve25519 for the Cortex-M4 and beyond, in: Proceedings of the
Cham, 2017, pp. 109-127. [30] A. Faz-Hernández, J. López, and R. Dahab, High-performance implementation of elliptic curve cryptography using vector instructions, ACM Transactions on Mathematical Software (TOMS), 45.3 (2019) pp.1-35. [31] Ch.-H. Yang, Ch.-W. Chou, Ch.-Sh. Hsu, and Ch.-E. Chen, A systolic array based GTD processor with a parallel algorithm, IEEE Transactions on Circuits and Systems I: Regular papers, 62.4, (2015) 1099-1108. [32] Zh. Liu, X. Huang, Zh. Hu, M. K. Khan, H. Seo, and L. Zhou, On emerging family of elliptic curves to secure internet of things: ECC comes of age, IEEE Transactions on Dependable and Secure Computing, 14.3 (2016) 237-248. [33] M. Düll, B. Haase, G. Hinterwälder, M. Hutter, C. Paar, A. H. Sánchez, and P. Schwabe, Highspeed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers, Designs, Codes and Cryptography, 77.2 (2015) 493-514. [34] S.R. Moosavi, E. Nigussie, S. Virtanen, and J. Isoaho, Cryptographic key generation using ECG signal, in: Proceedings of the 14th IEEE Annual Consumer Communications & Networking Conference (CCNC), 2017, pp. 1024-1031. [35] F. Hendaoui, H. Eltaief, and H. Youssef, UAP: A unified authentication platform for IoT environment, Computer Networks, 188 (2021) 107811. [36] T. Ch. Priyadharshini, and D. M. Geetha, Efficient Key Management System Based Lightweight
[37] L. Wang, Zh. Li, M. Chen, A. Zhang, J.-W. Cui, and B. Zheng, Secure content sharing protocol for D2D users based on profile matching in social networks, in: Proceedings of the 9th International