Filters








15,571 Hits in 4.4 sec

Towards Relations Between the Hitting-Set Attack and the Statistical Disclosure Attack [chapter]

Dang Vinh Pham, Dogan Kesdogan
2015 IFIP Advances in Information and Communication Technology  
The Minimal-Hitting-Set attack (HS-attack) is a well-known, provably optimal exact attack against the anonymity provided by Chaumian Mixes (Threshold-Mixes).  ...  This attack allows an attacker to identify the fixed set of communication partners of a given user by observing all messages sent and received by a Chaum Mix.  ...  We call a hitting-set H a unique minimum-hitting-set 6 , if all hitting-sets H = H in OS fulfil the condition |H| < |H |.  ... 
doi:10.1007/978-3-319-18467-8_3 fatcat:ij32wlsgpvf7nbdljuxev7wgbm

Discussing Anonymity Metrics for Mix Based Anonymity Approaches [chapter]

Dang Vinh Pham, Joss Wright
2009 IFIP Advances in Information and Communication Technology  
a sender and a receiver is a more appropriate measure of its anonymity.  ...  It is therefore important to find an appropriate measure for the anonymity provided by these approaches.  ...  In the second model the unicity distance measures the average number of bits that an attacker must learn to uniquely identify a message by by examination of the cipher text.  ... 
doi:10.1007/978-3-642-05437-2_14 fatcat:qflvpjls3fcftonuvcdyztkphi

Adaptive assistants for customized E-shopping

F. Menczer, W.N. Street, A.E. Monge
2002 IEEE Intelligent Systems  
The server hosting the IntelliShopper prototype was made available by a University of Iowa instructional improvement award.  ...  For a set of hits whose feedback-based ranks are tied, we can break the tie optimistically (according to IntelliShopper's ranks).  ...  Given the established effectiveness of collaborative filtering, we may extend hit sets at the user's option by clustering personae with similar profiles. 2 . 2 The user takes on a persona. 3.  ... 
doi:10.1109/mis.2002.1134357 fatcat:gr4kj5g5y5fmti2xibpl3dqlhi

Privacy-preserving Active Learning on Sensitive Data for User Intent Classification [article]

Oluwaseyi Feyisetan, Thomas Drake, Borja Balle, Tom Diethe
2019 arXiv   pre-print
We evaluate our approach by showing the tradeoff between privacy, utility and annotation budget on a binary classification task in a active learning setting.  ...  This presents a possible privacy leak when the training set includes sensitive user data.  ...  Experiments Our work seeks to demonstrate quantifiable privacy preserving guarantees in an active learning setting by taking a presampling approach before carrying out k-anonymization.  ... 
arXiv:1903.11112v1 fatcat:a6fssjx4a5aq5giif4g44qh4mu

Attacking Anonymous Web Browsing at Local Area Networks Through Browsing Dynamics

S. Yu, W. Zhou, W. Jia, J. Hu
2011 Computer journal  
The browsing pattern of a victim can be clearly observed by a local adversary when the victim is viewing the web without protection.  ...  In order to confirm the effectiveness of the revealed attack method, we have conducted extensive experiments on a real data set.  ...  We also would like to thank Professor Guofeng Zhao for providing the data set for the experiments.  ... 
doi:10.1093/comjnl/bxr065 fatcat:sukwfl4epbckjpbu3fy7oahrrm

An Imitation Learning Approach for Cache Replacement [article]

Evan Zheran Liu, Milad Hashemi, Kevin Swersky, Parthasarathy Ranganathan, Junwhan Ahn
2020 arXiv   pre-print
In addition, on a large-scale web search benchmark, Parrot increases cache hit rates by 61% over a conventional LRU policy.  ...  In contrast, we propose an imitation learning approach to automatically learn cache access patterns by leveraging Belady's, an oracle policy that computes the optimal eviction decision given the future  ...  We also thank Chelsea Finn, Lisa Lee, and Amir Yazdanbakhsh for their comments on a draft of this paper.  ... 
arXiv:2006.16239v2 fatcat:v2gm2hjanrdhnafysbswk7dsku

Aggregate Query Answering on Anonymized Tables

Qing Zhang, Nick Koudas, Divesh Srivastava, Ting Yu
2007 2007 IEEE 23rd International Conference on Data Engineering  
We present a general framework of permutationbased anonymization to support accurate answering of aggregate queries and show that, for the same grouping, permutation-based techniques can always answer  ...  Privacy is a serious concern when microdata need to be released for ad hoc analyses.  ...  Experiments Data Sets and Experiment Design Our experiments are conducted on the Adult Database from the UCI Machine Learning Repository [12] .  ... 
doi:10.1109/icde.2007.367857 dblp:conf/icde/ZhangKSY07 fatcat:k45k6r2gpjcnrgjvj3rgtbxnze

On the Optimal Design of Operational Risk Data Consortia

Hubert Janos Kiss, Daniel Homolya
2013 Social Science Research Network  
Nonetheless, a numerical example suggests that by designing adequately the data consortium, proper reporting can be advanced, without overly compromising anonymity.  ...  When a monetary ...ne is imposed on misreporting banks, then a su¢ ciently sever punishment results in proper reporting, even if anonymity is maintained in the limit.  ...  We consider symmetric equilibria, so given the dominant strategy of banks hit by the large shock, in the unique outcome of the game all banks hit by magnitude-1 shock will misreport.  ... 
doi:10.2139/ssrn.2289906 fatcat:k4iucfh7u5euxpzvfmp65tugdu

Predicted Packet Padding for Anonymous Web Browsing Against Traffic Analysis Attacks

Shui Yu, Guofeng Zhao, Wanchun Dou, Simon James
2012 IEEE Transactions on Information Forensics and Security  
Anonymous communication has become a hot research topic in order to meet the increasing demand for web privacy protection.  ...  We formulated the traffic analysis attack and defense problem, and defined a metric, cost coefficient of anonymization (CCA), to measure the performance of anonymization.  ...  ACKNOWLEDGMENT The authors would like to sincerely thank the associate editor and the anonymous reviewers for their insightful comments and constructive suggestions, which significantly helped the authors  ... 
doi:10.1109/tifs.2012.2197392 fatcat:tuzmk4zumbcmldxw3gigzaqq3e

How To Break Anonymity of the Netflix Prize Dataset [article]

Arvind Narayanan, Vitaly Shmatikov
2007 arXiv   pre-print
We present a new class of statistical de-anonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on.  ...  We apply our de-anonymization methodology to the Netflix Prize dataset, which contains anonymous movie ratings of 500,000 subscribers of Netflix, the world's largest online movie rental service.  ...  We have presented a de-anonymization methodology for multi-dimensional micro-data, and demonstrated its practical applicability by showing how to de-anonymize movie viewing records released in the Netflix  ... 
arXiv:cs/0610105v2 fatcat:pqiawsgwfndkbodeeowjxmaafu

Towards Privacy Preserving Publishing of Set-Valued Data on Hybrid Cloud

Hongli Zhang, Zhigang Zhou, Lin Ye, Xiaojiang Du
2018 IEEE Transactions on Cloud Computing  
Motivated by this observation, we present a suite of new techniques that make privacy-aware set-valued data publishing feasible on hybrid cloud.  ...  In this work, we study the issue of privacy-preserving set-valued data publishing.  ...  A set-valued data ( , , ) satisfying EQI-partitioning is -anonymous. Proof: We prove it by contradiction.  ... 
doi:10.1109/tcc.2015.2430316 fatcat:vskmge3uprcx7pb3lkpq2f7lga

Privacy-Preserving DNS: Analysis of Broadcast, Range Queries and Mix-Based Protection Methods [chapter]

Hannes Federrath, Karl-Peter Fuchs, Dominik Herrmann, Christopher Piosecny
2011 Lecture Notes in Computer Science  
We propose a dedicated DNS Anonymity Service which protects users' privacy.  ...  The design consists of two building blocks: a broadcast scheme for the distribution of a "top list" of DNS hostnames, and low-latency Mixes for requesting the remaining hostnames unobservably.  ...  This work has been partially sponsored and supported by the European Regional Development Fund (ERDF).  ... 
doi:10.1007/978-3-642-23822-2_36 fatcat:4qeel4zemvcphn3plh6r2rjwye

Producer Anonymity based on Onion Routing in Named Data Networking

Kentaro Kita, Yuki Koizumi, Toru Hasegawa, Onur Ascigil, Ioannis Psaras
2020 IEEE Transactions on Network and Service Management  
However, in terms of producer anonymity, NDN has a serious problem that adversaries can easily learn who publishes what content due to its feature that content is inherently tied to the producer by the  ...  We demonstrate that our system provides a level of anonymity comparable to hidden service with lower overhead through analysis and experiment.  ...  Then, Adv w can break producer anonymity with probability (1 − p c ) · f R · f n A , (1) where p c is the probability that a cache hit occurs (0 ≤ p c ≤ 1).  ... 
doi:10.1109/tnsm.2020.3019052 fatcat:2jsqeiqgmjfcbhdmuplcukujhi

The dynamics of repeat consumption

Ashton Anderson, Ravi Kumar, Andrew Tomkins, Sergei Vassilvitskii
2014 Proceedings of the 23rd international conference on World wide web - WWW '14  
Based on this, we develop a model by which the item from t timesteps ago is reconsumed with a probability proportional to a function of t.  ...  We study theoretical properties of this model, develop algorithms to learn reconsumption likelihood as a function of t, and show a strong fit of the resulting inferred function via a power law with exponential  ...  Thus, to compare between sequences and datasets with different numbers of unique items, we use a "normalized hit ratio" as our measure of recency, where we divide by the upper bound on the cache hit-to-miss  ... 
doi:10.1145/2566486.2568018 dblp:conf/www/AndersonKTV14 fatcat:tcqst5e2dbcvzcm2rmqfwlhwhy

Synthesizing Emerging Images from Photographs

Cheng-Han Yang, Ying-Miao Kuo, Hung-Kuo Chu
2016 Proceedings of the 2016 ACM on Multimedia Conference - MM '16  
We adapt the previous system to the 2D setting of input photographs and develop a set of image-based operations.  ...  Emergence is the visual phenomenon by which humans recognize the objects in a seemingly noisy image through aggregating information from meaningless pieces and perceiving a whole that is meaningful.  ...  Acknowledgements We thank the anonymous reviewers for their invaluable comments and suggestions.  ... 
doi:10.1145/2964284.2967304 dblp:conf/mm/YangKC16 fatcat:gdf6ze42sndytkqa5mdp2hpopu
« Previous Showing results 1 — 15 out of 15,571 results