Computational Secret Sharing

Abstract

In today’s world everything is stored online. As the world moves towards cloud computing and distributed computing there is a great need for security. The data stored on cloud servers are of two kinds; Sensitive data and comparatively less sensitive data. Compromise on the security of any kind of data isn’t acceptable, especially in the case of sensitive information.Existing cloud system relies on Public Key Infrastructure to secure information, where there are risks around the possible existence of back-doors, front-doors, and a general lack of true understanding of encryption methods.Traditional methods for encryption are ill-suited for simultaneously achieving high levels of confidentiality and reliability. Secret Sharing (also called secret splitting) refers to methods for distributing a secret amongst a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number, of possibly different types, of shares are combined together; individual shares are of no use on their own. Computational Secret Sharing (CSS) is a scheme of one dealer and n players. The dealer gives a share of the secret to the players, but only when specific conditions are fulfilled will the players be able to reconstruct the secret from their shares.