Reliability with Accuracy: Verifying Correctness of Resultant of the Outsourced Frequent Item Set Mining In Data-Mining-As-A-Service Paradigm
Downloads
Nowadays online applications lack reliability for establishing the integrity of user-generated information. Users may unknowingly own compromised devices, or intentionally publish forged information. In these scenarios, applications need some way to determine the correctness of autonomously generated information. Towards that end, this thesis presents a trust-but- verify approach that enables open online applications to independently verify the information generated by each participant. In order to enable independent verification, our framework allowsour application to verify more information from less trustworthy users andless information from more trustworthy users. Thus, an application can trade-off performance for more integrity, or vice versa. We apply the trust-but- verify approach to three different classes of online applications and show how it can enable 1) high-integrity, privacy-preserving, crowd-sourced sensing 2) non-intrusive cheat detection in online games, and 3) effective spam prevention in online messaging applications.
Srinath Setty, Andrew J. Blumberg, and Michael Walfish. Towardpractical and unconditional verification of remote computations. In Hot OS, 2011.
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, and Hong Cheng. Mining colossal frequent patterns by core pattern fusion. In ICDE,2007.
N. Baughman and B. Levine. Cheat-proof playout for centralized and distributed online games. In IEEE INFOCOM 2001.
C. Castelluccia, E. Mykletun, and G. Tsudik. E_cient aggregation of encrypteddata in wireless sensor network.
Rosario Gennaro, Craig Gentry, and Bryan Parno. Non-interactive verifiable computing: outsourcing computation to untrusted workers. In CRYPTO, pages 465–482, 2010.
Fosca Giannotti, Laks V. S. Lakshmanan, Anna Monreale, Dino Pedreschiand Wendy Hui Wang. Privacy-preserving data mining from outsourced databases. In Computers, Privacy and Data Protection, pages 411–426. 2011.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal of Computing, 18:186– 208, February 1989.
Feifei Li, MariosHadjieleftheriou, George Kollios, and Leonid Reyzin. Dynamic authenticated index structures for outsourced databases. In SIGMOD, pages 121–132, 2006.