We present a novel secret sharing scheme where the secret is an autotopism (a symmetry) of a Latin square. Previously proposed secret sharing schemes involving Latin squares have many drawbacks: (a) Latin squares contain \(n^2\) entries, which may be too large, (b) partial information about the secret may be directly revealed, (c) a subsequently discovered subtle “flaw”, (d) difficulty in initialization and reconstruction, (e) difficulty in verification, and (f) difficulty in generalizing to a multi-level scheme. We carefully analyze the security of the proposed scheme, and identify how it overcomes all of these problems.
We enumerate 1035 user comments from 190 online articles to gauge public opinion about safety and privacy when transgender women use female bathrooms. In these comments, we find that cisgender males are around 1.55× as likely to express concern about safety and privacy as cisgender females. Moreover, we find that when expressing concern (a) cisgender females are around 4× as likely as cisgender males to assert that transgender women do not directly cause their safety and privacy concerns, typically emphasizing their concerns are about ‘perverts’ posing as transgender females, and (b) cisgender males are around 1.5× as likely as cisgender females to assert that transgender females directly cause their safety and privacy concerns. We theorize that the heightened concern seen in males in these comments stems from them being more likely to view transgender females not as females, but as males who are lying or mistaken about their gender, and consequently they view themselves as protecting females from these males intruding into private, female-only spaces. This may be further exacerbated by a fear of deception and a belief that transgender people are mentally ill or ‘sick’.
21 November 2018 in IEEE Transactions on Dependable and Secure Computing
As cloud storage systems increase in scale, hard drive failures are becoming more frequent, which raises reliability issues. In addition to traditional reactive fault tolerance, proactive fault tolerance is used to improve a system's reliability. However, there are few studies which analyze the reliability of proactive cloud storage systems, and they typically assume an exponential distribution for drive failures. This paper presents closed-form equations for estimating the number of data-loss events in proactive cloud storage systems using RAID-5, RAID-6, 2-way replication, and 3-way replication mechanisms, within a given time period. The equations model the impact of proactive fault tolerance, operational failures, failure restorations, latent block defects, and drive scrubbing on the systems reliability, and use time-based Weibull distributions to represent processes (instead of homogeneous Poisson processes). We also design a Monte-Carlo simulation method to simulate the running of proactive cloud storage systems. The proposed equations closely match time-consuming Monte-Carlo simulations, using parameters obtained from the analysis of field data. These equations allow designers to efficiently estimate system reliability under varying parameters, facilitating cloud storage system design.
We define a cover of a Latin square to be a set of entries that includes at least one representative of each row, column and symbol. A cover is minimal if it does not contain any smaller cover. A partial transversal is a set of entries that includes at most one representative of each row, column and symbol. A partial transversal is maximal if it is not contained in any larger partial transversal. We explore the relationship between covers and partial transversals. We prove the following: (1) The minimum size of a cover in a Latin square of order n is \(n+a\) if and only if the maximum size of a partial transversal is either \(n-2a\) or \(n-2a+1\). (2) A minimal cover in a Latin square of order n has size at most \(\mu _n=3(n+1/2-\sqrt{n+1/4})\). (3) There are infinitely many orders n for which there exists a Latin square having a minimal cover of every size from n to \(\mu _n\). (4) Every Latin square of order n has a minimal cover of a size which is asymptotically equal to \(\mu _n\). (5) If \(1\leqslant k\leqslant n/2\) and \(n\geqslant 5\) then there is a Latin square of order n with a maximal partial transversal of size \(n-k\). (6) For any \(\varepsilon >0\), asymptotically almost all Latin squares have no maximal partial transversal of size less than \(n-n^{2/3+\varepsilon }\).
A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S; the minimum size of a kTDS is denoted ?xk,t(G). We give a Vizing-like inequality for Cartesian product graphs, namely ?xk,t(G) ?xk,t(H)? 2k?xk,t(G_H) provided ?xk,t(G) ? 2k?(G) holds, where ? denotes the packing number. We also give bounds on ?xk,t(G_H) in terms of (open) packing numbers, and consider the extremal case of ?xk,t(Kn_Km), i.e., the rook?s graph, giving a constructive proof of a general formula for ?x2,t(Kn_Km).
22 January 2020 in IEEE Transactions on Information Theory
A k-plex of order n is an n × n matrix on n symbols, where every row contains k distinct symbols, every column contains k distinct symbols, and every symbol occurs exactly k times. Yi et al. (2019) introduced 3-plex codes which are 2-erasure codes (2-erasure tolerant array codes) derived from 3-plexes. In this paper, we generalize 3-plex codes to k-plex codes. We introduce the notion of a “gstrong” k-plex which implies the derived k-plex code is 2-erasure tolerant. Moreover, k-plex codes derived from strong k-plexes have a straightforward algorithm for reconstruction. These general k-plex codes offer greater flexibility when choosing a suitable code for a storage system, enabling the operator to better optimize the unavoidable trade-offs involved. Blackburn asked for the maximum number of entries in an n × n partial Latin square on n symbols in which if distinct cells (i; j) and (i ’ j ’ ) contain the same symbol, then the cells (i ’; j) and (i; j ’ ) are empty. A “gstrong” k-plex satisfies the Blackburn property (along with two other properties related to erasure coding). We investigate the necessary conditions for the existence of Blackburn k-plexes (and hence necessary conditions for the existence of strong k-plexes). We show that any Blackburn k-plex has order n > ( p 2 + 1)k.. 2.. We describe how to construct strong k-plexes of order n when k 2 f2; 3; 4; 5g for all possible orders n, and we give a simple construction of strong k-plexes of order k2 for k > 2.