2,219 Hits in 5.4 sec

On anonymizing query logs via token-based hashing

Ravi Kumar, Jasmine Novak, Bo Pang, Andrew Tomkins
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
In this paper we study the privacy preservation properties of a specific technique for query log anonymization: tokenbased hashing.  ...  In this approach, each query is tokenized, and then a secure hash function is applied to each token. We show that statistical techniques may be applied to partially compromise the anonymization.  ...  We then process the anonymized log to invert the hash function based on co-occurrences of tokens within searches; interestingly, inverting cannot be done using just the token frequencies.  ... 
doi:10.1145/1242572.1242657 dblp:conf/www/KumarNPT07 fatcat:4qfaggyu3zc3jd5qurzfwpcqqy

Striking the Balance: Effective yet Privacy Friendly Contact Tracing [article]

Giuseppe Garofalo, Tim Van hamme, Davy Preuveneers, Wouter Joosen, Aysajan Abidin, Mustafa A. Mustafa
2020 IACR Cryptology ePrint Archive  
To protect users' privacy, it uses local proximity tracing based on broadcasting and recording constantly changing anonymous public keys via short-range communication.  ...  The three keys (i.e., the two public keys and the established shared key) are then used to generate two unique per-user-per-contact hashes: one for infection registration and one for exposure score query  ...  Furthermore, users can query only the newly logged query (and integrity) hashes.  ... 
dblp:journals/iacr/GarofalohPJAM20 fatcat:afzn57mt5ffcpdqfhxfqxdi5jm

AdVeil: A Private Targeted-Advertising Ecosystem [article]

Sacha Servan-Schreiber, Kyle Hogan, Srinivas Devadas
2021 IACR Cryptology ePrint Archive  
AdVeil achieves this using an anonymizing proxy (e.g., Tor) to transit batched user reports along with unlinkable anonymous tokens to certify the authenticity of each report.  ...  Our targeting protocol combines private information retrieval with standard, locality-sensitive hashing based techniques for nearest neighbor search.  ...  ACKNOWLEDGEMENTS We thank Peter Deutsch, Jules Drean, and Ben Murphy for for helpful discussion and feedback on this paper.  ... 
dblp:journals/iacr/Servan-Schreiber21 fatcat:7v3prq5awfh6tjtxarnwmxlq6m

Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory

Pengfei Zuo, Yu Hua, Jie Wu
2018 USENIX Symposium on Operating Systems Design and Implementation  
To guarantee the consistency with low overhead, level hashing leverages log-free consistency schemes for insertion, deletion, and resizing operations, and an opportunistic log-free scheme for update operation  ...  performance, compared with stateof-the-art hashing schemes.  ...  We are grateful to our shepherd, Steven Swanson, and the anonymous reviewers for their constructive feedback and suggestions.  ... 
dblp:conf/osdi/Zuo0W18 fatcat:6bbzatawnfgejgct7oblktsf4y

PEM: Privacy-preserving Epidemiological Modeling [article]

Marco Holz, Benjamin Judkewitz, Helen Möllering, Benny Pinkas, Thomas Schneider
2020 IACR Cryptology ePrint Archive  
We propose a practical framework for PEM on contact information stored on mobile phones, like the ones collected by already deployed contact tracing apps.  ...  Unlike existing apps that focus on past events, PEM allows for meaningful epidemiological simulations about future developments.  ...  They realize contact tracing either based on the location (via GPS or telecommunication provider information) or based on proximity (via Bluetooth LE).  ... 
dblp:journals/iacr/HolzJMPS20 fatcat:j7c2wubmaze7ve3bebgqwjqhpq

Droplet: Decentralized Authorization and Access Control for Encrypted Data Streams [article]

Hossein Shafagh, Lukas Burkhalter, Anwar Hithnawi, Sylvia Ratnasamy
2021 arXiv   pre-print
We thank Simon Duquennoy for his valuable input on earlier versions of this paper.  ...  Acknowledgments We thank our shepherd Ariel Feldman, the anonymous reviewers, Alexander Viand, Dinesh Bharadia, and Friedemann Mattern for their valuable feedback.  ...  Based on the access policy, the principal gains access to the necessary decryption keys via an access token. Access tokens are encrypted with the principal's public key (hybrid encryption).  ... 
arXiv:1806.02057v3 fatcat:lfe3247sj5bb3kdpw33ywb2eny

Configurable Per-Query Data Minimization for Privacy-Compliant Web APIs [article]

Frank Pallas and David Hartmann and Paul Heinrich and Josefine Kipke and Elias Grünewald
2022 arXiv   pre-print
Based on a careful analysis of functional and non-functional requirements, we introduce Janus, an easy-to-use, highly configurable solution for implementing legally compliant data minimization in GraphQL  ...  In this paper, we address the problem of data minimization for data-providing, query-capable Web APIs.  ...  on externally maintained roles provided via JSON Web Tokens.  ... 
arXiv:2203.09903v1 fatcat:iava4aqzyzantigzzpcvr4dihy

Anon-Pass: Practical Anonymous Subscriptions

Michael Z. Lee, Alan M. Dunn, Jonathan Katz, Brent Waters, Emmett Witchel
2014 IEEE Security and Privacy  
A user logs on to the system by presenting a credential derived from information received at registration. Each credential allows only a single login in any authentication window, or epoch.  ...  We implement a music service, an Android-based subway-pass application, and a web proxy, and show that adding anonymity adds minimal client latency and only requires 33 KB of server memory per active user  ...  We also thank our shepherd, Paul Syverson, and the useful feedback from the anonymous reviewers.  ... 
doi:10.1109/msp.2013.158 fatcat:cvlabwjz7vd23mrj2voum2kr4m


Raphael Bost
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
queries.  ...  Searchable Symmetric Encryption aims at making possible searching over an encrypted database stored on an untrusted server while keeping privacy of both the queries and the data, by allowing some small  ...  Acknowledgements The author thanks Pierre-Alain Fouque and David Pointcheval for their help on clarifying the proof of security, and Brice Minaud and anonymous reviewers for helpful comments.  ... 
doi:10.1145/2976749.2978303 dblp:conf/ccs/Bost16 fatcat:vx3lm5klsnedljzj3uxbq432du

Applying differential privacy to search queries in a policy based interactive framework

Palanivel Kodeswaran, Evelyne Viegas
2009 Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases - PAVLAD '09  
We propose a policy based safe interactive framework built on semantic policies and differential privacy to allow researchers access to search logs, while maintaining the privacy of the users.  ...  Semantic policies are used to infer the higher levels of information that can be mined from a dataset based on the fields accessed by a researcher.  ...  We are grateful to Denny Lee for his valuable discussions and sharing his experiences on using privacy preserving data analysis techniques on medical data.  ... 
doi:10.1145/1651449.1651455 dblp:conf/cikm/KodeswaranV09 fatcat:3dropa5gzvdmhkmedfk7mpmmva

Lookup-Table Recurrent Language Models for Long Tail Speech Recognition [article]

W. Ronny Huang, Tara N. Sainath, Cal Peyser, Shankar Kumar, David Rybach, Trevor Strohman
2021 arXiv   pre-print
When trained on a 3-billion sentence corpus, we find that LookupLM improves long tail log perplexity by 2.44 and long tail WER by 23.4% on a downstream speech recognition task over a standard RNN language  ...  Since embeddings are sparsely retrieved from the table via a lookup; increasing the size of the table adds neither extra operations to each forward pass nor extra parameters that need to be stored on limited  ...  Instead, we predetermine an embedding vocabulary size U based on available storage, and assign each n-gram an embedding ID via a modular hash.  ... 
arXiv:2104.04552v2 fatcat:3pzwzjyz6nb63kzykomtwuli64

A Review of Ten Year Research on Query Log Privacy

Claudio Carpineto, Giovanni Romano
2016 Italian Information Retrieval Workshop  
The research on search log anonymization is ten years old.  ...  Then we go on to discuss what are the critical issues that must be tackled before search log anonymization moves out of research laboratories and into operational settings.  ...  Hashing queries Hashing can be applied not only to external identifiers but also to single queries or elementary tokens within a query.  ... 
dblp:conf/iir/Carpineto016 fatcat:ozet3a2cdrhhrizefmprxpquhu

Anon-Pass: Practical Anonymous Subscriptions

M. Z. Lee, A. M. Dunn, B. Waters, E. Witchel, J. Katz
2013 2013 IEEE Symposium on Security and Privacy  
A user logs on to the system by presenting a credential derived from information received at registration. Each credential allows only a single login in any authentication window, or epoch.  ...  We implement a music service, an Android-based subway-pass application, and a web proxy, and show that adding anonymity adds minimal client latency and only requires 33 KB of server memory per active user  ...  In comparison, receiving 16 MB of data takes on average 194ms, dwarfing the additional cost of the hash server query. D. Gateway Cost E.  ... 
doi:10.1109/sp.2013.29 pmid:24504081 pmcid:PMC3913070 dblp:conf/sp/LeeDWWK13 fatcat:sj5zzbx6mnhx7kiqdxpbho3fx4

Ghostor: Toward a Secure Data-Sharing System from Decentralized Trust

Yuncong Hu, Sam Kumar, Raluca Ada Popa
2020 Symposium on Networked Systems Design and Implementation  
Open access to the Proceedings of the 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI '20  ...  Acknowledgments We thank the anonymous reviewers and our shepherd, Carmela Troncoso, for their invaluable feedback.  ...  We would also like to thank students from the RISELab Security Group and BETS Research Group for giving us feedback on early drafts, and David Culler for advice and discussion.  ... 
dblp:conf/nsdi/HuKP20 fatcat:nsze36dwsrcy5mms64s7gh5dlm

Privacy Pass: Bypassing Internet Challenges Anonymously

Alex Davidson, Ian Goldberg, Nick Sullivan, George Tankersley, Filippo Valsorda
2018 Proceedings on Privacy Enhancing Technologies  
We detail a 1-RTT cryptographic protocol (based on an implementation of an oblivious pseudorandom function) that allows users to receive a significant amount of anonymous tokens for each challenge solution  ...  These tokens can be exchanged in the future for access without having to interact with a challenge.  ...  These solutions were based on anonymous e-cash systems such as those listed above and on physically unclonable functions (PUFs). The work of Kerschbaum et al.  ... 
doi:10.1515/popets-2018-0026 dblp:journals/popets/DavidsonGSTV18 fatcat:gg4hbrfzynd3zcmxk45vxhaahy
« Previous Showing results 1 — 15 out of 2,219 results