11 Result(s)
within
Chapter
Esha Ghosh
English
-
Chapter and Conference Paper
Credential Transparency System
A major component of the entire digital identity ecosystem are verifiable credentials. However, for users to have complete control and privacy of their digital credentials, they need to be able to store and ma...
-
Chapter and Conference Paper
Rotatable Zero Knowledge Sets
Key Transparency (KT) systems allow end-to-end encrypted service providers (messaging, calls, etc.) to maintain an auditable directory of their users’ public keys, producing proofs that all participants have a co...
-
Chapter
Astroglial Iron Homeostasis and Neurodegenerative Diseases
Iron is essential for normal brain functioning for satisfying high demand of energy requirement, myelin synthesis, and neurotransmitter synthesis and for maintaining numerous other homeostatic functions. In co...
-
Chapter and Conference Paper
Secret-Shared Shuffle
Generating additive secret shares of a shuffled dataset - such that neither party knows the order in which it is permuted - is a fundamental building block in many protocols, such as secure collaborative filterin...
-
Chapter and Conference Paper
Oblivious PRF on Committed Vector Inputs and Application to Deduplication of Encrypted Data
Ensuring secure deduplication of encrypted data is a very active topic of research because deduplication is effective at reducing storage costs. Schemes supporting deduplication of encrypted data that are not...
-
Chapter and Conference Paper
Stateful Multi-client Verifiable Computation
This paper develops an asynchronous cryptographic protocol for outsourcing arbitrary stateful computation among multiple clients to an untrusted server, while guaranteeing integrity of the data. The clients co...
-
Chapter and Conference Paper
Zero-Knowledge Accumulators and Set Algebra
Cryptographic accumulators allow to succinctly represent a set by an accumulation value with respect to which short (non-)membership proofs about the set can be efficiently constructed and verified. Traditiona...
-
Chapter and Conference Paper
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
We propose a three-party model for maintaining a dynamic data structure that supports verifiable and privacy-preserving (zero-knowledge) queries. We give efficient constructions supporting this model for order...
-
Chapter and Conference Paper
Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
An order query takes as input a set of elements from a list (ordered sequence) \(\mathcal {L}\) , and asks for this se...
-
Chapter and Conference Paper
Faster Parameterized Algorithms for Deletion to Split Graphs
An undirected graph is said to be split if its vertex set can be partitioned into two sets such that the subgraph induced on one of them is a complete graph and the subgraph induced on the other is an independent...
-
Chapter and Conference Paper
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
The longest path problem is the problem of finding a simple path of maximum length in a graph. Polynomial solutions for this problem are known only for special classes of graphs, while it is NP-hard on general...
