Theoretical Computer Science

Given that the Schnorr's protocol for Discrete Logarithm (DLOG) exchanges three messages, it is an interesting problem whether a constant round zero-knowledge protocol exists for the Double Discrete Logarithm problem (DDLOG), i.e., to demonstrate ...

• Zero knowledge protocol for double discrete logarithm.
• Constant round complexity.
• Constant prover and verifier complexity.
• Limitations: needs bilinear pairing and secret witness in poly(λ).

We study the sum basic network creation game introduced in 2010 by Alon, Demaine, Hajiaghai and Leighton. In this game, an undirected and unweighted graph G is said to be a sum basic equilibrium if and only if, for every edge uv and any vertex v ′...

Almost all of computer science is concerned with transformations of information in the form of strings. We initiate the study of a neglected transformation type, namely transformations between probability distributions. We begin by examining the ...

Let e v ( n ) denote the number of occurrences of a fixed pattern v in the binary expansion of n ∈ N. In this paper we study monochromatic arithmetic progressions in the class of binary words ( e v ( n ) mod 2 ) n ≥ 0, which includes the famous ...

In 2023, Zhang et al. proposed a novel diagnostic parameter, namely the cyclic diagnosability and explored the cyclic diagnosability of Q n. In this paper, the cyclic diagnosability of B H n is determined under the PMC model and the M M ⁎ model.

In this paper, we present lower bounds and algorithmic constructions of union-intersection-bounded families of sets. The lower bound is established using the Lovász Local Lemma. This bound matches the best known bound for the size of union-...

Online social networks have emerged as pivotal platforms where users not only interact but also influence each other's decisions and preferences. As these networks grow in complexity, understanding and leveraging influence dynamics within ...

We introduce the γ-clustering problems, which are variants of the well-known Cluster Editing/Deletion/Completion problems, and defined as: given a graph G, how many edges must be edited in G, deleted from G, or added to G in order to have a ...