Publicly Verifiable Secret Sharing for Cloud-Based Key Management
Running the key-management service of cryptographic systems in the cloud is an attractive cost saving proposition. Supporting key-recovery is an essential component of every key-management service. We observe that to verifiably support key-recovery in a public cloud, it is essential to use publicly verifiable secret-sharing (PVSS) schemes. In addition, a holistic approach to security must be taken by requiring that running the key-management service in the (untrusted) cloud does not violate the security of the cryptographic system at hand.
This paper takes such a holistic approach for the case of public-key encryption which is one of the most basic cryptographic tasks. The approach boils down to formalizing the security of public-key encryption in the presence of PVSS. We present such a formalization and observe that the PVSS scheme of Stadler  can be shown to satisfy our definition, albeit in the Random Oracle Model.
We construct a new scheme based on pairings which is much more efficient than Stadler’s scheme. Our scheme is noninteractive and can support any monotone access structure. In addition, it is proven secure in the standard model under the Bilinear Diffie-Hellman (BDH) assumption. Interestingly, our PVSS scheme is actually the first non-interactive scheme proven secure in the standard model; all previous non-interactive PVSS schemes assume the existence of a Random Oracle. Our scheme is simple and efficient; an implementation of our scheme demonstrates that our scheme compares well with the current fastest known PVSS schemes.
KeywordsLeaf Node Encryption Scheme Secret Sharing Access Structure Random Oracle
Unable to display preview. Download preview PDF.
- 2.Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Israel Institute of Technology, Technion, Haifa, Israel (June 1996)Google Scholar
- 3.Bellare, M., Goldwasser, S.: Verifiable partial key escrow. In: ACM Conference on Computer and Communications Security, pp. 78–91 (1997)Google Scholar
- 4.Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62–73 (1993)Google Scholar
- 5.Blakley Jr., G.R.: Safeguarding cryptographic keys. In: AFIPS 1979, National Computer Conference, vol. 48, pp. 313–317 (1979)Google Scholar
- 8.Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586–615 (2003); Ealier version in Google Scholar
- 9.Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science (FOCS), pp. 383–395. IEEE (1985)Google Scholar
- 10.Creeger, M.: Cloud computing: An overview. Queue 7, 2:3–2:4 (2009)Google Scholar
- 11.Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (FOCS), pp. 427–437. IEEE (1987)Google Scholar
- 14.Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM Conference on Computer and Communications Security, pp. 89–98. ACM (2006)Google Scholar
- 17.Klien, M.: Six Benefits of Cloud Computing (2010), http://resource.onlinetech.com/the-six-benefits-of-cloud-computing/
- 18.Martin, L.: Federated Key Management for Secure Cloud Computing. Presentation by Voltage Security, Inc. (May 2010), http://storageconference.org/2010/Presentations/KMS/17.Martin.pdf
- 20.Micali, S., Shamir, A.: Partial key-escrow (1996) (manuscript)Google Scholar
- 21.Escrowed encryption standard (EES). FIPS PUB 185, National Institute of Standards and Technology (February 1994)Google Scholar
- 22.National Institute of Standards and Technology. NIST Special Publication 800-57: Recommendation for Key Management — Part 1: General (revised) (2007)Google Scholar
- 23.Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)Google Scholar
- 26.Scott, M.: MIRACL—A Multiprecision Integer and Rational Arithmetic C/C++ Library. Shamus Software Ltd, Dublin, Ireland (2010), http://www.shamus.ie/
- 28.Shoup, V.: Encryption algorithms—part 2: Asymmetric ciphers. Final Committee Draft 18033-2, ISO/IEC (December 2004), http://www.shoup.net/iso/std6.pdf