Computer Science and Automation (CSA): Recent submissions
Now showing items 101-120 of 394
-
Towards Effcient Privacy-Preserving Two-Party k-Means Clustering Protocol
Two-party data mining is a win-win game if played with a guarantee of data privacy from each other. This guarantee is provided by the use of cryptographic techniques in designing the two-party protocol. The need to ... -
Revisiting Statistical Techniques for Result Cardinality Estimation
The Relational Database Management Systems (RDBMS) constitute the backbone of today's information-rich society, providing a congenial environment for handling enterprise data during its entire life cycle of generation, ... -
Experiences in using Reinforcement Learning for Directed Fuzzing
Directed testing is a technique to analyze user-specified target locations in the program. It reduces the time and effort of developers by excluding irrelevant parts of the program from testing and focusing on reaching ... -
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem
The classical Stochastic Multi-armed Bandit (MAB) problem provides an abstraction for many real-world decision making problems such as sponsored-search auctions, crowd-sourcing, wireless communication, etc. In this work, ... -
Robust Algorithms for recovering planted structures in Semi-random instances
In this thesis, we study algorithms for three fundamental graph problems. These are NP-hard problems which have not been understood completely as there is a signifiicant gap between the algorithmic and the hardness fronts ... -
Signcryption in a Quantum World
With recent advancements and research on quantum computers, it is conjectured that in the foreseeable future, sufficiently large quantum computers will be built to break essentially all public key cryptosystems currently ... -
Honest Majority and Beyond: Efficient Secure Computation over Small Population
Secure Multi-Party Computation for small population has witnessed notable practically-efficient works in the setting of both honest majority and dishonest majority. While honest majority provides the promise of stronger ... -
Stochastic Approximation with Markov Noise: Analysis and applications in reinforcement learning
Stochastic approximation algorithms are sequential non-parametric methods for finding a zero or minimum of a function in the situation where only the noisy observations of the function values are available. Two time-scale ... -
Learning to Adapt Policies for uSD card
Machine Learning(ML) for Systems is a new and promising research area where performance of computer systems is optimized using machine learning methods. ML for Systems has outperformed traditional heuristics methods in ... -
Practically Efficient Secure Small Party Computation over the Internet
Secure Multi-party Computation (MPC) with small population has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. Practically efficient constructions ... -
Algorithms for Challenges to Practical Reinforcement Learning
Reinforcement learning (RL) in real world applications faces major hurdles - the foremost being safety of the physical system controlled by the learning agent and the varying environment conditions in which the autonomous ... -
Recommendations in Complex Networks: Unifying Structure into Random Walk
Making recommendations or predicting links which are likely to exist in the future is one of the central problems in network science and graph mining. In spite of modern state-of- the-art approaches for link prediction, ... -
Design of Trusted Market Platforms using Permissioned Blockchains and Game Theory
The blockchain concept forms the backbone of a new wave technology that promises to be deployed extensively in a wide variety of industrial and societal applications. Governments, financial institutions, banks, industrial ... -
Expanders in Arithmetic Circuit Lower Bound : Towards a Separation Between ROABPs and Multilinear Depth 3 Circuits
Consider the problem of Polynomial Identity Testing(PIT): we are given an arithmetic circuit computing a multivariate polynomial over some eld and we have to determine whether that polynomial is identically zero or not. ... -
On the Round Complexity Landscape of Secure Multi-party Computation
In secure multi-party computation (MPC), n parties wish to jointly perform a computation on their private inputs in a secure way, so that no adversary corrupting a subset of the parties can learn more information than their ... -
Hypergraph Network Models: Learning, Prediction, and Representation in the Presence of Higher-Order Relations
The very thought about “relating” objects makes us assume the relation would be “pairwise”, and not of a “higher-order” — involving possibly more than two of them at a time. Yet in reality, higher-order relations do exist ... -
Towards Secure and Efficient Realization of Pairing-Based Signatures from Static Assumptions.
Bilinear pairing defined over elliptic curve group was first used to design novel cryptosystem in 2000. Since then a large number of cryptosystems has been proposed in pairing-based cryptography (PBC). The main tool for ... -
Learning Tournament Solutions from Preference-based Multi-Armed Bandits
We consider the dueling bandits problem, a sequential decision task where the goal is to learn to pick `good' arms out of an available pool by actively querying for and observing relative preferences between selected pairs ... -
Efficient and Secure Search over Encrypted Data
Due to a variety of crucial bene fits, enterprises outsource their data to cloud resident storage. The outsourced data needs to be stored in encrypted form on remote untrusted servers to preserve privacy. However, if the ... -
Program Analyses to Support Memory-saving Refactorings in Java Programs
Software commonly consumes unexpectedly high amounts of memory, frequently due to programming idioms that are used to make software more reliable, maintainable and understandable. In the case of modern object-oriented ...