Practical public key encryption with selective opening security for receivers

Huang, Zhengan; Lai, Junzuo; Chen, Wenbin; Raees-ul-Haq, Muhammad; Jiang, Liaoliang

doi:10.1016/j.ins.2018.10.055

Cited by 9 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other available MAC schemes are Cipher Block Chaining MAC (CBC-MAC) and MAC based on universal hashing (UMAC). MACs can be created either using symmetric key-based approaches [35] or public keybased approaches [36]. Among various symmetric key-based approaches, the secret key polynomial based message authentication scheme is considered the most effective one.…”

Section: Message Authentication Code a Message Authenticationmentioning

confidence: 99%

See 1 more Smart Citation

Rank-Based Report Filtering Scheme (RRFS) for Verifying Phoney Reports in Wireless Sensor Networks

Santhosh

Yogesh

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are open to false data injection attack when they are deployed in hostile scenarios. Attackers can easily deceive the sink by compromising sensing nodes or by injecting phoney data into the network. Such attacks can deplete the energy resources of the network by providing wrong information which in turn can affect the proper network functioning or sometimes can shut the network from further functioning. The existing schemes that deal with this problem focus on only a few aspects of the false data injection attack. To resolve this problem, we propose a Rank-based Report Filtering Scheme (RRFS), a holistic and group verification scheme for the identification of compromised nodes and the filtering of false data injected into the network. The proposed scheme verifies report among clusters, en-routers, and sink. Hence, the RRFS, a holistic scheme that is composed of three-tier verifications, successfully rejects the false data before the attackers falsify the whole environment, and this makes the system unique. Reliability Index (RI) is calculated by the nodes for fellow cluster members, and the cluster head (CH) provides the score for a node based on its RI. This, in turn, strengthens the scheme by assisting the en-routers to detect the compromised nodes. The RRFS scheme has been verified and validated by extensive simulation and meticulous performance evaluation of filtering efficiency and energy consumption against various schemes. The scheme gives high filtering efficiency against the multiple compromised nodes and also improves the network’s lifespan. The sustainability of RRFS against numerous attacks that are launched in the sensor environment is thoroughly investigated.

show abstract

Section: Message Authentication Code a Message Authenticationmentioning

confidence: 99%

“…RRFS calculates a new session key for every session. The computational cost is calculated based on equation (36).…”

Section: Performance Evaluationmentioning

confidence: 99%

Rank-Based Report Filtering Scheme (RRFS) for Verifying Phoney Reports in Wireless Sensor Networks

Santhosh

Yogesh

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…So, it is a research focus of cryptography to develop other new cryptosystems. e traditional cryptosystems are based on various commutative rings, such as finite field, residue class ring, and integer ring [4][5][6][7][8]. Many cryptologists hope to find other algebraic structures to build new public key cryptosystems.…”

Section: Introductionmentioning

confidence: 99%

Tropical Cryptography Based on Multiple Exponentiation Problem of Matrices

Huang

2022

Security and Communication Networks

View full text Add to dashboard Cite

Because there is no multiplication of numbers in tropical algebra and the problem of solving the systems of polynomial equations in tropical algebra is NP-hard, in recent years some public key cryptography based on tropical semiring has been proposed. But most of them have some defects. This paper proposes new public key cryptosystems based on tropical matrices. The security of the cryptosystem relies on the difficulty of the problem of finding multiple exponentiations of tropical matrices given the product of the matrices powers when the subsemiring is hidden. This problem is a generalization of the discrete logarithm problem. But the problem generally cannot be reduced to discrete logarithm problem or hidden subgroup problem in polynomial time. Since the generating matrix of the used commutative subsemirings is hidden and the public key matrices are the product of more than two unknown matrices, the cryptosystems can resist KU attack and other known attacks. The cryptosystems based on multiple exponentiation problem can be considered as a potential postquantum cryptosystem.

show abstract