A taxonomy for key escrow encryption systems
Communications of the ACM
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Proceedings of the 4th ACM conference on Computer and communications security
The risks of key recovery, key escrow, and trusted third-party encryption
World Wide Web Journal - Special issue: Web security: a matter of trust
Communications of the ACM
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
Binding ElGamal: a fraud-detectable alternative to key-escrow proposals
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
LH*RE: A Scalable Distributed Data Structure with Recoverable Encryption
CLOUD '10 Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing
Clasas: A Key-Store for the Cloud
MASCOTS '10 Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Strong security for network-attached storage
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Privacy of data outsourced to a cloud for selected readers through client-side encryption
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Key escrow from a safe distance: looking back at the Clipper Chip
Proceedings of the 27th Annual Computer Security Applications Conference
GPU-based single-cluster algorithm for the simulation of the Ising model
Journal of Computational Physics
Web Data Management
Partial key exposure attacks on RSA up to full size exponents
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Practical client puzzles in the standard model
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Hi-index | 0.00 |
The safety of keys is the Achilles' heel of cryptography. A key backup at an escrow service lowers the risk of loosing the key, but increases the danger of key disclosure. We propose Recoverable Encryption (RE) schemes that alleviate the dilemma. RE encrypts a backup of the key in a manner that restricts practical recovery by an escrow service to one using a large cloud. For example, a cloud with ten thousand nodes could recover a key in at most 10 minutes with an average recovery time of five minutes. A recovery attempt at the escrow agency, using a small cluster, would require seventy days with an average of thirty five days. Large clouds have become available even to private persons, but their pay-for-use structure makes their use for illegal purposes too dangerous. We show the feaibility of two RE schemes and give conditions for their deployment.