Search
Now showing items 51-60 of 76
Fast Actively Secure OT Extension for Short Secrets
(2018-05-25)
Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems ...
Large Scale Graph Processing in a Distributed Environment
(2018-05-25)
Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multi-core processors and accelerators. However, real world graphs are massive in ...
Non-Parametric Clustering of Multivariate Count Data
(2018-05-23)
The focus of this thesis is models for non-parametric clustering of multivariate count data. While there has been significant work in Bayesian non-parametric modelling in the last decade, in the context of mixture models ...
Design of Quality Assuring Mechanisms with Learning for Strategic Crowds
(2018-05-23)
In this thesis, we address several generic problems concerned with procurement of tasks from a crowd that consists of strategic workers with uncertainty in their qualities. These problems assume importance as the quality ...
Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications
(2018-05-23)
Hierarchical Bayesian Models and Matrix factorization methods provide an unsupervised way to learn latent components of data from the grouped or sequence data. For example, in document data, latent component corn-responds ...
A Study of Thompson Sampling Approach for the Sleeping Multi-Armed Bandit Problem
(2018-05-29)
The multi-armed bandit (MAB) problem provides a convenient abstraction for many online decision problems arising in modern applications including Internet display advertising, crowdsourcing, online procurement, smart grids, ...
Generalization of Hitting, Covering and Packing Problems on Intervals
(2018-05-29)
Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ...
Constructing Provably Secure Identity-Based Signature Schemes
(2018-04-03)
An identity-based cryptosystem (IBC) is a public-key system where the public key can be represented by any arbitrary string such as an e-mail address. The notion was introduced by Shamir with the primary goal of simplifying ...
Construction of Secure and Efficient Private Set Intersection Protocol
(2018-03-17)
Private set intersection(PSI) is a two party protocol where both parties possess a private set and at the end of the protocol, one party (client) learns the intersection while other party (server) learns nothing. Motivated ...
A Theoretical Study of the Synergy and Lazy Annotation Algorithms
(2018-04-03)
Given a program with assertions, the assertion checking problem is to tell whether there is an execution of the program that violates one of the assertions. One approach to this problem is to explore different paths towards ...