securing history privacy and accountability in database
play

Securing History: Privacy and Accountability in Database Systems - PowerPoint PPT Presentation

Securing History: Privacy and Accountability in Database Systems Gerome Miklau (Joint work with Brian Levine & Patrick Stahlberg) University of Massachusetts, Amherst History a record of past data and operations performed on a system.


  1. Securing History: Privacy and Accountability in Database Systems Gerome Miklau (Joint work with Brian Levine & Patrick Stahlberg) University of Massachusetts, Amherst

  2. History a record of past data and operations performed on a system. Gerome Miklau UMass Amherst ✦

  3. History a record of past data and operations performed on a system. •Arguments for preserving history • Protection against loss • History is useful: accountability • Storage is cheap Gerome Miklau UMass Amherst ✦

  4. History a record of past data and operations performed on a system. •Arguments for preserving history • Protection against loss • History is useful: accountability • Storage is cheap • Arguments against preserving history • Threats to privacy and confidentiality • Deletion required for compliance with regulation • Increasingly, data destruction has real value! Gerome Miklau UMass Amherst ✦

  5. Vision: securing history •Balance privacy and accountability • Central issue: how and when historical data is retained in systems, who can recover and analyze it. •For privacy • “memory-less” systems and applications •For accountability • preserve needed history efficiently, permit analysis, protect Gerome Miklau UMass Amherst ✦

  6. Plan for securing history in a DBMS Step 1 Forensic analysis of database systems Step 2 Build transparency into database systems Step 3 Build accountability into database systems Gerome Miklau UMass Amherst ✦

  7. Securing history in a DBMS Step 1 Forensic analysis of database systems Step 2 Build transparency into database systems Step 3 Build accountability into database systems Gerome Miklau UMass Amherst ✦

  8. Computer forensics •Analysis of system state to validate hypotheses about past activities. •Threat model • Investigator has uncontrolled access to disk • Same capabilities as privileged insider or hacker •What does the disk image of DBMS reveal about history? • How much expired data is retained? • How long does it persist? Gerome Miklau UMass Amherst ✦

  9. Slack data •File system slack allocated file allocated file •Database slack Gerome Miklau UMass Amherst ✦

  10. Slack data •File system slack allocated file expired data allocated file •Database slack Gerome Miklau UMass Amherst ✦

  11. Slack data •File system slack allocated file expired data allocated file •Database slack Gerome Miklau UMass Amherst ✦

  12. Slack data •File system slack allocated file expired data allocated file •Database slack Gerome Miklau UMass Amherst ✦

  13. Forensic analysis of DBMS Gerome Miklau UMass Amherst ✦

  14. Forensic analysis of DBMS • Table storage • deletion is insecure (MySQL, Postgres, DB2, SQLite) • database and file system slack data generated in proportion to • workload, vacuum, clustering. Gerome Miklau UMass Amherst ✦

  15. Forensic analysis of DBMS • Table storage • deletion is insecure (MySQL, Postgres, DB2, SQLite) • database and file system slack data generated in proportion to • workload, vacuum, clustering. • Transaction log • no bounds on retention Gerome Miklau UMass Amherst ✦

  16. Forensic analysis of DBMS • Table storage • deletion is insecure (MySQL, Postgres, DB2, SQLite) • database and file system slack data generated in proportion to • workload, vacuum, clustering. • Transaction log • no bounds on retention • Temporary relations remain as file system slack. Gerome Miklau UMass Amherst ✦

  17. Forensic analysis of DBMS • Table storage • deletion is insecure (MySQL, Postgres, DB2, SQLite) • database and file system slack data generated in proportion to • workload, vacuum, clustering. • Transaction log • no bounds on retention • Temporary relations remain as file system slack. • Indexes may reveal history of operations. Gerome Miklau UMass Amherst ✦

  18. Securing history in a DBMS Step 1 Forensic analysis of database systems Step 2 Build transparency into database systems Step 3 Build accountability into database systems Gerome Miklau UMass Amherst ✦

  19. Transparent systems Interfaces must reliably represent system internals. Complete deletion • Deleted data must be destroyed, including copies and derived versions. Purposeful retention • Data retained after deletion must have a legitimate purpose, and data should be removed once that purpose is no longer valid. Bounded lifetime • The system should provide users with clear, accurate bounds on the persistence of data in the system. Gerome Miklau UMass Amherst ✦

  20. Secure deletion in DBMS Gerome Miklau UMass Amherst ✦

  21. Secure deletion in DBMS •Two basic strategies for secure deletion: • overwrite data with zeroes • store data in encrypted form, delete by disposing of keys. Gerome Miklau UMass Amherst ✦

  22. Secure deletion in DBMS •Two basic strategies for secure deletion: • overwrite data with zeroes • store data in encrypted form, delete by disposing of keys. •For table storage: • pages are read and written often • prefer secure deletion and vacuum using overwriting Gerome Miklau UMass Amherst ✦

  23. Secure deletion in DBMS •Two basic strategies for secure deletion: • overwrite data with zeroes • store data in encrypted form, delete by disposing of keys. •For table storage: • pages are read and written often • prefer secure deletion and vacuum using overwriting •For transaction log: • sequential writes, easily identifiable point of expiry • use encryption with key disposal Gerome Miklau UMass Amherst ✦

  24. Securing history in a DBMS Step 1 Forensic analysis of database systems Step 2 Build transparency into database systems Step 3 Build accountability into database systems Gerome Miklau UMass Amherst ✦

  25. Accountability Who did what to the database, and when? •Goals • Collection, Analysis, Protection • “Security provenance” •Existing capabilities • Logs and backups • Persistence in databases • Postgres, temporal DBs, transaction-time DBs Gerome Miklau UMass Amherst ✦

  26. Accountability challenges •Integrating and querying historical data •Accounting for “reads” •Protecting history • Access control model for persistent databases • Redaction and expunction operations Gerome Miklau UMass Amherst ✦

  27. Conclusion •History should be a “first-class” part of a DBMS •The safe, accurate configuration of the system’s historical memory allows needed balance between privacy and accountability. •Transparency requirements: • Interface should faithfully represent stored contents. •Accountability techniques: • Collection, integration, protection Gerome Miklau UMass Amherst ✦

  28. Questions?

  29. Does encryption solve forensic threats? •Encrypted file system: • protects historical remnants -- does not destroy data. • performance penalty, key manangement • in some settings, users/stakeholders cannot choose whether system provides encryption. •Overall, • Encryption has an important role to play, but must be used judiciously. • Encryption for protection, destruction should be distinguished. Gerome Miklau UMass Amherst ✦

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend