Provided by: University of North Carolina at Charlotte
Date Added: May 2013
In this paper, the authors consider the problem of secret sharing where shares are encrypted using a Public-Key Encryption (PKE) scheme and cipher-texts are publicly available. While intuition tells the user that the secret should be protected if the PKE is secure against Chosen-Cipher-text Attacks (i.e., CCA-secure), formally proving this reveals some subtle and non-trivial challenges. They isolate the problems that this raises, and devise a new analysis technique called \"Plaintext randomization\" that can successfully overcome these challenges, resulting in the desired proof.