Designs, Codes and Cryptography
Publisher: Springer Nature · ISSN 0925-1022,1573-7586 · 429 articles
- Information-theoretic function secret sharing with verifiable reconstruction
-
Code equivalence, point set equivalence, and polynomial isomorphism
Abstract The linear code equivalence (LCE) problem is known to be equivalent to the point set equivalence (PSE) problem, i.e., the problem to check whether two sets of points in a projective space over a finite field differ by a linear...
- Critical sets of Latin squares based on autoparatopisms
- Module lattices and their shortest vectors
- Parallel construction and improved bounds for constant dimension codes
- Self-orthogonal and LCD codes over non-unitary rings
- On the optimal contrast of threshold visual cryptography schemes when all the shares are superimposed
-
Structure of Cayley codes
Abstract Cayley codes were introduced by Kaufman and Wigderson, as linear codes constructed from a Cayley graph and a smaller linear code. We explore general properties of the class of Cayley codes for finite groups. We give a reduction...
- Divisible design graphs from Higmanian association schemes
-
New directions in evolving secret sharing: adaptive security and more access structures
Abstract Evolving secret sharing (Komargodski, Naor, and Yogev, TCC 2016) allows a dealer to share a secret value in an online manner, without knowing the access structure or the maximum number of parties in advance, and without ever...
- New constructions of LRCs and qLRCs with good parameters from cyclic codes
-
Code distances: a new family of invariants of linear codes
Abstract In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear...
-
Blocking sets from a union of plane curves
Abstract Motivated by a question of Erdős on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $$\mathbb {P}^2(\mathbb {F}_q)$$...
- Differential fault attack on SNOW 5G stream cipher
-
A multiset approach to MacWilliams identities
Abstract We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight...
- Cyclic codes and cyclically covering subspaces over finite fields
- Completely regular codes in graphs covered by a Hamming graph
- Embedding linear codes over $${\mathbb {Z}}_4$$ into self-orthogonal codes
- On the minimum length of binary linear codes
- A class of locally differentially 4-uniform power functions with Niho exponents
- Unbounded quadratic functional encryption and more from pairings
-
Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs
Abstract A binary frequency square of type $$(n;\lambda _0,\lambda _1)$$ ( n ; λ 0 , λ 1 ) is a (0, 1)-matrix of order n with $$\lambda _0$$ λ 0 zeros and $$\lambda _1$$ λ 1 ones in each row and in each column. Two such squares are...
- Infinite families of $$\textrm{t}$$-error-correcting binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$
- On the combinatorial complexity of bounded sparse Learning With Errors (sLWE)
- Vectorial dual-bent functions and association schemes
- On the dimension and structure of puncture codes
- An improved method for predicting truncated Fibonacci LFSRs over integer residue rings
- Near-optimal covering sequences
- Extending binary sequences to maximum length sequences
- Infinite families of constacyclic codes supporting 3-designs