Search
Now showing items 11-20 of 24
Fully Resilient Non-Interactive ID-Based Hierarchical Key Agreement
Non-Interactive Key Agreement (NIKA) is a cryptographic primitive which allows two parties
to agree on a shared secret key without any interaction. Identity-based Non-Interactive Key
Agreement (ID-NIKA) allows each party ...
Constant-rate Non-malleable Codes and their Applications
Non-malleable codes(NMC) introduced by Dziembowski, Pietrzak and Wichs in ITCS 2010,
provide powerful security guarantees where error-correcting codes can not provide any guarantee: a decoding of tampered codeword is ...
Model Checking Temporal Properties of Presburger Counter Systems
Counter systems are a well-known and powerful modeling notation for specifying infnite state systems. In this thesis we target the problem of checking temporal properties of
counter systems. We address three predominant ...
FA RCU: Fault Aware Read-Copy-Update
Deferred freeing is the fundamental technique used in Read-Copy-Update (RCU) synchronization technique where reclamation of resources is deferred until the completion of all active RCU read-side critical sections. We observe ...
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 ...
Analysis and Methods for Knowledge Graph Embeddings
Knowledge Graphs (KGs) are multi-relational graphs where nodes represent entities, and typed edges represent relationships among entities. These graphs store real-world facts such as (Lionel Messi, plays-for-team, Barcelona) ...
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ...
Inducing Constraints in Paraphrase Generation and Consistency in Paraphrase Detection
Deep learning models typically require a large volume of data. Manual curation of datasets is time-consuming and limited by imagination. As a result, natural language generation (NLG) has been employed to automate the ...
Average Reward Actor-Critic with Deterministic Policy Search
The average reward criterion is relatively less studied as most existing works in the Reinforcement Learning literature consider the discounted reward criterion. There are few recent works that present on-policy average ...
Algorithms for Achieving Fairness and Efficiency in Matching Problems
Matching problems arise in numerous practical settings. Fairness and efficiency are two desirable properties in most such real world scenarios. This dissertation work presents new approaches and models for capturing and ...