Browsing Computer Science and Automation (CSA) by Subject "Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science"
Now showing items 21-26 of 26
-
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 ... -
Rational Secure Computation: New Definitions and Constructions
Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory ... -
Representing Networks: Centrality, Node Embeddings, Community Outliers and Graph Representation
Networks are ubiquitous. We start our technical work in this thesis by exploring the classical concept of node centrality (also known as influence measure) in information networks. Like clustering, node centrality is also ... -
Specification Synthesis with Constrained Horn Clauses
Many practical problems in software development, verification and testing rely on specifications. The problem of specification synthesis is to automatically find relational constraints for undefined functions, called ... -
Typestates and Beyond: Verifying Rich Behavioral Properties Over Complex Programs
Statically verifying behavioral properties of programs is an important research problem. An efficient solution to this problem will have visible effects over multiple domains, ranging from program development, program ... -
Verification of a Generative Separation Kernel
A Separation Kernel is a small specialized microkernel that provides a sand-boxed execution environment for a given set of processes (also called \subjects"). The subjects may communicate only via declared memory channels, ...