ABSTRACT
Digital forgetting deals with the unavailability of content uploaded to web and storage servers after the data has served its purpose. The content on the servers can be deleted manually, but this does not prevent data archival and access at different storage locations. This is problematic since then the data may be accessed for unintended or even malicious purposes long after the owners have decided to abandon the public availability of their data. Approaches which assign a lifetime value to data or use heuristics like interest in data to make it inaccessible after some time have been proposed, but digital forgetting is still in its infancy and there are a number of open problems with the proposed approaches.
In this paper, we outline a general use case of cryptographic puzzles in the context of digital forgetting which---to the best of our knowledge---has not been proposed or explored before. One problem with recent proposals for digital forgetting is that attackers could collect or even delete anyone's public data during their lifetime. In our approach, we deal with these problems by making it hard for the attacker to delete large quantities of data while making sure that the proposed solutions will not adversely deteriorate user experience in a disturbing manner. As a proof-of-concept, we propose a system with cryptographic (time-lock) puzzles that deals with malicious users while ensuring the permanent deletion of data when interest in it dies down. We have implemented a prototype and evaluate it thoroughly with promising results.
- Adam Back. 2002. Hashcash -- A Denial of Service Counter-Measure. (2002). http://www.hashcash.org/papers/hashcash.pdfGoogle Scholar
- Dan Boneh and Richard J. Lipton. {n. d.}. A Revocable Backup System. In Proceedings of the 6th USENIX Security Symposium, San Jose, CA, USA, July 22--25, 1996. Google ScholarDigital Library
- C. Castelluccia, E. De Cristofaro, A. Francillon, and M.-A. Kaafar. 2011. EphPub: Toward robust Ephemeral Publishing. In 19th IEEE International Conference on Network Protocols (ICNP). 165--175. Google ScholarDigital Library
- Domo. 2017. Data never sleeps 5.0. https://www.domo.com/learn/data-never-sleeps-5. (June. 2017). https://www.domo.com/learn/data-never-sleeps-5Google Scholar
- Sujata Doshi, Fabian Monrose, and Aviel D. Rubin. 2006. Efficient Memory Bound Puzzles Using Pattern Databases Proceedings of the 4th International Conference on Applied Cryptography and Network Security (ACNS). 98--113. Google ScholarDigital Library
- Roxana Geambasu, Tadayoshi Kohno, Arvind Krishnamurthy, Amit Levy, Henry Levy, Paul Gardner, and Vinnie Moscaritolo. 2011. New Directions for Self-Destructing Data Systems. Technical Report UW-CSE-11-08-01. University of Washington.Google Scholar
- Roxana Geambasu, Tadayoshi Kohno, Amit A. Levy, and Henry M. Levy. 2009. Vanish: Increasing Data Privacy with Self-destructing Data Proceedings of the 18th Conference on USENIX Security Symposium. USENIX Association, Berkeley, CA, USA, 299--316. Google ScholarDigital Library
- Peter Gutmann. 1996. Secure deletion of data from magnetic and solid-state memory Proceedings of the 6th USENIX Security Symposium, Focusing on Applications of Cryptography. USENIX Association, Berkeley, CA, USA, 77--90. Google ScholarDigital Library
- Owen Harrison and John Waldron. 2009. Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware Proceedings of the 2Nd International Conference on Cryptology in Africa: Progress in Cryptology (AFRICACRYPT '09). Springer-Verlag, Berlin, Heidelberg, 350--367. Google ScholarDigital Library
- Ari Juels and John G. Brainard. 1999. Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks Proceedings of the Network and Distributed System Security Symposium, NDSS.Google Scholar
- Ghassan Karame and Srdjan Capkun. 2010. Low-Cost Client Puzzles Based on Modular Exponentiation Proceedings of the 15th European Symposium on Research in Computer Security (ESORICS). 679--697. Google ScholarDigital Library
- Jaeheung Lee, Sangho Yi, Junyoung Heo, Hyungbae Park, Sung Y. Shin, and Yookun Cho. 2010. An Efficient Secure Deletion Scheme for Flash File Systems. Journal of Information Science and Engineering, Vol. 26, 1 (2010), 27--38. http://www.iis.sinica.edu.tw/page/jise/2010/201001_03.htmlGoogle Scholar
- Frank Li, Prateek Mittal, Matthew Caesar, and Nikita Borisov. 2012. SybilControl: Practical Sybil Defense with Computational Puzzles Proceedings of the Seventh ACM Workshop on Scalable Trusted Computing (STC'12). 67--78. Google ScholarDigital Library
- Pär Persson Mattsson. 2013. Why Haven't CPU Clock Speeds Increased in the Last Few Years? (Nov. 2013). https://www.comsol.com/blogs/havent-cpu-clock-speeds-increased-last-years/Google Scholar
- Viktor Mayer-Schönberger. 2011. Delete: The Virtue of Forgetting in the Digital Age. Princeton University Press, Princeton, NJ, USA. Google ScholarCross Ref
- Mainack Mondal, Johnnatan Messias, Saptarshi Ghosh, Krishna P. Gummadi, and Aniket Kate. 2016. Forgetting in Social Media: Understanding and Controlling Longitudinal Exposure of Socially Shared Data. In Twelfth Symposium on Usable Privacy and Security, SOUPS 2016, Denver, CO, USA, June 22-24, 2016. 287--299.Google Scholar
- Joel Reardon, David A. Basin, and Srdjan Capkun. 2013. SoK: Secure Data Deletion. In IEEE Symposium on Security and Privacy (SP), Berkeley, CA, USA. 301--315. Google ScholarDigital Library
- Joel Reardon, Srdjan Capkun, and David A. Basin. 2012. Data Node Encrypted File System: Efficient Secure Deletion for Flash Memory Proceedings of the 21th USENIX Security Symposium. 333--348. Google ScholarDigital Library
- Sirke Reimann and Markus Dürmuth. 2012. Timed revocation of user data: long expiration times from existing infrastructure WPES. 65--74. Google ScholarDigital Library
- Ronald. L. Rivest, Adi Shamir, and David A. Wagner. 1996. Time-lock Puzzles and Timed-release Crypto. Technical Report. Cambridge, MA, USA. Google ScholarDigital Library
- Esther Shein. 2013. Ephemeral Data. Commun. ACM Vol. 56, 9 (Sept. . 2013), 20--22. Google ScholarDigital Library
Index Terms
- Forgetting with Puzzles: Using Cryptographic Puzzles to support Digital Forgetting
Recommendations
Time-Lock Puzzles from Randomized Encodings
ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer ScienceTime-lock puzzles are a mechanism for sending messages "to the future". A sender can quickly generate a puzzle with a solution s that remains hidden until a moderately large amount of time t has elapsed. The solution s should be hidden from any ...
Efficient modular exponentiation-based puzzles for denial-of-service protection
ICISC'11: Proceedings of the 14th international conference on Information Security and CryptologyClient puzzles are moderately-hard cryptographic problems -- neither easy nor impossible to solve -- that can be used as a countermeasure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as ...
Toward non-parallelizable client puzzles
CANS'07: Proceedings of the 6th international conference on Cryptology and network securityClient puzzles have been proposed as a useful mechanism for mitigating denial of service attacks on network protocols. Several different puzzles have been proposed in recent years. This paper reviews the desirable properties of client puzzles, pointing ...
Comments