General Data Protection Regulation (GDPR)
General Provisions
Chapter 10

REFERENCES

  • ENISA, “Recommendations on shaping technology according to GDPR provisions - An overview on data pseudonymisation”, 2018.
  • ENISA, “Privacy and data protection by design - from policy to engineering,” 2014.
  • L. Sweeney, “K-anonymity: A model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.
  • A. Pfitzmann and M. Hansen, “A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management,” 2010.
  • M. Barbaro, T. Zeller and S. Hansell, A face is exposed for aol searcher no. 4417749, vol. 9, New York Times, 2006, p. 8.
  • M. Hellman, “A cryptanalytic time-memory trade-off,” IEEE transactions on Information Theory, vol. 26, no. 4, pp. 401-406, 1980.
  • P. Oechslin, “Making a Faster Cryptanalytic Time-Memory Trade-off,” in CRYPTO 2003, 2003.
  • J. L. Massey, “Guessing and entropy,” in Proceedings of 1994 IEEE International Symposium on Information Theory, 1994.
  • Y. Yona and S. Diggavi, “The effect of bias on the guesswork of hash functions,” in 2017 IEEE International Symposium on Information Theory (ISIT), 2017.
  • D. G. Malone and W. Sullivan, “Guesswork and entropy,” IEEE Transactions on Information Theory, vol. 50, no. 3, pp. 525--526, 2004.
  • H. C. Van Tilborg and S. Jajodia, Encyclopedia of cryptography and security, Springer Science & Business Media, 2014.
  • J. Katz, A. J. Menezes, P. C. Van Oorschot and S. A. Vanstone, Handbook of applied cryptography, CRC press, 1996.
  • M. J. Dworkin, “SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions,” 2015.
  • T. Eastlake and D. Hansen, “US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF),” 2011.
  • M. Bellare, R. Canetti and H. Krawczyk, “Keying hash functions for message authentication,” in Annual international cryptology conference, 1996.
  • H. Krawczyk, R. Canetti and M. Bellare, “HMAC: Keyed-Hashing for Message Authentication,” RFC, pp. 1-11, 1997.
  • R. C. Merkle, “A Digital Signature Based on a Conventional Encryption Function,” Advances in Cryptology — CRYPTO '87, pp. 369-378, 1988.
  • G. Becker, “Merkle Signature Schemes, Merkle Trees and Their Cryptanalysis,” Bochum, 2008.
  • L. Lamport, “Password authentication with insecure communication,” Communications of the ACM, pp. 770-772, November 1981.
  • B. H. Bloom, “Space/time trade-offs in hash coding with allowable errors,” Communications of the ACM, pp. 422-426, July 1970.
  • S. Weber, “On Transaction Pseudonyms with Implicit Attributes,” Cryptology ePrint Archive: Report 2012/568, https://eprint.iacr.org/2012/568 , 2012.
  • A. Machanavajjhala, J. Gehrke, D. Kifer and M. Venkitasubramaniam, “L-diversity: Privacy beyond k-anonymity,” in 22nd International Conference on Data Engineering (ICDE'06), 2006.
  • N. Li, T. Li and S. Venkatasubramanian, “t-closeness: Privacy beyond k-anonymity and ldiversity,” in 23rd International Conference on Data Engineering, 2007.
  • C. Dwork and A. Roth, “The Algorithmic Foundations of Differential Privacy,” Foundations and Trends in Theoretical Computer Science, pp. 211-407, August 2014.
  • L. Sweeney, “Only You, Your Doctor, and Many Others May Know,” Technology Science, vol. 2015092903, no. 9, p. 29, 2015.
  • H. W and F. Wang, “A Survey of Noninteractive Zero Knowledge Proof System and Its Applications,” The Scientific World Journal, 2014.
  • IETF, “Internet Engineering Task Force: RFC 791, Internet Protocol DARPA Internet Program Protocol Specification,” 1981.
  • IETF, “Internet Engineering Task Force: RFC8200, Internet Protocol, Version 6 (IPv6) Specification,” STD 86, 2017.
  • IETF, “Internet Engineering Task Force: RFC4632, Classless Inter-domain Routing (CIDR): The Internet Address Assignment and Aggregation Plan,” BCP 122, 2006.
  • IETF, “Internet Engineering Task Force: RFC 5735, Special Use IPv4 Addresses,” 2010.
  • WP29, “Article 29 Data Protection Working Party: Opinion 4/2007 on the concept of personal data,” 2007.
  • IETF, “Internet Engineering Task Force: IPFIX Working Group, IP Flow Anonymization Support,” 2011.
  • “An Analysis of Google Logs Retention Policies,” Journal of Privacy and Confidentiality, vol. 3, no. 1, 2011.
  • L. Demir, A. Kumar, M. Cunche and C. Lauradoux, “The pitfalls of hashing for privacy,” IEEE Communications Surveys & Tutorials, pp. 551-565, 2017.
  • S. Englehardt, J. Han and A. Narayanan, “I never signed up for this! privacy implications of email tracking,” in Proceedings on Privacy Enhancing Technologies, 2018.
  • Digital Summit ’s Data Protection Focus Group, “White Paper on Pseudonymization,” 2017.
  • R. Noumeir, A. Lemay and J.-M. Lina, “Pseudonymization of radiology data for research purposes.,” Journal of digital imaging, vol. 20, no. 3, pp. 284-295, 2007.
  • I. Polakis, G. Kontaxis, S. Antonatos, E. Gessiou, T. Petsas and E. P. Markatos, “Using social networks to harvest email addresses,” in Proceedings of the 9th Annual ACM Workshop on Privacy in the Electronic Society, 2010.