Information and Computation最新文献

{"title":"Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class","authors":"Fengrong Zhang ,&nbsp;Enes Pasalic ,&nbsp;Amar Bapić ,&nbsp;Baocang Wang","doi":"10.1016/j.ic.2024.105149","DOIUrl":"10.1016/j.ic.2024.105149","url":null,"abstract":"<div><p>We show that the direct sum, under more relaxed conditions compared to those of Polujan and Pott (2020), can generate bent functions provably outside the completed Maiorana-McFarland class (<span><math><msup><mrow><mi>MM</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>). We also show that the indirect sum method of generating bent functions, by imposing certain conditions (which are completely absent if only the bentness of the resulting function is required) on the initial bent functions, can be employed in the design of bent functions outside <span><math><msup><mrow><mi>MM</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>. Furthermore, applying this method to suitably chosen bent functions we construct several generic classes of homogeneous cubic bent functions (considered as a difficult problem) that might possess additional properties (namely without affine derivatives and/or outside <span><math><msup><mrow><mi>MM</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>). Our results significantly improve upon the best known instances of this type of bent functions given by Polujan and Pott (2020), and additionally we provide a solution to an open problem presented in their paper.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105149"},"PeriodicalIF":1.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139560114","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":"Approximating the directed path partition problem","authors":"Yong Chen ,&nbsp;Zhi-Zhong Chen ,&nbsp;Curtis Kennedy ,&nbsp;Guohui Lin ,&nbsp;Yao Xu ,&nbsp;An Zhang","doi":"10.1016/j.ic.2024.105150","DOIUrl":"10.1016/j.ic.2024.105150","url":null,"abstract":"<div><p>Given a digraph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span>, the <em>k</em>-path partition problem aims to find a minimum collection of vertex-disjoint directed paths, of order at most <em>k</em>, to cover all the vertices. The problem has various applications. Its special case on undirected graphs is NP-hard when <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>, and has received much study recently from the approximation algorithm perspective. However, the general problem on digraphs is seemingly untouched in the literature. We fill the gap with the first <span><math><mi>k</mi><mo>/</mo><mn>2</mn></math></span>-approximation algorithm, based on a novel concept of enlarging walk to minimize the number of singletons. Secondly, for <span><math><mi>k</mi><mo>=</mo><mn>3</mn></math></span>, we define a second novel kind of enlarging walks to greedily reduce the number of 2-paths in the 3-path partition and propose an improved 13/9-approximation algorithm. Lastly, for any <span><math><mi>k</mi><mo>≥</mo><mn>7</mn></math></span>, we present an improved <span><math><mo>(</mo><mi>k</mi><mo>+</mo><mn>2</mn><mo>)</mo><mo>/</mo><mn>3</mn></math></span>-approximation algorithm built on the maximum path-cycle cover followed by a careful 2-cycle elimination process.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105150"},"PeriodicalIF":1.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000154/pdfft?md5=0dde1df73fe58468b9370f19cea306f4&pid=1-s2.0-S0890540124000154-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139495707","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":"Projection theorems using effective dimension","authors":"Neil Lutz ,&nbsp;D.M. Stull","doi":"10.1016/j.ic.2024.105137","DOIUrl":"10.1016/j.ic.2024.105137","url":null,"abstract":"<div><p>In this paper we use the theory of computing to study fractal dimensions of projections in Euclidean spaces. A fundamental result in fractal geometry is Marstrand's projection theorem, which states that for every analytic set <em>E</em>, for almost every line <em>L</em>, the Hausdorff dimension of the orthogonal projection of <em>E</em> onto <em>L</em> is maximal.</p><p>We use Kolmogorov complexity to give two new results on the Hausdorff and packing dimensions of orthogonal projections onto lines. The first shows that the conclusion of Marstrand's theorem holds whenever the Hausdorff and packing dimensions agree on the set <em>E</em>, even if <em>E</em> is not analytic. Our second result gives a lower bound on the packing dimension of projections of arbitrary sets. Finally, we give a new proof of Marstrand's theorem using the theory of computing.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105137"},"PeriodicalIF":1.0,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139495704","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":"The reflective higher-order calculus: Encodability, typability and separation","authors":"Stian Lybech","doi":"10.1016/j.ic.2024.105138","DOIUrl":"10.1016/j.ic.2024.105138","url":null,"abstract":"<div><p>The <em>ρ</em>-calculus (Reflective Higher-Order Calculus) of Meredith and Radestock is a <em>π</em>-calculus-like language with unusual features, notably, structured names, runtime generation of free names, and the lack of a scoping operator. These features pose interesting difficulties for proofs of encodability, type system soundness and separation results. We describe two errors in a previous attempt to encode the <em>π</em>-calculus in the <em>ρ</em>-calculus by Meredith and Radestock. Then we give a new encoding and prove its correctness, using a set of encodability criteria close to those of Gorla, and discuss the adaptations necessary to work with a calculus with runtime generation of structured names. We create a simple type system for the <em>ρ</em>-calculus to show that the encoding is well-typed, and discuss the limitations that must be imposed when working with structured names. Lastly we prove a separation result, showing that the <em>ρ</em>-calculus cannot be encoded in the <em>π</em>-calculus.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105138"},"PeriodicalIF":1.0,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139459973","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":"Growth and irreducibility in path-incompressible trees","authors":"George Barmpalias,&nbsp;Xiaoyan Zhang","doi":"10.1016/j.ic.2024.105136","DOIUrl":"10.1016/j.ic.2024.105136","url":null,"abstract":"<div><p>We study randomness-preserving transformations of path-incompressible trees, namely trees of finite randomness deficiency. We characterize their branching density, and show: (a) sparse perfect path-incompressible trees can be effectively densified, almost surely; (b) there exists a path-incompressible tree with infinitely many paths which does not compute any perfect path-incompressible tree with computable oracle-use.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105136"},"PeriodicalIF":1.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139413172","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":"Cost-asymmetric memory hard password hashing","authors":"Wenjie Bai,&nbsp;Jeremiah Blocki,&nbsp;Mohammad Hassan Ameri","doi":"10.1016/j.ic.2023.105134","DOIUrl":"10.1016/j.ic.2023.105134","url":null,"abstract":"<div><p>In the past decade billions of user passwords have been exposed to the dangerous threat of offline password cracking<span> attacks. An offline attacker who has stolen the cryptographic hash<span> of a user's password can check as many password guesses as s/he likes limited only by the resources that s/he is willing to invest to crack the password. Pepper and key-stretching are two techniques that have been proposed to deter an offline attacker by increasing guessing costs. Pepper ensures that the cost of rejecting an incorrect password guess is higher than the (expected) cost of verifying a correct password guess. This is useful because most of the offline attacker's guesses will be incorrect. Unfortunately, as we observe the traditional peppering defense seems to be incompatible with modern memory hard key-stretching algorithms such as Argon2 or Scrypt. We introduce an alternative to pepper which we call Cost-Asymmetric Memory Hard Password Authentication which benefits from the same cost-asymmetry as the classical peppering defense i.e., the cost of rejecting an incorrect password guess is larger than the expected cost to authenticate a correct password guess. When configured properly we prove that our mechanism can only reduce the percentage of user passwords that are cracked by a rational offline attacker whose goal is to maximize (expected) profit i.e., the total value of cracked passwords minus the total guessing costs. We evaluate the effectiveness of our mechanism on empirical password datasets against a rational offline attacker. Our empirical analysis shows that our mechanism can reduce the percentage of user passwords that are cracked by a rational attacker by up to 10%.</span></span></p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105134"},"PeriodicalIF":1.0,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139093385","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":"The membership problem for subsemigroups of GL2(Z) is NP-complete","authors":"Paul C. Bell ,&nbsp;Mika Hirvensalo ,&nbsp;Igor Potapov","doi":"10.1016/j.ic.2023.105132","DOIUrl":"10.1016/j.ic.2023.105132","url":null,"abstract":"<div><p>We show that the problem of determining if the identity matrix belongs to a finitely generated semigroup of <span><math><mn>2</mn><mo>×</mo><mn>2</mn></math></span> matrices from the General Linear Group <span><math><msub><mrow><mtext>GL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span> is solvable in <strong>NP</strong>. We extend this to prove that the membership problem is decidable in <strong>NP</strong> for <span><math><msub><mrow><mtext>GL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span> and for any arbitrary regular expression over matrices from the Special Linear group <span><math><msub><mrow><mtext>SL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span>. We show that determining if a given finite set of matrices from <span><math><msub><mrow><mtext>SL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span> or the modular group <span><math><msub><mrow><mtext>PSL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span> generates a group or a free semigroup are decidable in <strong>NP</strong>. Previous algorithms, shown in 2005 by Choffrut and Karhumäki, were in <strong>EXPSPACE</strong>. Our algorithm is based on new techniques allowing us to operate on compressed word representations of matrices without explicit expansions. When combined with known <strong>NP</strong>-hard lower bounds, this proves that the membership problem over <span><math><msub><mrow><mtext>GL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span> is <strong>NP</strong>-complete, and the group problem and the non-freeness problem in <span><math><msub><mrow><mtext>SL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span> are <strong>NP</strong>-complete. <span>¹</span></p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105132"},"PeriodicalIF":1.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540123001359/pdfft?md5=59ba4ebf4d7f374b59781f7656883bdb&pid=1-s2.0-S0890540123001359-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139031197","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":"Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022)","authors":"Clemente Galdi ,&nbsp;Stanislaw Jarecki","doi":"10.1016/j.ic.2023.105135","DOIUrl":"https://doi.org/10.1016/j.ic.2023.105135","url":null,"abstract":"","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105135"},"PeriodicalIF":1.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139433906","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":"Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas","authors":"Robert Bredereck ,&nbsp;Junjie Luo","doi":"10.1016/j.ic.2023.105128","DOIUrl":"10.1016/j.ic.2023.105128","url":null,"abstract":"<div><p>Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. It is open to manipulative attacks such as <span>Manipulation</span> where judges (e.g., referees, experts, or jurors) cast their judgments strategically. Previous works have shown that most computational problems corresponding to these manipulative attacks are <span><math><mtext>NP</mtext></math></span>-hard. This desired computational barrier, however, often relies on formulas that are either of unbounded size or of complex structure.</p><p><span>We revisit the computational complexity for various </span><span>Manipulation</span> and <span>Bribery</span> problems in premise-based judgment aggregation, now focusing on simple and realistic formulas. We restrict all formulas to be clauses that are monotone, Horn-clauses, or have bounded length. We show that these restrictions make several variants of <span>Manipulation</span> and <span>Bribery</span>, which were in general known to be <span><math><mtext>NP</mtext></math></span>-hard, polynomial-time solvable. Moreover, we provide a P vs. NP dichotomy for a large class of clause restrictions (generalizing monotone and Horn clauses).</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105128"},"PeriodicalIF":1.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138516740","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":"Scooby: Improved multi-party homomorphic secret sharing based on FHE","authors":"Ilaria Chillotti ,&nbsp;Emmanuela Orsini ,&nbsp;Peter Scholl ,&nbsp;Barry Van Leeuwen","doi":"10.1016/j.ic.2023.105133","DOIUrl":"10.1016/j.ic.2023.105133","url":null,"abstract":"<div><p>In this paper we present new constructions of multi-party homomorphic secret sharing (HSS) based on a new primitive that we call <em>homomorphic encryption with decryption to shares</em> (HEDS). Our first scheme, which we call <span><math><mi>Scooby</mi></math></span>, is based on many popular fully homomorphic encryption (FHE) schemes with a linear decryption property. <span><math><mi>Scooby</mi></math></span> achieves an <em>n</em>-party HSS for general circuits with complexity <span><math><mi>O</mi><mo>(</mo><mo>|</mo><mi>F</mi><mo>|</mo><mo>+</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>, as opposed to <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>⋅</mo><mo>|</mo><mi>F</mi><mo>|</mo><mo>)</mo></math></span> for the prior best construction based on multi-key FHE. <span><math><mi>Scooby</mi></math></span> relies on a trusted setup procedure, and can be based on (ring)-LWE with a super-polynomial modulus-to-noise ratio. In our second construction, <span><math><mi>Scrappy</mi></math></span>, assuming any generic FHE plus HSS for NC1-circuits, we obtain a HEDS scheme which does not require a super-polynomial modulus. While these schemes all require FHE, in another instantiation, <span><math><mi>Shaggy</mi></math></span>, we show how it is also possible to obtain multi-party HSS without FHE, instead relying on the DCR assumption to obtain 4-party HSS for constant-degree polynomials.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105133"},"PeriodicalIF":1.0,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139067135","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}