Cryptography, Security and Privacy (CrySP) • Double Talk — Anonymization with Differential Privacy / Secure Data Structures with Intel SGXExport this event to calendar

Monday, October 22, 2018 — 2:00 PM EDT

Anonymization with Differential Privacy • Ben Weggenmann
SAP Security Research

Huge amounts of textual data are processed every day using text mining and information retrieval techniques to assist us with analyzing, organizing and retrieving text documents. In many cases, it is desirable that the authors of such documents remain anonymous: They can reveal sensitive information about its authors, and critical news articles or customer feedback could cause retaliation or worsening business relations. However, simply removing personally identifying information from a document is insufficient, since so-called authorship attribution methods can reidentify the author just from the writing style.
 
In this talk, Ben will discuss the importance of privacy for textual data and present SynTF (published at SIGIR’18), the first text anonymization method based on differential privacy. SynTF protects the identities of the authors while preserving semantics to allow e.g. privacy-friendly topic inference tasks. Differential privacy is a statistical notion of privacy that won the 2017 Gödel prize and works by injecting randomness in the resulting data and thus providing plausible deniability for the authors.
 
BioBen Weggenmann is a researcher and Ph.D. candidate at SAP Security Research. His research interests cover computer security and data anonymization with a focus on differential privacy. He has previously worked in the industry on cryptography and embedded security and holds a Diplom degree in computer science from Ulm University and a B.Sc. (Hons.) in mathematics from Monash University.

Secure Data Structures with Intel SGX • Benny Fuhry
SAP Security Research

In this talk, Benny Fuhry will mainly present HardIDX, a provably secure database index concept that won a best paper award. It is a hardware-based approach, leveraging Intel's SGX, for search over encrypted data. Only the security critical core, i.e., the search functionality, is implemented in the trusted environment and it resorts to untrusted software for the remainder. HardIDX is logarithmic in the size of the index and searches are performed within a few milliseconds. The implementation has a very small code and memory footprint yet still scales to virtually unlimited search index sizes, i.e., size is limited only by the general — non-secure — hardware resources. He will also talk about other current research projects concerning further secure and fast data structures and database primitives.
 
Bio: Benny Fuhry is a permanent researcher and Ph.D. candidate at SAP's Security Research division. He holds a bachelor’s and master’s degree from the Karlsruhe Institute of Technology (KIT), Germany. His main contribution to research were an approach to encrypt analytical web applications and a best paper winning concept for a provably secure database index that uses Intel SGX. He currently researches further data structures and database primitives that are secure and fast to enable secure big data analysis in the cloud. Furthermore, he was SAP's leader for the EU research project TREDISEC (Trust-aware, REliable and Distributed Information SEcurity in the Cloud).
Location 
DC - William G. Davis Computer Research Centre
1304
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  1. 2019 (214)
    1. December (1)
    2. November (4)
    3. October (16)
    4. September (20)
    5. August (18)
    6. July (12)
    7. June (23)
    8. May (23)
    9. April (32)
    10. March (25)
    11. February (16)
    12. January (24)
  2. 2018 (220)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (22)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)