Defensive strategies against PCC attacks based on ideal (t,n)-secret sharing scheme

Abstract

We present a method to increase the dependability of cloud-based applications. Traditional Secret Sharing Schemes (SSSs) typically fail to counter the challenges brought on by Private Channel Cracking (PCC) and Illegal Participant (IP) attacks. To prevent these attacks, we suggest a closely-coupled (t,m,n) secret sharing method that combines m(m⩾t) shareholders. A polynomial-based (t,m,n)-ITSS scheme is presented, which uses a k-round Random Number Selection (RNS) process to strengthen resistance to PCC assaults. A common method to convert a perfect (t,n)-SS into a (t,m,n)-ITSS is explained, which greatly enhances the defense against PCC attacks and illegal participation. The presented strategy can enhance the dependability of cloud-based applications.

Keywords

• Tightly coupled
• k-round random number selection
• Randomized component
• Secret sharing
• Private channel cracking
• Illegal participant