Abstract
Encryption key safety is the Achilles’ heel of cryptography. Backup copies with the escrow offset the risk of key loss, but increase the danger of disclosure. We propose Recoverable Encryption (RE) schemes which alleviate the dilemma. The backup is encrypted so that the recovery is possible in practice only over a large cloud. A 10K-node cloud may recover a key in at most 10 minutes, with the 5 minutes average. Same attempt at the escrow’s site, a computer or perhaps a cluster, could require 70 days with the 35 days average. Large clouds are now affordable. Their illegal use is unlikely. We show feasibility of two schemes with their application potential.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abelson, H., Anderson, R., Bellovin, S.M., Benaloh, J., Blaze, M., Gilmore, J., Neumann, P.G., Rivest, R.L., Schneier, B.: The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption, http://www.crypto.com/papers/escrowrisks98.pdf
Abiteboul, S., Manolescu, I., Rigaux, P., Rousset, M.C., Senellart, P.: Web Data Management. Cambridge University Press (2011)
Blaze, M.: Oblivious Key Escrow. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 335–343. Springer, Heidelberg (1996)
Crypto++ 5.6.0 Benchmarks, http://www.cryptopp.com/benchmarks.html
Bellare, M., Goldwasser, S.: Verifiable partial key escrow. In: 4th ACM CCS Conf., pp. 78–91 (1997)
Chandrasekhar, S.: Construction of Efficient Authentication Schemes Using Trapdoor Hash Functions. Ph.D Dissertation. University of Kentucky (2011)
CloudLayer Hourly Pricing, http://www.softlayer.com/cloudlayer/computing/
Denning, D.E., Branstad, D.K.: A Taxonomy for key escrow encryption systems. Communications of the ACM 39(3) (1966)
Denning, D.E., Branstad, D.K.: A Taxonomy for Key Recovery Encryption Systems, http://faculty.nps.edu/dedennin/publications/TaxonomyKeyRecovery.htm
Lee, R.D.: Testimony of Ronald D. Lee, Attorney General.... (March 1999), http://www.cybercrime.gov/leesti.htm
Miller, E., Long, D., Freeman, W., Reed, B.: Strong security for distributed file systems. In: Proceedings of the Conference on File and Storage Technologies (FAST 2002), pp. 1–13 (January 2002)
Jajodia, S., Litwin, W., Schwarz, T.: LH*R E: A Scalable Distributed Data Structure with Recoverable Encryption. In: IEEE-CLOUD 2010 (2010)
Jajodia, S., Litwin, W., Schwarz, T.: Privacy of Data Outsourced to a Cloud for Selected Readers through Client-Side Encryption. In: CCS 2011 Workshop on Privacy in the Electronic Society (WPES 2011), Chicago (2011)
Jajodia, S., Litwin, W., Schwarz, T.: Recoverable Encryption Through Noised Secret. Electronic Res. Rep. (2011), http://www.lamsade.dauphine.fr/~litwin/Recoverable%20Encryption_10.pdf
Litwin, W., Neimat, M.-A., Schneider, D.: LH* - A Scalable Distributed Data Structure. ACM TODS 12 (1996)
Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical Report, Massachusetts Institute of Technology, MIT/LCS/TR-684 (1996)
Walker, S., Lipner, S., Ellison, C., Balenson, D.: Commercial key recovery. Communications of the ACM 39 (March 3, 1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jajodia, S., Litwin, W., Schwarz, T. (2012). Recoverable Encryption through Noised Secret over a Large Cloud. In: Hameurlain, A., Hussain, F.K., Morvan, F., Tjoa, A.M. (eds) Data Management in Cloud, Grid and P2P Systems. Globe 2012. Lecture Notes in Computer Science, vol 7450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32344-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-32344-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32343-0
Online ISBN: 978-3-642-32344-7
eBook Packages: Computer ScienceComputer Science (R0)