3,421 research outputs found
Quantum protocols for anonymous voting and surveying
We describe quantum protocols for voting and surveying. A key feature of our
schemes is the use of entangled states to ensure that the votes are anonymous
and to allow the votes to be tallied. The entanglement is distributed over
separated sites; the physical inaccessibility of any one site is sufficient to
guarantee the anonymity of the votes. The security of these protocols with
respect to various kinds of attack is discussed. We also discuss classical
schemes and show that our quantum voting protocol represents a N-fold reduction
in computational complexity, where N is the number of voters.Comment: 8 pages. V2 includes the modifications made for the published versio
Byzantine Modification Detection in Multicast Networks With Random Network Coding
An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages
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 several other cryptographic tasks. Roughly speaking, a
non-malleable code for a family of tampering functions guarantees that no
adversary can tamper (using functions from this family) the encoding of a given
message into the encoding of a related distinct message. Non-malleable secret
sharing schemes are a strengthening of non-malleable codes which satisfy
additional privacy and reconstruction properties.
We first focus on the -split-state tampering model, one of the strongest
and most well-studied adversarial tampering models. Here, a codeword is split
into two parts which are stored in physically distant servers, and the
adversary can then independently tamper with each part using arbitrary
functions. This model can be naturally extended to the secret sharing setting
with several parties by having the adversary independently tamper with each
share.
Previous works on non-malleable coding and secret sharing in the split-state
tampering model only considered the encoding of \emph{classical} messages.
Furthermore, until the recent work by Aggarwal, Boddu, and Jain (arXiv 2022),
adversaries with quantum capabilities and \emph{shared entanglement} had not
been considered, and it is a priori not clear whether previous schemes remain
secure in this model.
In this work, we introduce the notions of split-state non-malleable codes and
secret sharing schemes for quantum messages secure against quantum adversaries
with shared entanglement. We also present explicit constructions of such
schemes that achieve low-error non-malleability
Secure Quantum Network Code without Classical Communication
We consider the secure quantum communication over a network with the presence
of a malicious adversary who can eavesdrop and contaminate the states. The
network consists of noiseless quantum channels with the unit capacity and the
nodes which applies noiseless quantum operations. As the main result, when the
maximum number m1 of the attacked channels over the entire network uses is less
than a half of the network transmission rate m0 (i.e., m1 < m0 / 2), our code
implements secret and correctable quantum communication of the rate m0 - 2m1 by
using the network asymptotic number of times. Our code is universal in the
sense that the code is constructed without the knowledge of the specific node
operations and the network topology, but instead, every node operation is
constrained to the application of an invertible matrix to the basis states.
Moreover, our code requires no classical communication. Our code can be thought
of as a generalization of the quantum secret sharing
Practical cryptographic strategies in the post-quantum era
We review new frontiers in information security technologies in
communications and distributed storage technologies with the use of classical,
quantum, hybrid classical-quantum, and post-quantum cryptography. We analyze
the current state-of-the-art, critical characteristics, development trends, and
limitations of these techniques for application in enterprise information
protection systems. An approach concerning the selection of practical
encryption technologies for enterprises with branched communication networks is
introduced.Comment: 5 pages, 2 figures; review pape
- …