Utilizing The Power of Human Cycles ( Thesis Proposal )

We propose several novel techniques for exploiting the computational abilities (or “cycles”) of humans. One technique is captcha, an automated test that humans can pass but that current computer programs cannot. captchas take advantage of the power of human cycles to differentiate people from computers. We propose several constructions of captchas and we show that they have many applications in practical security — the results of our work, for instance, are used by Yahoo to ensure that only humans obtain free email accounts. We also introduce techniques to harvest human cycles for the purpose of solving large-scale problems that computers cannot yet solve. There many people on the internet constantly doing things that computer programs cannot currently do: understanding images and sentences, chatting, passing captcha tests, etc. We show how to “reuse” or “steal” such human cycles to do useful work. We introduce a game, The ESP Game, that is fun — many people play over 40 hours a week! — and when people play they help determine the contents of images on the Web by providing meaningful labels for them. If the game is played as much as other popular online games, all images on the Web can be labeled in just a few weeks. Attaching proper labels to all images on the Web would allow for more accurate image search engines, would improve the accessibility of Web sites (by providing descriptions of images to visually impaired individuals), and would help Web browsers block

[1]  Alan L. Mackay,et al.  The Code Breakers , 1984 .

[2]  Manuel Blum,et al.  Telling Humans and Computers Apart Automatically or How Lazy Cryptographers do AI , 2002 .

[3]  Michael Luby,et al.  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[4]  Eran Tromer,et al.  Factoring large numbers with the TWIRL device , 2003 .

[5]  Hannes Federrath,et al.  Modeling the Security of Steganographic Systems , 1998, Information Hiding.

[6]  Takeo Kanade,et al.  Object Detection Using the Statistics of Parts , 2004, International Journal of Computer Vision.

[7]  Abhay Bansal,et al.  BREAKING A VISUAL CAPTCHA : A NOVEL APPROACH USING HMM , 2008 .

[8]  John Langford,et al.  CAPTCHA: Using Hard AI Problems for Security , 2003, EUROCRYPT.

[9]  Henry S. Baird,et al.  Pessimal print: a reverse Turing test , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.

[10]  IEEE conference on computer vision and pattern recognition , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[11]  David A. Forsyth,et al.  Learning the semantics of words and pictures , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[12]  Chanathip Namprempre,et al.  Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm , 2000, Journal of Cryptology.

[13]  Moni Naor,et al.  Does parallel repetition lower the error in computationally sound protocols? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[15]  J.A. O'Sullivan,et al.  Information theoretic analysis of steganography , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[16]  Mihir Bellare,et al.  OCB: a block-cipher mode of operation for efficient authenticated encryption , 2001, CCS '01.

[17]  Chuck P. Lam,et al.  Open Mind Animals : Insuring the quality of data openly contributed over the World Wide Web , 2000 .

[18]  Thomas Mittelholzer,et al.  An Information-Theoretic Approach to Steganography and Watermarking , 1999, Information Hiding.

[19]  David A. Forsyth,et al.  Object Recognition as Machine Translation: Learning a Lexicon for a Fixed Image Vocabulary , 2002, ECCV.

[20]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[21]  R. E. Milliman Website Accessibility and the Private Sector: Disability Stakeholders Cannot Tolerate 2% Access! , 2002 .

[22]  T. K. Rengarajan,et al.  Storage and Retrieval of Feature Data for a Very Large Online Image Collection. , 1996 .

[23]  L. Trask Language Change , 1994 .

[24]  Scott Craver,et al.  On Public-Key Steganography in the Presence of an Active Warden , 1998, Information Hiding.

[25]  Benny Pinkas,et al.  Securing passwords against dictionary attacks , 2002, CCS '02.

[26]  Russell Impagliazzo,et al.  One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.

[27]  Andreas Westfeld,et al.  Steganography in a Video Conferencing System , 1998, Information Hiding.

[28]  Kasun De Zoysa,et al.  Video steganography , 2013, 2013 International Conference on Advances in ICT for Emerging Regions (ICTer).

[29]  John Langford,et al.  Provably Secure Steganography , 2009, IEEE Trans. Computers.

[30]  Christian Cachin,et al.  An information-theoretic model for steganography , 1998, Inf. Comput..

[31]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[32]  Takeo Kanade,et al.  User-Powered "Content-Free" Approach to Image Retrieval , 2004 .

[33]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[34]  C. Ern Information hiding techniques for steganography and digital watermarking , 2018 .

[35]  George Nagy,et al.  Optical character recognition: an illustrated guide to the frontier , 1999, Electronic Imaging.

[36]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[37]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[38]  Irfan Essa,et al.  Hello, Are You Human? , 2000 .