Secure distributed human computation

  title={Secure distributed human computation},
  author={Craig Gentry and Zulfikar Ramzan and Stuart G. Stubblebine},
  booktitle={EC '05},
This paper is a preliminary exploration of secure distributed human computation. We consider the general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are especially motivated by problem classes that appear to be difficult for computers to solve effectively, but are easier for humans; e.g., image analysis, speech recognition, and natural language processing. This paradigm already seems to… 

Figures from this paper

A Survey of Human Computation Systems
A survey of various human computation systems which are categorized into initiatory human computation, distributed human computation and social game-based human computation with volunteers, paid engineers and online players is given.
Dragoon: Private Decentralized HITs Made Practical
This work presents a practical decentralized protocol for HITs, which also achieves the fairness between requesters and workers and rigorously defines the ideal functionality of decentralized HITs and then proves the security due to the ideal/real paradigm.
A comprehensive human computation framework: with application to image labeling
The proposed schemes can successfully remove spurious answers from bots and distill human answers to produce high-quality image labels and indicate that the Web 2.0 approach to labeling images and videos efficiently is adopted.
Fraud Detection by Human Agents: A Pilot Study
Positive evidence that detecting fraudsters with human computation is viable is shown, in terms of precision and recall of human classifiers.
Human- Computing: a Human
Computing technologies are increasingly affecting and trans-forming almost every aspect of the authors' daily lives, and several aspects of daily life are becoming increas-ingly complex and demanding.
Employing Response Time Constraints to Mitigate CAPTCHA Relay Attacks
This paper employs response time constraints as a measure to mitigate CAPTCHA relay attacks and utilize time between responses as a way of differentiating humans from automated scripts.
Towards a Theory of AI Completeness
  • Dafna Shahaf, Eyal Amir
  • Computer Science, Mathematics
    AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning
  • 2007
This work serves as a formal basis for investigation of problems that researchers treat as hard AI problems and allows progress in AI as a field to be more measurable, instead of measurable with respect to problem-specific quantities.
The design of puzzle selection strategies for GWAP systems
It is demonstrated that the proposed OPSA approach can effectively improve the system gain of GWAP systems, as long as the number of puzzles in the system is sufficiently large.
Human-Centered Computing : Toward a Human Revolution
Thanks to computing technologies, the authors' options for communicating with others have increased, but that does not necessarily mean that their communications have Human-centered computing studies the.
A three-way investigation of a game-CAPTCHA: automated attacks, relay attacks and usability
This work formalize, design and implement a representative category of DCG captchas, and dissect them across: (1) fully automated attacks, (2) human-solver relay attacks, and (3) usability.


Protocols for secure computations
  • A. Yao
  • Mathematics
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
The author gives a precise formulation of this general problem and describes three ways of solving it by use of one-way functions, which have applications to secret voting, private querying of database, oblivious negotiation, playing mental poker, etc.
CAPTCHA: Using Hard AI Problems for Security
This work introduces captcha, an automated test that humans can pass, but current computer programs can't pass; any program that has high success over a captcha can be used to solve an unsolved Artificial Intelligence (AI) problem; and provides several novel constructions of captchas, which imply a win-win situation.
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the performance is
Uncheatable Distributed Computations
This paper proposes security schemes that defend against cheating by ensuring that it does not pay off, while stronger schemes let participants prove that they have done most of the work they were assigned with high probability.
Self-testing/correcting with applications to numerical problems
This work presents general techniques for constructing simple to program self-testing/correcting pairs for a variety of numerical functions, including integer multiplication, modular multiplication, matrix multiplication, inverting matrices, computing the determinant of a matrix, Computing the rank of a Matrix, integer division, modular exponentiation, and polynomial multiplication.
Designing programs that check their work
This paper defines the concept of a program checker, designs program checkers for a few specific and carefully chosen problems in the class P of problems solvable in polynomial time and characterizes the problems that can be checked.
Chernoff-Hoeffding bounds for applications with limited independence
The limited independence result implies that a reduced amount and weaker sources of randomness are sufficient for randomized algorithms whose analyses use the CH bounds, e.g., the analysis of randomized algorithms for random sampling and oblivious packet routing.
Approximate Object Location and Spam Filtering on Peer-to-Peer Systems
This paper proposes an extension to DOLR systems to publish objects using generic feature vectors instead of content-hashed GUIDs, which enables the systems to locate similar objects.
Labeling images with a computer game
A new interactive system: a game that is fun and can be used to create valuable output that addresses the image-labeling problem and encourages people to do the work by taking advantage of their desire to be entertained.
Impossibility of distributed consensus with one faulty process
It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem.