Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments

Constructing key-agreement protocols in the random oracle model (ROM) is a viable method to assess the feasibility of developing public-key cryptography within Minicrypt. Unfortunately, as shown by Impagliazzo and Rudich (STOC 1989) and Barak and Mahmoody (Crypto 2009), such protocols can only guarantee limited security: any $\ell$-query protocol can be attacked by an $O(\ell^2)$-query adversary. This quadratic gap matches the key-agreement protocol proposed by Merkle (CACM 78), known as Merkle\u27s Puzzles. Besides query complexity, the communication complexity of key-agreement protocols in the ROM is also an interesting question in the realm of find-grained cryptography, even though only limited security is achievable. Haitner et al. (ITCS 2019) first observed that in Merkle\u27s Puzzles, to obtain secrecy against an eavesdropper with $O(\ell^2)$ queries, the honest parties must exchange $\Omega(\ell)$ bits. Therefore, they conjectured that high communication complexity is unavoidable, i.e., any $\ell$-query protocols with $c$ bits of communication could be attacked by an $O(c\cdot \ell)$-query adversary. This, if true, will suggest that Merkle\u27s Puzzle is also optimal regarding communication complexity. Building upon techniques from communication complexity, Haitner et al. (ITCS 2019) confirmed this conjecture for two types of key agreement protocols with certain natural properties. This work affirms the above conjecture for all non-adaptive protocols with perfect completeness. Our proof uses a novel idea called density increment argument. This method could be of independent interest as it differs from previous communication lower bounds techniques (and bypasses some technical barriers)

Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort

Alon et al. (CRYPTO 2021) introduced a multiparty quantum computation protocol that is secure with identifiable abort (MPQC-SWIA). However, their protocol allows only inside MPQC parties to know the identity of malicious players. This becomes problematic when two groups of people disagree and need a third party, like a jury, to verify who the malicious party is. This issue takes on heightened significance in the quantum setting, given that quantum states may exist in only a single copy. Thus, we emphasize the necessity of a protocol with publicly verifiable identifiable abort (PVIA), enabling outside observers with only classical computational power to agree on the identity of the malicious party in case of an abort. However, achieving MPQC with PVIA poses significant challenges due to the no-cloning theorem, and previous works proposed by Mahadev (STOC 2018) and Chung et al. (Eurocrypt 2022) for classical verification of quantum computation fall short. In this paper, we obtain the first MPQC-PVIA protocol assuming post-quantum oblivious transfer and a classical broadcast channel. The core component of our construction is a new authentication primitive called auditable quantum authentication (AQA) that identifies the malicious sender with overwhelming probability. Additionally, we provide the first MPQC protocol with best-of-both-worlds (BoBW) security, which guarantees output delivery with an honest majority and remains secure with abort even if the majority is dishonest. Our best-of-both-worlds MPQC protocol also satisfies PVIA upon abort

Reliable knowledge graph fact prediction via reinforcement learning

Abstract Knowledge graph (KG) fact prediction aims to complete a KG by determining the truthfulness of predicted triples. Reinforcement learning (RL)-based approaches have been widely used for fact prediction. However, the existing approaches largely suffer from unreliable calculations on rule confidences owing to a limited number of obtained reasoning paths, thereby resulting in unreliable decisions on prediction triples. Hence, we propose a new RL-based approach named EvoPath in this study. EvoPath features a new reward mechanism based on entity heterogeneity, facilitating an agent to obtain effective reasoning paths during random walks. EvoPath also incorporates a new postwalking mechanism to leverage easily overlooked but valuable reasoning paths during RL. Both mechanisms provide sufficient reasoning paths to facilitate the reliable calculations of rule confidences, enabling EvoPath to make precise judgments about the truthfulness of prediction triples. Experiments demonstrate that EvoPath can achieve more accurate fact predictions than existing approaches

Auxin efflux carrier ZmPIN1a modulates auxin reallocation involved in nitrate-mediated root formation

Abstract Background Auxin plays a crucial role in nitrate (NO3 –)-mediated root architecture, and it is still unclear that if NO3 – supply modulates auxin reallocation for regulating root formation in maize (Zea mays L.). This study was conducted to investigate the role of auxin efflux carrier ZmPIN1a in the root formation in response to NO3 – supply. Results Low NO3 – (LN) promoted primary root (PR) elongation, while repressed the development of lateral root primordia (LRP) and total root length. LN modulated auxin levels and polar transport and regulated the expression of auxin-responsive and -signaling genes in roots. Moreover, LN up-regulated the expression level of ZmPIN1a, and overexpression of ZmPIN1a enhanced IAA efflux and accumulation in PR tip, while repressed IAA accumulation in LRP initiation zone, which consequently induced LN-mediated PR elongation and LR inhibition. The inhibition rate of PR length, LRP density and number of ZmPIN1a-OE plants was higher than that of wild-type plants after auxin transport inhibitor NPA treatment under NN and LN conditions, and the degree of inhibition of root growth in ZmPIN1a-OE plants was more obvious under LN condition. Conclusion These findings suggest that ZmPIN1a was involved in modulating auxin levels and transport to alter NO3 –-mediated root formation in maize

Genome-wide association analysis identifies three new risk loci for gout arthritis in Han Chinese

Gout is one of the most common types of inflammatory arthritis, caused by the deposition of monosodium urate crystals in and around the joints. Previous genome-wide association studies (GWASs) have identified many genetic loci associated with raised serum urate concentrations. However, hyperuricemia alone is not sufficient for the development of gout arthritis. Here we conduct a multistage GWAS in Han Chinese using 4,275 male gout patients and 6,272 normal male controls (1,255 cases and 1,848 controls were genome-wide genotyped), with an additional 1,644 hyperuricemic controls. We discover three new risk loci, 17q23.2 (rs11653176, P=1.36 × 10(-13), BCAS3), 9p24.2 (rs12236871, P=1.48 × 10(-10), RFX3) and 11p15.5 (rs179785, P=1.28 × 10(-8), KCNQ1), which contain inflammatory candidate genes. Our results suggest that these loci are most likely related to the progression from hyperuricemia to inflammatory gout, which will provide new insights into the pathogenesis of gout arthritis