22,911 research outputs found
Constructions of S-boxes with uniform sharing
In this paper we focus on S-box constructions. We consider the uniformity property of an S-box which plays an important role in Threshold Implementations (TI). Most papers so far have studied TI sharings for given S-boxes. We proceed in the opposite way: starting from -bit S-boxes with known sharings we construct new -bit S-boxes from them with the desired sharings. In addition, we investigate the self-equivalency of S-boxes and show some interesting properties
Trade-offs in multi-party Bell inequality violations in qubit networks
Two overlapping bipartite binary input Bell inequalities cannot be
simultaneously violated as this would contradict the usual no-signalling
principle. This property is known as monogamy of Bell inequality violations and
generally Bell monogamy relations refer to trade-offs between simultaneous
violations of multiple inequalities. It turns out that multipartite Bell
inequalities admit weaker forms of monogamies that allow for violations of a
few inequalities at once. Here we systematically study monogamy relations
between correlation Bell inequalities both within quantum theory and under the
sole assumption of no signalling. We first investigate the trade-offs in Bell
violations arising from the uncertainty relation for complementary binary
observables, and exhibit several network configurations in which a tight
trade-off arises in this fashion. We then derive a tight trade-off relation
which cannot be obtained from the uncertainty relation showing that it does not
capture monogamy entirely. The results are extended to Bell inequalities
involving different number of parties and find applications in
device-independent secret sharing and device-independent randomness extraction.
Although two multipartite Bell inequalities may be violated simultaneously, we
show that genuine multi-party non-locality, as evidenced by a generalised
Svetlichny inequality, does exhibit monogamy property. Finally, using the
relations derived we reveal the existence of flat regions in the set of quantum
correlations.Comment: 15 pages, 5 figure
Exchangeable pairs and Poisson approximation
This is a survey paper on Poisson approximation using Stein's method of
exchangeable pairs. We illustrate using Poisson-binomial trials and many
variations on three classical problems of combinatorial probability: the
matching problem, the coupon collector's problem, and the birthday problem.
While many details are new, the results are closely related to a body of work
developed by Andrew Barbour, Louis Chen, Richard Arratia, Lou Gordon, Larry
Goldstein, and their collaborators. Some comparison with these other approaches
is offered.Comment: Published at http://dx.doi.org/10.1214/154957805100000096 in the
Probability Surveys (http://www.i-journals.org/ps/) by the Institute of
Mathematical Statistics (http://www.imstat.org
NiMo syntax: part 1
Many formalisms for the specification for concurrent and distributed systems have emerged. In particular considering boxes and strings approaches. Examples are action calculi, rewriting logic and graph rewriting, bigraphs. The boxes and string metaphor is addressed with different levels of granularity. One of the approaches is to consider a process network as an hypergraph. Based in this general framework, we encode NiMo nets as a class of Annotated hypergraphs. This class is defined by giving the alphabet and the operations used to construct such programs. Therefore we treat only editing operations on labelled hypergraphs and afterwards how this editing operation affects the graph. Graph transformation (execution rules) is not covered here.Postprint (published version
- …