Search
Search Results
-
Must the Communication Graph of MPC Protocols be an Expander?
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) where a partial network is...
-
Explicit Non-malleable Codes from Bipartite Graphs
Non-malleable codes are introduced to protect the communication against adversarial tampering of data, as a relaxation of the error-correcting codes...
-
Testing Higher-Order Clusterability on Graphs
Analysis of higher-order organizations, usually small connected subgraphs called motifs, is a fundamental task on complex networks. This paper...
-
Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN
The recent development of pseudorandom correlation generators (PCG) holds tremendous promise for highly efficient MPC protocols. Among other...
-
Deterministic near-optimal distributed listing of cliques
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has...
-
Graphs in the Bounded-Degree Model
In this chapter, we study testing properties of graphs in the bounded-degree model. This model is parameterized by an integer...
-
-
Leader Election in Well-Connected Graphs
In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message...
-
New Constructions of Collapsing Hashes
Collapsing is a post-quantum strengthening of collision resistance, needed to lift many classical results to the quantum setting. Unfortunately, the...
-
Accelerated Information Dissemination on Networks with Local and Global Edges
Bootstrap percolation is a classical model for the spread of information in a network. In the round-based version, nodes of an undirected graph...
-
Cayley sum graphs and their applications to codebooks
In this paper we first provide two new constructions for Cayley sum graphs, namely, norm-coset graphs and trace-coset graphs, and determine their...
-
-
An Evolving Network Model from Clique Extension
We consider a new model for complex networks whose underlying mechanism is extending dense subgraphs. In the frustum model, we iteratively extend...
-
Zeros and approximations of Holant polynomials on the complex plane
We present fully polynomial time approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials ...
-
Majority opinion diffusion: when tie-breaking rule matters
Consider a graph G , which represents a social network, and assume that initially each node is either blue or white (corresponding to its opinion on a...
-
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time
We derandomize Valiant’s (J ACM 62, Article 13, 2015) subquadratic-time algorithm for finding outlier correlations in binary data. This demonstrates...
-
Séta: Supersingular Encryption from Torsion Attacks
We present Séta (To be pronounced [ʃe:tɒ] meaning “walk” in Hungarian.), a new family of public-key encryption schemes with post-quantum security...
-
Bridging a Small Gap in the Gap Amplification of Assignment Testers
Irit Dinur’s proof of the PCP theorem via gap amplification (J. ACM, Vol. 54 (3) and ECCC TR05-046) has an important extension to Assignment Testers...
-
Oblivious Tight Compaction In O(n) Time with Smaller Constant
Oblivious compaction is a crucial building block for hash-based oblivious RAM. Asharov et al. recently gave a O(n) algorithm for oblivious tight...