Audio Secret Sharing (ASS) schemes are devised to ensure the secrecy of audio data within a group of participants. Secret audio data are encoded into ‘audio shares’ with which only qualified sets of shares can reconstruct the secret audio. As audio files are generally large in size the construction of shares and reconstruction of the secret is normally a time consuming process with traditional ASS schemes. We propose a (n,n) ASS scheme based on Chen and Wu (2014) SIS scheme. This applies mostly XOR operations in entire secret sharing and reconstruction process. Hence computationally more efficient than existing ASS techniques. At the same time the size of the shares are 1/n (n = number of shares) of the secret audio data which are easy to store and transport.