Generalised cheater detection and identification

Harn, Lein

doi:10.1049/iet-ifs.2012.0381

Cited by 5 publications

(4 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The benefits of multiparty computing and function sharing have been investigated [ 23 , 24 ]. The techniques may identify harmful users’ cheating behavior during secret reconstruction, so an honest user cannot be misled.…”

Section: Related Workmentioning

confidence: 99%

Centralized Threshold Key Generation Protocol Based on Shamir Secret Sharing and HMAC Authentication

Hakeem

Kim

2022

Sensors

View full text Add to dashboard Cite

Many group key management protocols have been proposed to manage key generation and distribution of vehicular communication. However, most of them suffer from high communication and computation costs due to the complex elliptic curve and bilinear pairing cryptography. Many shared secret protocols have been proposed using polynomial evaluation and interpolation to solve the previous complexity issues. This paper proposes an efficient centralized threshold shared secret protocol based on the Shamir secret sharing technique and supporting key authentication using Hashed Message Authentication Code Protocol (HMAC). The proposed protocol allows the group manager to generate a master secret key for a group of n vehicles and split this key into secret shares; each share is distributed securely to every group member. t-of-n vehicles must recombine their secret shares and recover the original secret key. The acceptance of the recovered key is based on the correctness of the received HMAC signature to verify the group manager’s identity and ensure the key confidentiality. The proposed protocol is unconditionally secure and unbreakable using infinite computing power as t, or more than t secret shares are required to reconstruct the key. In contrast, attackers with t−1 secret shares cannot leak any information about the original secret key. Moreover, the proposed protocol reduces the computation cost due to using polynomial evaluation to generate the secret key and interpolation to recover the secret key, which is very simple and lightweight compared with the discrete logarithm computation cost in previous protocols. In addition, utilizing a trusted group manager that broadcasts some public information is important for the registered vehicles to reconstruct the key and eliminate secure channels between vehicles. The proposed protocol reduces the communication cost in terms of transmitted messages between vehicles from 2(t−1) messages in previous shared secret protocols to zero messages. Moreover, it reduces the received messages at vehicles from 2t to two messages. At the same time, it allows vehicles to store only a single secret share compared with other shared secret protocols that require storage of t secret shares. The proposed protocol security level outperforms the other shared secret protocols security, as it supports key authentication and confidentiality using HMAC that prevents attackers from compromising or faking the key.

show abstract

Section: Related Workmentioning

confidence: 99%

Centralized Threshold Key Generation Protocol Based on Shamir Secret Sharing and HMAC Authentication

Hakeem

Kim

2022

Sensors

View full text Add to dashboard Cite

show abstract

“…Other solutions for the detection of data leaks comprise of network‐based data leak detection solution [19, 20 ], secret sharing‐based cheater detection and identification [21 ], and classification technique [22 ]. To ensure when the confidential data is being leaked, a network‐wide technique based on black‐box differencing is proposed by Croft and Caesar in [20 ], which controlled and restricted the secret data flow within a network.…”

Section: Introductionmentioning

confidence: 99%

GUIM‐SMD: guilty user identification model using summation matrix‐based distribution

Gupta

Singh

2020

IET Inf. secur

View full text Add to dashboard Cite

“…Apart from cheating detection, there are schemes that identify cheaters in [15][16][17][18][19][20]. These schemes provide the method of identifying any forged share once it has been detected that cheating takes place.…”

Section: Introductionmentioning

confidence: 99%

Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials

Phiri

Kim

2019

Security and Communication Networks

View full text Add to dashboard Cite

Threshold secret sharing is concerned with the splitting of a secret into shares and distributing them to some persons without revealing its information. Any ≤ persons possessing the shares have the ability to reconstruct the secret, but any persons less than cannot do the reconstruction. Linear secret sharing scheme is an important branch of secret sharing. The purpose of this paper is to propose a new polynomial based linear ( , ) secret sharing scheme, which is based on Shamir's secret sharing scheme and ElGamal cryptosystem. Firstly, we withdraw some required properties of secret sharing scheme after reviewing the related schemes and ElGamal cryptosystem. The designed scheme provides the properties of security for the secret, recoverability of the secret, privacy of the secret, and cheating detection of the forged shares. It has half computation overhead than the previous linear scheme.

show abstract

Generalised cheater detection and identification

Cited by 5 publications

References 29 publications

Centralized Threshold Key Generation Protocol Based on Shamir Secret Sharing and HMAC Authentication

Centralized Threshold Key Generation Protocol Based on Shamir Secret Sharing and HMAC Authentication

GUIM‐SMD: guilty user identification model using summation matrix‐based distribution

Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials

Contact Info

Product

Resources

About