Privacy-aware and security-enhanced efficient matchmaking encryption
Data sharing technologies enable users to outsource data and privately share information
with arbitrary recipients without geographic barriers. However, existing efforts for secure …
with arbitrary recipients without geographic barriers. However, existing efforts for secure …
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More
In this paper we carefully combine Fredman's trick [SICOMP'76] and Matoušek's approach
for dominance product [IPL'91] to obtain powerful results in fine-grained complexity. Under …
for dominance product [IPL'91] to obtain powerful results in fine-grained complexity. Under …
k-SUM in the Sparse Regime: Complexity and Applications
In the average-case k-SUM problem, given r integers chosen uniformly at random from {0,⋯,
M-1}, the objective is to find a “solution” set of k numbers that sum to 0 modulo M. In the …
M-1}, the objective is to find a “solution” set of k numbers that sum to 0 modulo M. In the …
New techniques for proving fine-grained average-case hardness
The recent emergence of fine-grained cryptography strongly motivates develo** an
average-case analogue of Fine-Grained Complexity (FGC). Prior work [Goldreich-Rothblum …
average-case analogue of Fine-Grained Complexity (FGC). Prior work [Goldreich-Rothblum …
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity
Let MK t P [s] be the set of strings x such that K t (x)≤ s (| x|), where K t (x) denotes the t-
bounded Kolmogorov complexity of the truthtable described by x. Our main theorem shows …
bounded Kolmogorov complexity of the truthtable described by x. Our main theorem shows …
The fine-grained complexity of CFL reachability
Many problems in static program analysis can be modeled as the context-free language
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …
Fine-Grained Non-interactive Key-Exchange Without Idealized Assumptions
Y Wang, C Su, J Pan - Annual International Cryptology Conference, 2024 - Springer
In this paper, we study multi-party non-interactive key exchange (NIKE) in the fine-grained
setting. More precisely, we propose three multi-party NIKE schemes in three computation …
setting. More precisely, we propose three multi-party NIKE schemes in three computation …
Dynamic Dynamic Time War**
Abstract The Dynamic Time War** (DTW) distance is a popular similarity measure for
polygonal curves (ie, sequences of points). It finds many theoretical and practical …
polygonal curves (ie, sequences of points). It finds many theoretical and practical …
Worst-case to average-case reductions via additive combinatorics
We present a new framework for designing worst-case to average-case reductions. For a
large class of problems, it provides an explicit transformation of algorithms running in time T …
large class of problems, it provides an explicit transformation of algorithms running in time T …
Improved Merlin–Arthur protocols for central problems in fine-grained complexity
Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from
Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The …
Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The …