11 research outputs found
On the algebraic immunity of direct sum constructions
In this paper, we study sufficient conditions to improve the lower bound on the algebraic immunity of a direct sum of Boolean functions.
We exhibit three properties on the component functions such that satisfying one of them is sufficient to ensure that the algebraic immunity of their direct sum exceeds the maximum of their algebraic immunities.
These properties can be checked while computing the algebraic immunity and they allow to determine better the security provided by functions central in different cryptographic constructions such as stream ciphers, pseudorandom generators, and weak pseudorandom functions.
We provide examples for each property and determine the exact algebraic immunity of candidate constructions
On the algebraic immunity of weightwise perfectly balanced functions
In this article we study the Algebraic Immunity (AI) of Weightwise Perfectly Balanced (WPB) functions.
After showing a lower bound on the AI of two classes of WPB functions from the previous literature, we prove that the minimal AI of a WPB -variables function is constant, equal to for .
Then, we compute the distribution of the AI of WPB function in variables, and estimate the one in and variables.
For these values of we observe that a large majority of WPB functions have optimal AI, and that we could not obtain an AI- WPB function by sampling at random.
Finally, we address the problem of constructing WPB functions with bounded algebraic immunity, exploiting a construction from 2022 by Gini and MĂ©aux. In particular, we present a method to generate multiple WPB functions with minimal AI, and we prove that the WPB functions with high nonlinearity exhibited by Gini and MĂ©aux also have minimal AI. We conclude with a construction giving WPB functions with lower bounded AI, and give as example a family with all elements with AI at least
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation
We initiate a systematic study of pseudorandom functions (PRFs) that are
computable by simple matrix branching programs; we refer to these objects as
âmatrix PRFsâ. Matrix PRFs are attractive due to their simplicity, strong
connections to complexity theory and group theory, and recent applications in
program obfuscation.
Our main results are:
* We present constructions of matrix PRFs based on the conjectured hardness of
some simple computational problems pertaining to matrix products.
* We show that any matrix PRF that is computable by a read-c, width w
branching program can be broken in time poly(w^c); this means that any matrix
PRF based on constant-width matrices must read each input bit omega(log
lambda) times. Along the way, we simplify the âtensor switching lemmasâ
introduced in previous IO attacks.
* We show that a subclass of the candidate local-PRG proposed by Barak et al.
[Eurocrypt 2018] can be broken using simple matrix algebra.
* We show that augmenting the CVW18 IO candidate with a matrix PRF provably
immunizes the candidate against all known algebraic and statistical zeroizing
attacks, as captured by a new and simple adversarial model
Improved Learning from Kolmogorov Complexity
Carmosino, Impagliazzo, Kabanets, and Kolokolova (CCC, 2016) showed that the existence of natural properties in the sense of Razborov and Rudich (JCSS, 1997) implies PAC learning algorithms in the sense of Valiant (Comm. ACM, 1984), for boolean functions in P/poly, under the uniform distribution and with membership queries. It is still an open problem to get from natural properties learning algorithms that do not rely on membership queries but rather use randomly drawn labeled examples.
Natural properties may be understood as an average-case version of MCSP, the problem of deciding the minimum size of a circuit computing a given truth-table. Problems related to MCSP include those concerning time-bounded Kolmogorov complexity. MKTP, for example, asks for the KT-complexity of a given string. KT-complexity is a relaxation of circuit size, as it does away with the requirement that a short description of a string be interpreted as a boolean circuit. In this work, under assumptions of MKTP and the related problem MK^tP being easy on average, we get learning algorithms for boolean functions in P/poly that
- work over any distribution D samplable by a family of polynomial-size circuits (given explicitly in the case of MKTP),
- only use randomly drawn labeled examples from D, and
- are agnostic (do not require the target function to belong to the hypothesis class). Our results build upon the recent work of Hirahara and Nanashima (FOCS, 2021) who showed similar learning consequences but under a stronger assumption that NP is easy on average
Fully Collusion Resistant Trace-and-Revoke Functional Encryption for Arbitrary Identities
Functional Encryption (FE) has been extensively studied in the recent years, mainly focusing on the feasibility of constructing FE for general functionalities, as well as some realizations for restricted functionalities of practical interest, such as inner-product. However, little consideration has been given to the issue of key leakage on FE. The property of FE that allows multiple users to obtain the same functional keys from the holder of the master secret key raises an important problem: if some users leak their keys or collude to create a pirated decoder,
how can we identify at least one of those users, given some information about the compromised keys or the pirated decoder? Moreover, how do we disable the decryption capabilities of those users (i.e. traitors)?
Two recent works have offered potential solutions to the above traitor scenario. However, the two solutions satisfy weaker notions of security and traceability, can only tolerate bounded collusions (i.e., there is an a priori bound on the number of keys the pirated decoder obtains), or can only handle a polynomially large universe of possible identities. In this paper, we study trace-and-revoke mechanism on FE and provide the first construction of trace-and-revoke FE that supports arbitrary identities, is both fully collusion resistant and fully anonymous. Our construction relies on a generic transformation from revocable predicate functional encryption with broadcast (RPFE with broadcast, which is an extension of revocable predicate encryption with broadcast proposed by Kim and J. Wu at ASIACRYPT\u272020) to trace-and-revoke FE. Since this construction admits a generic construction of trace-and-revoke inner-product FE (IPFE), we instantiate the trace-and-revoke IPFE from the well-studied Learning with Errors (LWE). This is achieved by proposing a new LWE-based attribute-based IPFE (ABIPFE) scheme to instantiate RPFE with broadcast