Abstract
Current concerns about data privacy have lead to increased focus on data anonymization methods. Differential privacy is a new mechanism that offers formal guarantees about anonymization strength. The main challenge when using differential privacy consists in the difficulty in designing correct algorithms when operating on complex data types. One such data type is sequential data, which is used to model many actions like location or browsing history. We propose a new differential privacy algorithm for short sequence counting called Recursive Budget Allocation (RBA). We show that RBA leads to lower relative errors than current state of the art techniques. In addition, it can also be used to improve relative errors for generic differential privacy algorithms which operate on data trees.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
