Designs, Codes and Cryptography最新文献

A storage code is an assignment of symbols to the vertices of a connected graph G(V, E) with the property that the value of each vertex is a function of the values of its neighbors, or more generally, of a certain neighborhood of the vertex in G. In this work we introduce a new construction method of storage codes, enabling one to construct new codes from known ones via an interleaving procedure driven by resolvable designs. We also study storage codes on ({mathbb Z}) and ({mathbb Z}^2) (lines and grids), finding closed-form expressions for the capacity of several one and two-dimensional systems depending on their recovery set, using connections between storage codes, graphs, anticodes, and difference-avoiding sets.

In this paper, we investigate how to construct the required sequences to be used as pilot signals for packet detection in physical-layer security. Our construction starts from the frequency domain, where a set of orthogonal frequencies cover an entire given bandwidth. The construction is a generalized construction from Milewski’s construction, where it takes the inverse discrete Fourier transform of the given frequency domain sequences. In this paper, we call a set of the q sequences of length (ell q) with an equal distanced, nonzero frequency response in the frequency domain a frequency distance sequence set (FDSS) and a sequence interleaved from this set an FDSS interleaved sequence. By applying frequency and time domain relations, we show that such a set is mutually orthogonal, and is a complementary sequence set if and only if the seed sequence is perfect (i.e., zero autocorrelation at all out-of-phase shift). The FDSS interleaved sequence is perfect if and only if the seed sequence is perfect. We apply the proposed sequences to real world experiments as pilot sequences for coarse synchronization. In our experiments, we selected Frank–Zadoff–Chu sequences and Golay pair sequences in our construction for use with an ADALM-Pluto SDR from Analog Devices and simulations, and we show the pilot detection rate under different noisy channel conditions, when compared to alternative pilot selections. The false negative detection rate of our pilot decreases to zero when the SNR is 20 dB. In contrast, a general OFDM QPSK pilot has a false-negative detection rate near 70% at the same SNR. In general, our pilot sequence consistently has a lower false-negative rate to the OFDM QPSK pilot, which failed to detect most packets in the ADALM-Pluto SDR environment.

Proxy re-encryption (PRE) is a cryptosystem that realizes efficient encrypted data sharing by allowing a third party proxy to transform a ciphertext intended for a delegator (i.e., Alice) to a ciphertext intended for a delegatee (i.e., Bob). Attribute-based proxy re-encrypftion (AB-PRE) generalizes PRE to the attribute-based scenarios, enabling fine-grained access control on ciphertexts. However, the existing AB-PRE schemes do not adequately address the following problems: (1) the risk of decryption key leakage, and (2) the need of time-based delegation. To resolve these problems, we introduce a primitive called time-based attribute-based proxy re-encryption (TB-AB-PRE) with decryption key update. TB-AB-PRE associates keys with the current time information and supports efficient periodical decryption key update for each time transition. This property guarantees that a compromise of a decryption key for some time does not breach the security of ciphertexts from the others. Leveraging this time-based property, the proposed TB-AB-PRE elegantly achieves time-based delegation which enables Alice to decide which ciphertexts can be transformed and their decryptable timeframe after being transformed. The proposed construction is proven to be secure against honest re-encryption attacks with decryption key exposure resistance, under the learning with errors assumption.

For an odd prime power q, let (mathbb {F}_{q^2}=mathbb {F}_q(alpha )), (alpha ^2=tin mathbb {F}_q) be the quadratic extension of the finite field (mathbb {F}_q). In this paper, we consider the irreducible polynomials (F(x)=x^k-c_1x^{k-1}+c_2x^{k-2}-cdots -c_{2}^qx^2+c_{1}^qx-1) over (mathbb {F}_{q^2}), where k is an odd integer and the coefficients (c_i) are in the form (c_i=a_i+b_ialpha ) with at least one (b_ine 0). For a given such irreducible polynomial F(x) over (mathbb {F}_{q^2}), we provide an algorithm to construct an irreducible polynomial (G(x)=x^k-A_1x^{k-1}+A_2x^{k-2}-cdots -A_{k-2}x^2+A_{k-1}x-A_k) over (mathbb {F}_q), where the (A_i)’s are explicitly given in terms of the (c_i)’s. This gives a bijective correspondence between irreducible polynomials over (mathbb {F}_{q^2}) and (mathbb {F}_q). This fact generalizes many recent results on this subject in the literature.

Circulant Column Parity Mixers (CCPMs) are a particular type of linear maps, used as the mixing layer in permutation-based cryptographic primitives like Keccak-f (SHA3) and Xoodoo. Although being successfully applied, not much is known regarding their algebraic properties. They are limited to invertibility of CCPMs, and that the set of invertible CCPMs forms a group. A possible explanation is due to the complexity of describing CCPMs in terms of linear algebra. In this paper, we introduce a new approach to studying CCPMs using module theory from commutative algebra. We show that many interesting algebraic properties can be deduced using this approach, and that known results regarding CCPMs resurface as trivial consequences of module theoretic concepts. We also show how this approach can be used to study the linear layer of Xoodoo, and other linear maps with a similar structure which we call DCD-compositions. Using this approach, we prove that every DCD-composition where the underlying vector space with the same dimension as that of Xoodoo has a low order. This provides a solid mathematical explanation for the low order of the linear layer of Xoodoo, which equals 32. We design a DCD-composition using this module-theoretic approach, but with a higher order using a different dimension.

The Gray map converts a symbol in (mathbb {Z}_4) to a pair of binary symbols. Therefore, under the Gray map, a linear function from (mathbb {Z}_4^n) to (mathbb {Z}_4) gives rise to a pair of boolean functions from (mathbb {F}_2^{2n}) to (mathbb {F}_2). This paper studies such boolean functions. We state and prove a condition for the nonlinearity of such functions and derive closed-form expressions for them. Further, results related to the mutual information between random variables that satisfy such expressions have been derived. These results are then used to construct a couple of nonlinear boolean secret sharing schemes. These schemes are then analyzed for their closeness to ‘perfectness’ and their ability to resist ‘Tompa–Woll’-like attacks.

Let ({mathcal {K}}) be a discrete valued field with finite residue field. In analogy with orthogonality in the Euclidean space ({mathbb {R}}^n), there is a well-studied notion of “ultrametric orthogonality” in ({mathcal {K}}^n). In this paper, motivated by a question of Erdős in the real case, given integers (k ge ell ge 2), we investigate the maximum size of a subset (S subseteq {mathcal {K}}^n {setminus }{textbf{0}}) satisfying the following property: for any (E subseteq S) of size k, there exists (F subseteq E) of size (ell ) such that any two distinct vectors in F are orthogonal. Other variants of this property are also studied.

We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and Güneri–Özbudak bounds and it holds for the more general class of multilevel concatenated codes.

Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal ((2, delta ))-LRCs over (mathbb {F}_q) with flexible parameters. Firstly, employing techniques from finite geometry, we introduce a simple yet useful condition to ensure that a punctured simplex code becomes a ((2, delta ))-LRC. It is worth noting that this condition only imposes a requirement on the size of the puncturing set. Secondly, utilizing character sums over finite fields and Krawtchouk polynomials, we determine the parameters of more punctured simplex codes with puncturing sets of new structures. Several infinite families of LRCs with new parameters are derived. All of our new LRCs are optimal with respect to the generalized Cadambe–Mazumdar bound and some of them are also Griesmer codes or distance-optimal codes.

A functional commitment (FC) scheme enables committing to a vector ({textbf{x}}) and later producing an opening proof (pi ) for a function value (y=f({textbf{x}})) with function f in some function set ({mathcal {F}}). Everyone can verify the validity of the opening proof (pi ) w.r.t. the function f and the function value y. Up to now, the largest function set is the bounded-depth circuits and achieved by FC schemes in [Peikeit et al. TCC 2021, De Castro et al. TCC 2023, Wee et al. Eurocrypt 2023, Wee et al. Asiacrypt 2023] with the help of the homomorphic encoding and evaluation techniques from lattices. In fact, these FC schemes can hardly support circuits of large depth, due to the fast accumulation of noises in the homomorphic evaluations. For example, if the depth of the circuit is linear to the security parameter (lambda ), then the underlying (textsf {GapSVP}_{gamma }) problem will be accompanied with a super-exponentially large parameter (gamma >(lambda log lambda )^{Theta (lambda )}) and can be easily solved by the LLL algorithm. In this work, we propose a new FC scheme supporting arbitrary circuits of bounded sizes. We make use of homomorphic encoding and evaluation as well, but we disassemble the circuit gate by gate, process the gates, and reassemble the processed gates to a flattened circuit of logarithm depth (O(log lambda )). This makes possible for our FC scheme to support arbitrary polynomial-size circuits. Our FC scheme has the common reference string (CRS) growing linear to the size of the circuit. So CRSs of different sizes allow our FC scheme to support circuits of different (bounded) sizes. Just like the recent work on FC schemes [Wee et al. Eurocrypt 2023, Asiacrypt 2023], our FC scheme achieves private opening and target binding based on a falsifiable family of “basis-augmented” SIS assumptions. Our FC scheme has succinct commitment but not succinct opening proof which of course does not support fast verification. To improve the running time of verification, we resort to the non-interactive GKR protocol to outsource the main computation in verification to the proof generation algorithm. As a result, we obtain an improved FC scheme which decreases the computational complexity of verification with a factor (O(lambda )).