More Like this

1. An Efficient ZK Compiler from SIMD Circuits to General Circuits

   https://doi.org/10.1007/s00145-024-09531-4  

   Bui, Dung; Chu, Haotian; Couteau, Geoffroy; Wang, Xiao; Weng, Chenkai; Yang, Kang; Yu, Yu (January 2025, Journal of Cryptology)

   Abstract We propose a generic compiler that can convert any zero-knowledge (ZK) proof for SIMD circuits to general circuits efficiently, and an extension that can preserve the space complexity of the proof systems. Our compiler can immediately produce new results improving upon state of the art.By plugging in our compiler to Antman, an interactive sublinear-communication protocol, we improve the overall communication complexity for general circuits from$$\mathcal {O}(C^{3/4})$$ $O\left(C^{3/4}\right)$to$$\mathcal {O}(C^{1/2})$$ $O\left(C^{1/2}\right)$. Our implementation shows that for a circuit of size$$2^{27}$$ $2^{27}$, it achieves up to$$83.6\times $$ $83.6\times$improvement on communication compared to the state-of-the-art implementation. Its end-to-end running time is at least$$70\%$$ $70\%$faster in a 10Mbps network.Using the recent results on compressed$$\varSigma $$ $\Sigma$-protocol theory, we obtain a discrete-log-based constant-round zero-knowledge argument with$$\mathcal {O}(C^{1/2})$$ $O\left(C^{1/2}\right)$communication and common random string length, improving over the state of the art that has linear-size common random string and requires heavier computation.We improve the communication of a designatedn-verifier zero-knowledge proof from$$\mathcal {O}(nC/B+n^2B^2)$$ $O(nC/B+n^2{B}^2)$to$$\mathcal {O}(nC/B+n^2)$$ $O(nC/B+n^2)$.To demonstrate the scalability of our compilers, we were able to extract a commit-and-prove SIMD ZK from Ligero and cast it in our framework. We also give one instantiation derived from LegoSNARK, demonstrating that the idea of CP-SNARK also fits in our methodology. 

   more » « less
2. Online Paging with Heterogeneous Cache Slots

   https://doi.org/10.1007/s00453-024-01270-z  

   Chrobak, Marek; Haney, Samuel; Liaee, Mehraneh; Panigrahi, Debmalya; Rajaraman, Rajmohan; Sundaram, Ravi; Young, Neal_E (October 2024, Algorithmica)

   Abstract It is natural to generalize the online$$k$$ $k$-Server problem by allowing each request to specify not only a pointp, but also a subsetSof servers that may serve it. To date, only a few special cases of this problem have been studied. The objective of the work presented in this paper has been to more systematically explore this generalization in the case of uniform and star metrics. For uniform metrics, the problem is equivalent to a generalization of Paging in which each request specifies not only a pagep, but also a subsetSof cache slots, and is satisfied by having a copy ofpin some slot inS. We call this problemSlot-Heterogenous Paging. In realistic settings only certain subsets of cache slots or servers would appear in requests. Therefore we parameterize the problem by specifying a family$${\mathcal {S}}\subseteq 2^{[k]}$$ $S\subseteq 2^{\left[k\right]}$of requestable slot sets, and we establish bounds on the competitive ratio as a function of the cache sizekand family$${\mathcal {S}}$$ $S$:If all request sets are allowed ($${\mathcal {S}}=2^{[k]}\setminus \{\emptyset \}$$ $S=2^{\left[k\right]}\backslash \left\{\varnothing \right\}$), the optimal deterministic and randomized competitive ratios are exponentially worse than for standard Paging ($${\mathcal {S}}=\{[k]\}$$ $S=\left\{\right[k\left]\right\}$).As a function of$$|{\mathcal {S}}|$$ $\left|S\right|$andk, the optimal deterministic ratio is polynomial: at most$$O(k^2|{\mathcal {S}}|)$$ $O\left(k^2\right|S\left|\right)$and at least$$\Omega (\sqrt{|{\mathcal {S}}|})$$ $\Omega \left(\sqrt{\left|S\right|}\right)$.For any laminar family$${\mathcal {S}}$$ $S$of heighth, the optimal ratios areO(hk) (deterministic) and$$O(h^2\log k)$$ $O(h^{2}logk)$(randomized).The special case of laminar$${\mathcal {S}}$$ $S$that we callAll-or-One Pagingextends standard Paging by allowing each request to specify a specific slot to put the requested page in. The optimal deterministic ratio forweightedAll-or-One Paging is$$\Theta (k)$$ $\Theta \left(k\right)$. Offline All-or-One Paging is$$\mathbb{N}\mathbb{P}$$ $NP$-hard.Some results for the laminar case are shown via a reduction to the generalization of Paging in which each request specifies a set$$P$$ $P$ofpages, and is satisfied by fetching any page from$$P$$ $P$into the cache. The optimal ratios for the latter problem (with laminar family of heighth) are at mosthk(deterministic) and$$hH_k$$ $h{H}_k$(randomized). 

   more » « less
3. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

   https://doi.org/10.1007/s00224-022-10106-8  

   Vyas, Nikhil; Williams, R_Ryan (November 2022, Theory of Computing Systems)

   Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in$$\mathsf {Quasi}\text {-}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$$ $\mathrm{Quasi}-\mathrm{NP}=\mathrm{NTIME}\left[n^{{\left(\log n\right)}^{O\left(1\right)}}\right]$and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$$\mathcal { C}$$ $C$, by showing that$$\mathcal { C}$$ $C$admits non-trivial satisfiability and/or#SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a non-trivial#SAT algorithm for a circuit class$${\mathcal C}$$ $C$. Say that a symmetric Boolean functionf(x₁,…,x_n) issparseif it outputs 1 onO(1) values of$${\sum }_{i} x_{i}$$ ${\sum }_i{x}_i$. We show that for every sparsef, and for all “typical”$$\mathcal { C}$$ $C$, faster#SAT algorithms for$$\mathcal { C}$$ $C$circuits imply lower bounds against the circuit class$$f \circ \mathcal { C}$$ $f\circ C$, which may bestrongerthan$$\mathcal { C}$$ $C$itself. In particular:#SAT algorithms forn^k-size$$\mathcal { C}$$ $C$-circuits running in 2ⁿ/n^ktime (for allk) implyNEXPdoes not have$$(f \circ \mathcal { C})$$ $(f\circ C)$-circuits of polynomial size.#SAT algorithms for$$2^{n^{{\varepsilon }}}$$ $2^{n^{\epsilon }}$-size$$\mathcal { C}$$ $C$-circuits running in$$2^{n-n^{{\varepsilon }}}$$ $2^{n-n^{\epsilon }}$time (for someε> 0) implyQuasi-NPdoes not have$$(f \circ \mathcal { C})$$ $(f\circ C)$-circuits of polynomial size. Applying#SAT algorithms from the literature, one immediate corollary of our results is thatQuasi-NPdoes not haveEMAJ∘ACC⁰∘THRcircuits of polynomial size, whereEMAJis the “exact majority” function, improving previous lower bounds againstACC⁰[Williams JACM’14] andACC⁰∘THR[Williams STOC’14], [Murray-Williams STOC’18]. This is the first nontrivial lower bound against such a circuit class. 

   more » « less
4. Search for leptoquark pair production decaying into $$te^- \bar{t}e^+$$ or $$t\mu ^- \bar{t}\mu ^+$$ in multi-lepton final states in pp collisions at $$\sqrt{s} = 13\,\textrm{TeV}$$ with the ATLAS detector

   https://doi.org/10.1140/epjc/s10052-024-12975-4  

   Aad, G; Abbott, B; Abbott, D C; Abeling, K; Abidi, S H; Aboulhorma, A; Abramowicz, H; Abreu, H; Abulaiti, Y; Hoffman, A_C Abusleme; et al (August 2024, The European Physical Journal C)

   Abstract A search for leptoquark pair production decaying into$$te^- \bar{t}e^+$$ $t{e}^{-}\overline{t}{e}^{+}$or$$t\mu ^- \bar{t}\mu ^+$$ $t{\mu }^{-}\overline{t}{\mu }^{+}$in final states with multiple leptons is presented. The search is based on a dataset ofppcollisions at$$\sqrt{s}=13~\text {TeV} $$ $\sqrt{s}=13\text{TeV}$recorded with the ATLAS detector during Run 2 of the Large Hadron Collider, corresponding to an integrated luminosity of 139 fb$$^{-1}$$ $_{}^{-1}$. Four signal regions, with the requirement of at least three light leptons (electron or muon) and at least two jets out of which at least one jet is identified as coming from ab-hadron, are considered based on the number of leptons of a given flavour. The main background processes are estimated using dedicated control regions in a simultaneous fit with the signal regions to data. No excess above the Standard Model background prediction is observed and 95% confidence level limits on the production cross section times branching ratio are derived as a function of the leptoquark mass. Under the assumption of exclusive decays into$$te^{-}$$ $t{e}^{-}$($$t\mu ^{-}$$ $t{\mu }^{-}$), the corresponding lower limit on the scalar mixed-generation leptoquark mass$$m_{\textrm{LQ}_{\textrm{mix}}^{\textrm{d}}}$$ $m_{{\text{LQ}}_{\text{mix}}^{\text{d}}}$is at 1.58 (1.59) TeV and on the vector leptoquark mass$$m_{{\tilde{U}}_1}$$ $m_{{\tilde{U}}_1}$at 1.67 (1.67) TeV in the minimal coupling scenario and at 1.95 (1.95) TeV in the Yang–Mills scenario. 

   more » « less
5. Search for CP violation in $${{{\textrm{D}}}^{{0}}} \rightarrow {{\textrm{K}} _{\text {S}}^{{0}}} {{\textrm{K}} _{\text {S}}^{{0}}} $$ decays in proton–proton collisions at $$\sqrt{s} = 13\,\text {Te}\hspace{-.08em}\text {V} $$

   https://doi.org/10.1140/epjc/s10052-024-13244-0  

   Hayrapetyan, A; Tumasyan, A; Adam, W; Andrejkovic, J W; Bergauer, T; Chatterjee, S; Damanakis, K; Dragicevic, M; Hussain, P S; Jeitler, M; et al (December 2024, The European Physical Journal C)

   Abstract A search is reported for charge-parity$$CP$$ $\mathrm{CP}$violation in$${{{\textrm{D}}}^{{0}}} \rightarrow {{\textrm{K}} _{\text {S}}^{{0}}} {{\textrm{K}} _{\text {S}}^{{0}}} $$ ${\text{D}}^0\to {\text{K}}_{\text{S}}^0{\text{K}}_{\text{S}}^0$decays, using data collected in proton–proton collisions at$$\sqrt{s} = 13\,\text {Te}\hspace{-.08em}\text {V} $$ $\sqrt{s}=13\text{Te}\text{V}$recorded by the CMS experiment in 2018. The analysis uses a dedicated data set that corresponds to an integrated luminosity of 41.6$$\,\text {fb}^{-1}$$ ${\text{fb}}^{-1}$, which consists of about 10 billion events containing a pair of b hadrons, nearly all of which decay to charm hadrons. The flavor of the neutral D meson is determined by the pion charge in the reconstructed decays$${{{\textrm{D}}}^{{*+}}} \rightarrow {{{\textrm{D}}}^{{0}}} {{{\mathrm{\uppi }}}^{{+}}} $$ $\text{D}_{}^{\ast +}\to {\text{D}}^0{\pi }^{+}$and$${{{\textrm{D}}}^{{*-}}} \rightarrow {\overline{{\textrm{D}}}^{{0}}} {{{\mathrm{\uppi }}}^{{-}}} $$ $\text{D}_{}^{\ast -}\to {\overline{\text{D}}}^0{\pi }^{-}$. The$$CP$$ $\mathrm{CP}$asymmetry in$${{{\textrm{D}}}^{{0}}} \rightarrow {{\textrm{K}} _{\text {S}}^{{0}}} {{\textrm{K}} _{\text {S}}^{{0}}} $$ ${\text{D}}^0\to {\text{K}}_{\text{S}}^0{\text{K}}_{\text{S}}^0$is measured to be$$A_{CP} ({{\textrm{K}} _{\text {S}}^{{0}}} {{\textrm{K}} _{\text {S}}^{{0}}} ) = (6.2 \pm 3.0 \pm 0.2 \pm 0.8)\%$$ $A_{\mathrm{CP}}\left({\text{K}}_{\text{S}}^0{\text{K}}_{\text{S}}^0\right)=(6.2\pm 3.0\pm 0.2\pm 0.8)\%$, where the three uncertainties represent the statistical uncertainty, the systematic uncertainty, and the uncertainty in the measurement of the$$CP$$ $\mathrm{CP}$asymmetry in the$${{{\textrm{D}}}^{{0}}} \rightarrow {{\textrm{K}} _{\text {S}}^{{0}}} {{{\mathrm{\uppi }}}^{{+}}} {{{\mathrm{\uppi }}}^{{-}}} $$ ${\text{D}}^0\to {\text{K}}_{\text{S}}^0{\pi }^{+}{\pi }^{-}$decay. This is the first$$CP$$ $\mathrm{CP}$asymmetry measurement by CMS in the charm sector as well as the first to utilize a fully hadronic final state. 

   more » « less