相关论文: Splitting authentication codes with perfect secrec…
Non-malleable codes are fundamental objects at the intersection of cryptography and coding theory. These codes provide security guarantees even in settings where error correction and detection are impossible, and have found applications to…
We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and $\epsilon$-CONSENSUS SPLITTING. In the problem $\epsilon$-CONSENSUS SPLITTING, there are $n$ non-atomic probability measures on the interval $[0, 1]$ and…
We ask whether two or more images of arithmetic may inhabit the same space via different encodings. The answers have significance for a class of processor design that does all its computation in an encrypted form, without ever performing…
In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…
In these notes we investigate BIBDs with $\lambda=1$ that present subdesigns evenly covering both blocks and vertices: we determine some of their basic properties, consequence of already existing results in the literature, with regards to…
Secret sharing is an important building block in cryptography. All explicitly defined secret sharing schemes with known exact complexity bounds are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in…
Biclustering, also called co-clustering, block clustering, or two-way clustering, involves the simultaneous clustering of both the rows and columns of a data matrix into distinct groups, such that the rows and columns within a group display…
We consider the problem of private distributed multi-party multiplication. It is well-established that Shamir secret-sharing coding strategies can enable perfect information-theoretic privacy in distributed computation via the celebrated…
Coded computing is one of the techniques that can be used for privacy protection in Federated Learning. However, most of the constructions used for coded computing work only under the assumption that the computations involved are exact,…
We provide a comprehensive survey of splitting and composition methods for the numerical integration of ordinary differential equations (ODEs). Splitting methods constitute an appropriate choice when the vector field associated with the ODE…
An obfuscator is an algorithm that translates circuits into functionally-equivalent similarly-sized circuits that are hard to understand. Efficient obfuscators would have many applications in cryptography. Until recently, theoretical…
A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plaintext message. Such schemes are useful, for example, for the implementation of privacy preserving encrypted…
We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of…
Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…
A domination-based identification problem on a graph $G$ is one where the objective is to choose a subset $C$ of the vertex set of $G$ such that $C$ has both, a domination property, that is, $C$ is either a dominating or a total-dominating…
Algebraic Manipulation Detection (AMD) codes is a cryptographic primitive that was introduced by Cramer, Dodis, Fehr, Padro and Wichs. They are keyless message authentication codes that protect messages against additive tampering by the…
A fully homomorphic encryption system hides data from unauthorized parties, while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more…
This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on…
Striking a balance between protecting data privacy and enabling collaborative computation is a critical challenge for distributed machine learning. While privacy-preserving techniques for federated learning have been extensively developed,…
Secure Multiparty Computation (MPC) can improve the security and privacy of data owners while allowing analysts to perform high quality analytics. Secure aggregation is a secure distributed mechanism to support federated deep learning…