With rapid advances of Internet
technology, security concerns and economic incentives have become crucial in
the world of computing. In this seminar, we discuss recent research results and
problems in the areas of computer security and economic incentives. Topics to
be covered include, but are not limited to: privacy-preserving data mining,
privacy in databases, incentive-compatible mobile computing, wireless network
security, computational game theory, and applied cryptography. We stress on a
balance of practical usefulness and theoretical depth; most papers covered in
this class attempt to solve practically interesting problems using
mathematically rigorous methods.
This is a research seminar with
the target of exposing students to frontier research. There are no homeworks or exams. A number of lectures are given by the
instructor and other classes are student presentations and discussions. Each
student is also required to study a topic assigned by the instructor and submit
a written report.
Privacy-Preserving Data Mining. R. Agrawal and R. Srikant, SIGMOD 2000.
Privacy Preserving Data Mining. Y. Lindell and B. Pinkas, CRYPTO 2000.
Privacy Preserving Association Rule Mining in Vertically Partitioned Data. J. Vaidya and C. Clifton, KDD 2002.
Using Randomized Response Techniques for Privacy-Preserving Data Mining. W. Du and Z. Zhan, KDD 2003.
A Condensation Approach to Privacy Preserving Data Mining. C. C. Aggarwal and P. S. Yu, EDBT 2004.
Privacy-Preserving Outlier Detection. J. Vaidya and C. Clifton. ICDM 2004.
Privacy-Preserving Classification without Loss of Accuracy. Z. Yang, S. Zhong, and R. N. Wright, SDM 2005.
Deriving Private Information from Randomized Data. Z. Huang, W. Du, and B. Chen, SIGMOD 2005.
Anonymity-Preserving Data Collection. Z. Yang, S. Zhong, and R. N. Wright, KDD 2005.
A Hybrid Multi-Group Privacy Preserving Approach for Building
Decision Trees. Z. Teng
and W. Du. PAKDD 2007.
Privacy-Preservation for Gradient Descent Methods. L. Wan, W. K. Ng, S. Han, and V. C. S. Lee. KDD 2007.
k-Anonymity: A Model for Protecting Privacy. L.
Sweeney, Int. J. Uncertain. Fuzziness Knowl.-Based
Syst. 10(5), 2002.
Protecting Respondent's Privacy in Microdata
Release. P. Samarati,
TKDE 13(6), 2001.
On the Complexity of Optimal k-Anonymity. A. Meyerson and R. Williams,
PODS 2004.
Privacy-Enhancing
k-Anonymization of Customer Data. S. Zhong, Z. Yang, and R. N. Wright, PODS 2005.
Data
Privacy through Optimal k-Anonymization. R. J. Bayardo
and R. Agrawal, ICDE 2005.
ℓ -Diversity: Privacy Beyond
k -Anonymity. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam,
ICDE 2006.
Workload-Aware Anonymization K. LeFevre,
D. J. DeWitt, and R. Ramakrishnan, KDD 2006.
Anonymization
for Sequential Releases, K. Wang and B. C. M. Fung, KDD 2006.
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity Ninghui
Li, Tiancheng Li, and Suresh Venkatasubramanian,
ICDE 2007.
A Pairwise Key
Pre-distribution Scheme for Wireless Sensor Networks. W. Du, J. Deng, Y. S. Han, and P. Varshney,
CCS 2003.
Establishing Pairwise
Keys in Distributed Sensor Networks. D. Liu
and P. Ning, CCS 2003.
LEAP:
Efficient Security Mechanisms for Large-Scale Distributed Sensor Networks. S. Zhu, S. Setia,
and S. Jajodia, CCS 2003.
SIA: Secure
Information Aggregation in Sensor Networks. B. Przydatek,
D. Song, and A. Perrig, SENSYS 2003.
Location Privacy in Wireless Networks.
H. -C. Hu and H. J. Wang, SIGCOMM
Secure Time Synchronization Service for Sensor Networks. S. Ganeriwal, S. Capkun, C. -C. Han,
and M. B. Srivastava, WiSe
Workshop 2005.
Low-cost
Attacks against Packet Delivery, Localization and Time Synchronization Services
in Under-Water Sensor Networks. J. Kong, Z. Ji,
W. Wang, M. Gerla, R. Bagrodia,
and B. Bhargava, WiSe
Workshop 2005.
Oblivious Signature-Based Envelope.
N. Li, W. Du, and D. Boneh, PODC 2003.
Dining Cryptographers
Revisited. P. Golle and A. Juels, Eurocrypt 2004.
Efficient
Identity-Based Encryption Without Random Oracles .
B. Waters, Eurocrypt 2005.
Policy-Hiding Access Control in Open Environment. J. Li and N. Li, PODC 2005.
Privacy-Preserving Queries on Encrypted Data . Z. Yang, S. Zhong, and R. N. Wright, ESORICS 2006.
Mitigating Routing Misbehavior in Mobile Ad Hoc
Networks. S. Marti, T. Giuli,
K. Lai, and M. Baker, MOBICOM 2000.
Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes Fairness In Dynamic Ad-hoc NeTworks.
S. Buchegger and J.-Y. L. Boudec,
MOBIHOC 2002.
Sprite:
A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks. S.
Zhong, J. Chen, and Y. R. Yang, INFOCOM 2003.
Ad
hoc-VCG: a Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc
Networks with Selfish Agents. L. Anderegg and S. Eidenbenz, MOBICOM 2003.
A Charging and Rewarding Scheme for Packet Forwarding. N. Ben Salem, L. Buttyan,
J. P. Hubaux, and M. Jakobsson,
MOBIHOC 2003.
Truthful Multicast in Selfish Wireless Networks. W. Wan, X.-Y. Li, and Y. Wang, MOBICOM
2004.
On
Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless
Ad-Hoc Networks ¨D An Integrated Approach Using Game
Theoretical and Cryptographic Techniques. S. Zhong, L. E. Li, Y. G. Liu, and Y. R.
Yang, MOBICOM 2005.
OURS- Optimal Unicast Routing Systems in
Non-Cooperative Wireless Networks. W. Wang, S. Eidenbez,
Y. Wang, and X.-Y. Li. MOBICOM 2006.
On Designing Collusion-Resistant Routing Schemes for Non-Cooperative Wireless Ad Hoc Networks. S. Zhong and F. Wu. MOBICOM 2007.
DARWIN: Distributed and Adaptive Reputation Mechanism for Wireless Ad-hoc Networks. J. J. Jaramillo and R. Srikant. MOBICOM 2007.
Game-Theoretic Model for Collaborative Protocols in Selfish, Tariff-Free, Multihop Wireless Networks. See-Kee Ng and Winston Seah. INFOCOM 2008.
Hidden information and actions in multi-hop wireless ad hoc networks. Xiang-Yang Li, YanWei Wu, Ping Xu, GuiHai Chen, and Mo Li. MobiHoc 2008.
Incentive-Compatible Opportunistic Routing for Wireless Networks. Fan Wu, Tingting Chen, Sheng Zhong, Li Erran Li, and Yang Richard Yang. MOBICOM 2008.
Non-cooperative Multi-radio Channel Allocation in Wireless Networks. M. Felegyhazi, M. Cagalj, S. Saeedi Bidokhti, and J. ¨CP., Hubaux. INFOCOM 2007.
Globally Optimal Channel Assignment for Non-cooperative Wireless Networks. Fan Wu, Sheng Zhong, and Chunming Qiao. INFOCOM 2008.
A game approach for multi-channel allocation in multi-hop wireless networks. Lin Gao and Xinbing Wang. MobiHoc 2008.
Wireless Operators in a Shared Spectrum . M. Felegyhazi and J.-P. Hubaux, INFOCOM 2006.
Border Games in Cellular Networks. M. Felegyhazi, M. Cagalj, D. Dufour, and J. ¨CP., Hubaux. INFOCOM 2007.
Dice: a game theoretic framework for wireless multipath network coding. Xinyu Zhang and Baochun Li. MobiHoc 2008.
Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information. G. Woo, P. Kheradpour, D. Shen, and D. Katabi. MOBICOM 2007.
Trading Structure for Randomness in Wireless Opportunistic Routing. S. Chachulski, M. Jennings, S. Katti, and D. Katabi. SIGCOMM 2007.
XORs In The Air: Practical Wireless Network Coding. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. SIGCOMM 2006.
Network Information Flow. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. IEEE Transactions on Information Theory, Vol. 46, No. 4, 2000.