{"title":"Derandomization of quantum algorithm for triangle finding","authors":"Guanzhong Li , Lvzhou Li","doi":"10.1016/j.ic.2025.105295","DOIUrl":"10.1016/j.ic.2025.105295","url":null,"abstract":"<div><div>Derandomization is the process of taking a randomized algorithm and turning it into a deterministic algorithm, which has attracted great attention in classical computing. In quantum computing, it is challenging and intriguing to derandomize quantum algorithms, due to the inherent randomness of quantum mechanics. The significance of derandomizing quantum algorithms lies not only in theoretically proving that the success probability can essentially be 1 without sacrificing quantum speedups, but also in experimentally improving the success rate when the algorithm is implemented on a real quantum computer.</div><div>In this paper, we focus on derandomizing quantum algorithms for the triangle sum problem (including the famous triangle finding problem as a special case), which asks to find a triangle in an edge-weighted graph with <em>n</em> vertices, such that its edges sum up to a given weight. We show that when the graph is promised to contain at most one target triangle, there exists a deterministic quantum algorithm that either finds the triangle if it exists or outputs “no triangle” if none exists. It makes <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>9</mn><mo>/</mo><mn>7</mn></mrow></msup><mo>)</mo></math></span> queries to the edge weight matrix oracle, and thus has the same complexity as the state-of-the-art bounded-error quantum algorithm. To achieve this derandomization, we make full use of several techniques: nested quantum walk with quantum data structure, deterministic quantum search with adjustable parameters, and dimensional reduction of quantum walk search on Johnson graph.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105295"},"PeriodicalIF":0.8,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Duncan Adamson , Nathan Flaherty , Igor Potapov , Paul G. Spirakis
{"title":"Collision-free Robot Scheduling","authors":"Duncan Adamson , Nathan Flaherty , Igor Potapov , Paul G. Spirakis","doi":"10.1016/j.ic.2025.105294","DOIUrl":"10.1016/j.ic.2025.105294","url":null,"abstract":"<div><div>In this paper, we investigate the problem of designing <em>schedules</em> for completing a set of tasks at fixed locations with multiple robots in a laboratory. We represent the laboratory as a graph with tasks placed on fixed vertices and robots represented as agents, with the constraint that no two robots may occupy the same vertex at any given timestep. Each schedule is partitioned into a set of timesteps, corresponding to a walk through the graph (allowing for a robot to wait at a vertex to complete a task), with each timestep taking time equal to the time for a robot to move from one vertex to another and each task taking some given number of timesteps during the completion of which a robot must stay at the vertex containing the task. The goal is to determine a set of schedules, with one schedule for each robot, minimising the number of timesteps taken by the schedule taking the greatest number of timesteps within the set of schedules. We show that this problem is NP-complete for both star graphs (for <span><math><mi>k</mi><mo>≥</mo><mn>2</mn></math></span> robots), and planar graphs (for any number of robots). Finally, we provide positive results for path, cycle, and tadpole graphs, showing that we can find an optimal set of schedules for <em>k</em> robots completing <em>m</em> tasks of equal duration of a path of length <em>n</em> in <span><math><mi>O</mi><mo>(</mo><mi>k</mi><mi>m</mi><mi>n</mi><mo>)</mo></math></span>, <span><math><mi>O</mi><mo>(</mo><mi>k</mi><mi>m</mi><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> time, and <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>3</mn></mrow></msup><msup><mrow><mi>m</mi></mrow><mrow><mn>4</mn></mrow></msup><mi>n</mi><mo>)</mo></math></span> time respectively.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105294"},"PeriodicalIF":0.8,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A dichotomy result for countably based sober spaces","authors":"Hualin Miao , Qingguo Li","doi":"10.1016/j.ic.2025.105293","DOIUrl":"10.1016/j.ic.2025.105293","url":null,"abstract":"<div><div>Cartesian closed categories have been playing fundamental roles in providing denotational semantic for higher-order programming languages. In this paper we try to identify Cartesian closed subcategories of the category <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span> of pointed countably based sober spaces, and we present a conclusion known as the dichotomy result in the category <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span>. This result explains that any Cartesian closed full subcategory of <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span> is contained within either the category of weakly compact open connected spaces or that of principally connected spaces.</div><div>To prove our dichotomy theorem, we first deduce that every pointed countably based sober space <em>X</em> is locally connected, if the space of all continuous functions from <em>X</em> to <em>X</em> is locally compact. Next, we demonstrate that a function space in <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span> is locally connected only if its input space is either weakly compact open connected or its output space is principally connected.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105293"},"PeriodicalIF":0.8,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A multivariate convertible undeniable signature scheme","authors":"Satyam Omar , Sahadeo Padhye , Dhananjoy Dey , Devansh Mehrotra","doi":"10.1016/j.ic.2025.105286","DOIUrl":"10.1016/j.ic.2025.105286","url":null,"abstract":"<div><div>Digital signature is an important cryptographic primitive which can be universally verified. However, this universal verifiability can be ominous in case of e-auction, e-voting, and e-cash, where the verifiability must be restricted. Undeniable signature is a type of digital signature that is mainly used to achieve the goal of access control. In this article, we propose the first multivariate-based quantum secure undeniable signature scheme, which can also be converted into an ordinary signature. The security of this scheme relies on the hardness of multivariate quadratic problem which is computationally hard to solve when defined over any finite field. We deploy Monteiro et al.'s improvement on Sakumoto et al.'s zero-knowledge protocol for the verification process. We discuss the security properties of undeniable signature, viz., completeness, soundness, unforgeability, invisibility, and non-impersonation. Additionally, we show that the proposed undeniable signature has the smallest signature and key sizes among all the existing quantum-resistant undeniable signatures.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105286"},"PeriodicalIF":0.8,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143510074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Identity based proxy blind signature scheme using NTRU lattices","authors":"Sonika Singh , Swati Rawal , Sahadeo Padhye , Namita Tiwari","doi":"10.1016/j.ic.2025.105284","DOIUrl":"10.1016/j.ic.2025.105284","url":null,"abstract":"<div><div>Proxy blind signatures represent a specific type of blind signature that allows a proxy signer to sign documents on behalf of the original signer without having access to the content they are signing. Currently, most of the existing proxy blind signature schemes rely on complex number-theoretic hard problems like bilinear pairing and the discrete logarithm problem or on general lattices' hardness. Unfortunately, the security of number-theoretic hard problems-based systems is struggling due to vulnerability to Shor's algorithm, which jeopardizes the security of cryptographic schemes based on them, and general lattices suffer from large key sizes. Thus, we are looking for a new scheme that is efficient in time and storage, has short key and signature sizes, and is crucially secure against threats posed by quantum computers. Recently, NTRU lattice-based schemes have gained significant popularity due to their ease of implementation and proven security reductions. In 2018, Zhu et al. presented an identity-based proxy blind signature scheme over NTRU lattices, which is not secure. Therefore, by explaining the security breach of Zhu et al.'s scheme, we present a novel, secure, and improved identity-based proxy blind signature system resistant to quantum threats and utilizing NTRU lattices. Based on the standard hardness assumptions related to the approximate shortest vector problem (<em>γ</em>-SVP) and the shortest integer solution problem (SIS), it is demonstrated that the proposed method is secure against quantum forgery.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105284"},"PeriodicalIF":0.8,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143488796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mugurel Barcau , Vicenţiu Paşol , George C. Ţurcaş
{"title":"Composing bridges","authors":"Mugurel Barcau , Vicenţiu Paşol , George C. Ţurcaş","doi":"10.1016/j.ic.2025.105285","DOIUrl":"10.1016/j.ic.2025.105285","url":null,"abstract":"<div><div>The present work builds on previous investigations of the authors (and their collaborators) regarding bridges, a certain type of morphisms between encryption schemes, making a step forward in developing a (category theory) language for studying relations between encryption schemes. Here we analyse the conditions under which bridges can be performed sequentially, formalizing the notion of composability. One of our results gives a sufficient condition for a pair of bridges to be composable. We illustrate that composing two bridges, each independently satisfying a previously established IND-CPA security definition, can actually lead to an insecure bridge. Our main result gives a sufficient condition that a pair of secure composable bridges should satisfy in order for their composition to be a secure bridge. We also introduce the concept of a <em>complete</em> bridge and show that it is connected to the notion of Fully composable Homomorphic Encryption (FcHE), recently considered by Micciancio. Moreover, we show that a result of Micciancio which gives a construction of FcHE schemes can be phrased in the language of complete bridges, where his insights can be formalized in a greater generality.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105285"},"PeriodicalIF":0.8,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143510073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computing maximal palindromes in non-standard matching models","authors":"Takuya Mieno , Mitsuru Funakoshi , Yuto Nakashima , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda","doi":"10.1016/j.ic.2025.105283","DOIUrl":"10.1016/j.ic.2025.105283","url":null,"abstract":"<div><div><em>Palindromes</em> are popular and important objects in textual data processing, bioinformatics, and combinatorics on words. Let <span><math><mi>S</mi><mo>=</mo><mi>X</mi><mi>a</mi><mi>Y</mi></math></span> be a string where <em>X</em> and <em>Y</em> are of the same length, and <em>a</em> is either a single character or the empty string. Then, there exist two alternative definitions for palindromes: <em>S</em> is said to be a palindrome if <em>S</em> is equal to its reversal <span><math><msup><mrow><mi>S</mi></mrow><mrow><mi>R</mi></mrow></msup></math></span> (Reversal-based definition); or if its right-arm <em>Y</em> is equal to the reversal of its left-arm <span><math><msup><mrow><mi>X</mi></mrow><mrow><mi>R</mi></mrow></msup></math></span> (Symmetry-based definition). It is clear that if the “equality” (≈) used in both definitions is exact character matching (=), then the two definitions are the same. However, if we apply other string-equality criteria ≈, including the <em>complementary-matching model</em> for biological sequences, the <em>Cartesian-tree model</em> [Park et al., TCS 2020], the <em>parameterized model</em> [Baker, JCSS 1996], the <em>order-preserving model</em> [Kim et al., TCS 2014], and the <em>palindromic-structure model</em> [I et al., TCS 2013], then are the reversal-based palindromes and the symmetry-based palindromes the same? To the best of our knowledge, no previous work has considered or answered this natural question. In this paper, we first provide answers to this question, and then present efficient algorithms for computing all <em>maximal palindromes under the non-standard matching models</em> in a given string. After confirming that Gusfield's offline suffix-tree-based algorithm for computing maximal symmetry-based palindromes can be readily extended to the aforementioned matching models, we show how to extend Manacher's online algorithm for computing maximal reversal-based palindromes in linear time for all the aforementioned matching models.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105283"},"PeriodicalIF":0.8,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143444719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond","authors":"Yasuaki Kobayashi , Kazuhiro Kurita , Kunihiro Wasa","doi":"10.1016/j.ic.2025.105282","DOIUrl":"10.1016/j.ic.2025.105282","url":null,"abstract":"<div><div>Finding a <em>maximum</em> cardinality common independent set in two matroids (also known as <span>Matroid Intersection</span>) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum bipartite matching, a maximum colorful forest, and an arborescence in directed graphs. Enumerating all <em>maximal</em> common independent sets in two (or more) matroids is a classical enumeration problem. In this paper, we address an “intersection” of these problems: Given two matroids and a threshold <em>τ</em>, the goal is to enumerate all maximal common independent sets in the matroids with cardinality at least <em>τ</em>. We show that this problem can be solved in polynomial delay and polynomial space. Moreover, our technique can be extended to a more general problem, which is relevant to <span>Matroid Matching</span>. We give a polynomial-delay and polynomial-space algorithm for enumerating all maximal “matchings” with cardinality at least <em>τ</em>, assuming that the optimization counterpart is “tractable” in a certain sense. This extension allows us to enumerate small minimal connected vertex covers in subcubic graphs. We also discuss a framework to convert enumeration with cardinality constraints into ranked enumeration.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105282"},"PeriodicalIF":0.8,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Homogeneous spiking neural P systems with synaptic failure","authors":"Luping Zhang , Tingfang Wu","doi":"10.1016/j.ic.2025.105281","DOIUrl":"10.1016/j.ic.2025.105281","url":null,"abstract":"<div><div>Spiking neural P (SN P) systems are a class of neural-like computational models, inspired by the way biological neurons process information through electrical impulses known as spikes. Homogeneous spiking neural P (HSN P) systems are a specialized variant of SN P systems, where all neurons share the same set of rules. In this work, with the biological inspiration that excessive synaptic transmission can lead to short-term failures in signal delivery between neurons in neural systems, the notion of synaptic failure is considered in HSN P systems, termed HSN P systems with synaptic failure (HSNPSF systems). Specifically, synaptic failure is referred to a family of sets of failure-prone synapses: if spikes simultaneously pass along all the synapses in such a set, the transmitted spikes across the synapses are suppressed; if a synapse in the set does not transmit any spike, the spikes pass along the synapses at that time, ultimately reaching the destination neurons. The computational power of HSNPSF systems is investigated by proving that they can achieve computational completeness both in generating and accepting modes. Furthermore, the computational efficiency of HSNPSF systems is examined, and it is demonstrated that with the help of non-deterministic feature, these systems are capable of solving <strong>NP</strong>-complete (the Subset Sum) problem in a semi-uniform way and within constant time.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105281"},"PeriodicalIF":0.8,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143420489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kevin Buchin , Paola Flocchini , Irina Kostitsyna , Tom Peters , Nicola Santoro , Koichi Wada
{"title":"On the computational power of energy-constrained mobile robots","authors":"Kevin Buchin , Paola Flocchini , Irina Kostitsyna , Tom Peters , Nicola Santoro , Koichi Wada","doi":"10.1016/j.ic.2025.105280","DOIUrl":"10.1016/j.ic.2025.105280","url":null,"abstract":"<div><div>We consider distributed systems of autonomous robots operating in the plane under synchronous <em>Look</em>-<em>Compute</em>-<em>Move</em> (<em>LCM</em>) cycles. Prior research on four distinct models assumes robots have unlimited energy. We remove this assumption and investigate systems where robots have limited but renewable energy, requiring inactivity for energy restoration.</div><div>We analyze the computational impact of this constraint, fully characterizing the relationship between energy-restricted and unrestricted robots. Surprisingly, we show that energy constraints can enhance computational power.</div><div>Additionally, we study how memory persistence and communication capabilities influence computation under energy constraints. By comparing the four models in this setting, we establish a complete characterization of their computational relationships.</div><div>A key insight is that energy-limited robots can be modeled as unlimited-energy robots controlled by an adversarial activation scheduler. This provides a novel equivalence framework for analyzing energy-constrained distributed systems.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105280"},"PeriodicalIF":0.8,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}