Security and Trust in Distributed Computation

We propose three research problems to explore the relations between trust and security in the setting of distributed computation. In the first problem, we study trust-based adversary detection in distributed consensus computation. The adversaries we consider behave arbitrarily disobeying the consensus protocol. We propose a trust-based consensus algorithm with local and global trust evaluations. The algorithm can be abstracted using a two-layer structure with the top layer running a trust-based consensus algorithm and the bottom layer as a subroutine executing a global trust update scheme. We utilize a set of pre-trusted nodes, headers, to propagate local trust opinions throughout the network. This two-layer framework is flexible in that it can be easily extensible to contain more complicated decision rules, and global trust schemes. The first problem assumes that normal nodes are homogeneous, i.e. it is guaranteed that a normal node always behaves as it is programmed. In the second and third problems however, we assume that nodes are heterogeneous, i.e, given a task, the probability that a node generates a correct answer varies from node to node. The adversaries considered in these two problems are workers from the open crowd who are either investing little efforts in the tasks assigned to them or intentionally give wrong answers to questions. In the second part of the thesis, we consider a typical crowdsourcing task that aggregates input from multiple workers as a problem in information fusion. To cope with the issue of noisy and sometimes malicious input from workers, trust is used to model workers' expertise. In a multi-domain knowledge learning task, however, using scalar-valued trust to model a worker's performance is not sufficient to reflect the worker's trustworthiness in each of the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, we further propose two extended models, one of which handles input tasks with real-valued features and the other handles tasks with text features by incorporating topic models. Our models can effectively recover trust vectors of workers, which can be very useful in task assignment adaptive to workers' trust in the future. These results can be applied for fusion of information from multiple data sources like sensors, human input, machine learning results, or a hybrid of them. In the second subproblem, we address crowdsourcing with adversaries under logical constraints. We observe that questions are often not independent in real life applications. Instead, there are logical relations between them. Similarly, workers that provide answers are not independent of each other either. Answers given by workers with similar attributes tend to be correlated. Therefore, we propose a novel unified graphical model consisting of two layers. The top layer encodes domain knowledge which allows users to express logical relations using first-order logic rules and the bottom layer encodes a traditional crowdsourcing graphical model. Our model can be seen as a generalized probabilistic soft logic framework that encodes both logical relations and probabilistic dependencies. To solve the collective inference problem efficiently, we have devised a scalable joint inference algorithm based on the alternating direction method of multipliers. The third part of the thesis considers the problem of optimal assignment under budget constraints when workers are unreliable and sometimes malicious. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this problem, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraints. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget, and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in a lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms.

Efficient Secure Computation for Real-world Settings and Security Models

Secure computation involves multiple parties computing a common function while keeping their inputs private, and is a growing field of cryptography due to its potential for maintaining privacy guarantees in real-world applications. However, current secure computation protocols are not yet efficient enough to be used in practice. We argue that this is due to much of the research effort being focused on generality rather than specificity. Namely, current research tends to focus on constructing and improving protocols for the strongest notions of security or for an arbitrary number of parties. However, in real-world deployments, these security notions are often too strong, or the number of parties running a protocol would be smaller. In this thesis we make several steps towards bridging the efficiency gap of secure computation by focusing on constructing efficient protocols for specific real-world settings and security models. In particular, we make the following four contributions: - We show an efficient (when amortized over multiple runs) maliciously secure two-party secure computation (2PC) protocol in the multiple-execution setting, where the same function is computed multiple times by the same pair of parties. - We improve the efficiency of 2PC protocols in the publicly verifiable covert security model, where a party can cheat with some probability but if it gets caught then the honest party obtains a certificate proving that the given party cheated. - We show how to optimize existing 2PC protocols when the function to be computed includes predicate checks on its inputs. - We demonstrate an efficient maliciously secure protocol in the three-party setting.

STUDENTS’ PERCEPTIONS OF TEACHER INSTRUMENTAL SUPPORT AS A PREDICTOR OF MOTIVATION IN READING AND MATH AND ACHIEVEMENT FROM SECOND THROUGH TWELFTH GRADE

In this study, relations among students’ perceptions of instrumental help/support from their teachers and their reading and math ability beliefs, subjective task values, and academic grades, were explored from elementary through high school. These relations were examined in an overall sample of 1,062 students from the Childhood and Beyond (CAB) study dataset, a cohort-sequential study that followed students from elementary to high school and beyond. Multi-group structural equation model (SEM) analyses were used to explore these relations in adjacent grade pairs (e.g., second grade to third grade) in elementary school and from middle school through high school separately for males and females. In addition, multi-group latent growth curve (LGC) analyses were used to explore the associations among change in the variables of interest from middle school through high school separately for males and females. The results showed that students’ perceptions of instrumental help from teachers significantly positively predicted: (a) students’ math ability beliefs and reading and math task values in elementary school within the same grade for both girls and boys, and (b) students’ reading and math ability beliefs, reading and math task values, and GPA in middle and high school within the same grade for both girls and boys. Overall, students’ perceptions of instrumental help from teachers more consistently predicted ability beliefs and task values in the academic domain of math than in the academic domain of reading. Although there were some statistically significant differences in the models for girls and boys, the direction and strength of the relations in the models were generally similar for both girls and boys. The implications for these findings and suggestions for future research are discussed.

Connecting the dots: Examining the role of parental beliefs and preschoolers’ affect and engagement in predicting parent-child number exploration during a meaningful math experience

The current study examined the frequency and quality of how 3- to 4-year-old children and their parents explore the relations between symbolic and non-symbolic quantities in the context of a playful math experience, as well as the role of both parent and child factors in this exploration. Preschool children’s numerical knowledge was assessed while parents completed a survey about the number-related experiences they share with their children at home, and their math-related beliefs. Parent-child dyads were then videotaped playing a modified version of the card game War. Results suggest that parents and children explored quantity explicitly on only half of the cards and card pairs played, and dyads of young children and those with lower number knowledge tended to be most explicit in their quantity exploration. Dyads with older children, on the other hand, often completed their turns without discussing the numbers at all, likely because they were knowledgeable enough about numbers that they could move through the game with ease. However, when dyads did explore the quantities explicitly, they focused on identifying numbers symbolically, used non-symbolic card information interchangeably with symbolic information to make the quantity comparison judgments, and in some instances, emphasized the connection between the symbolic and non-symbolic number representations on the cards. Parents reported that math experiences such as card game play and quantity comparison occurred relatively infrequently at home compared to activities geared towards more foundational practice of number, such as counting out loud and naming numbers. However, parental beliefs were important in predicting both the frequency of at-home math engagement as well as the quality of these experiences. In particular, parents’ specific beliefs about their children’s abilities and interests were associated with the frequency of home math activities, while parents’ math-related ability beliefs and values along with children’s engagement in the card game were associated with the quality of dyads’ number exploration during the card game. Taken together, these findings suggest that card games can be an engaging context for parent-preschooler exploration of numbers in multiple representations, and suggests that parents’ beliefs and children’s level of engagement are important predictors of this exploration.