416 research outputs found
Secret-Sharing for NP
A computational secret-sharing scheme is a method that enables a dealer, that
has a secret, to distribute this secret among a set of parties such that a
"qualified" subset of parties can efficiently reconstruct the secret while any
"unqualified" subset of parties cannot efficiently learn anything about the
secret. The collection of "qualified" subsets is defined by a Boolean function.
It has been a major open problem to understand which (monotone) functions can
be realized by a computational secret-sharing schemes. Yao suggested a method
for secret-sharing for any function that has a polynomial-size monotone circuit
(a class which is strictly smaller than the class of monotone functions in P).
Around 1990 Rudich raised the possibility of obtaining secret-sharing for all
monotone functions in NP: In order to reconstruct the secret a set of parties
must be "qualified" and provide a witness attesting to this fact.
Recently, Garg et al. (STOC 2013) put forward the concept of witness
encryption, where the goal is to encrypt a message relative to a statement "x
in L" for a language L in NP such that anyone holding a witness to the
statement can decrypt the message, however, if x is not in L, then it is
computationally hard to decrypt. Garg et al. showed how to construct several
cryptographic primitives from witness encryption and gave a candidate
construction.
One can show that computational secret-sharing implies witness encryption for
the same language. Our main result is the converse: we give a construction of a
computational secret-sharing scheme for any monotone function in NP assuming
witness encryption for NP and one-way functions. As a consequence we get a
completeness theorem for secret-sharing: computational secret-sharing scheme
for any single monotone NP-complete function implies a computational
secret-sharing scheme for every monotone function in NP
(Pseudo) Random Quantum States with Binary Phase
We prove a quantum information-theoretic conjecture due to Ji, Liu and Song
(CRYPTO 2018) which suggested that a uniform superposition with random
\emph{binary} phase is statistically indistinguishable from a Haar random
state. That is, any polynomial number of copies of the aforementioned state is
within exponentially small trace distance from the same number of copies of a
Haar random state.
As a consequence, we get a provable elementary construction of
\emph{pseudorandom} quantum states from post-quantum pseudorandom functions.
Generating pseduorandom quantum states is desirable for physical applications
as well as for computational tasks such as quantum money. We observe that
replacing the pseudorandom function with a -wise independent function
(either in our construction or in previous work), results in an explicit
construction for \emph{quantum state -designs} for all . In fact, we show
that the circuit complexity (in terms of both circuit size and depth) of
constructing -designs is bounded by that of -wise independent
functions. Explicitly, while in prior literature -designs required linear
depth (for ), this observation shows that polylogarithmic depth suffices
for all .
We note that our constructions yield pseudorandom states and state designs
with only real-valued amplitudes, which was not previously known. Furthermore,
generating these states require quantum circuit of restricted form: applying
one layer of Hadamard gates, followed by a sequence of Toffoli gates. This
structure may be useful for efficiency and simplicity of implementation
Calcium-independent phosphatidylinositol response in gonadotropin-releasing-hormone-stimulated pituitary cells
Online algorithms for covering and packing problems with convex objectives
We present online algorithms for covering and packing problems with (non-linear) convex objectives. The convex covering problem is defined as ...postprin
Neonatal Exposure to Bisphenol A Alters Reproductive Parameters and Gonadotropin Releasing Hormone Signaling in Female Rats
Bisphenol A (BPA) is a component of polycarbonate plastics, epoxy resins, and polystyrene and is found in many products. Several reports have revealed potent in vivo effects, because BPA acts as an estrogen agonist and/or antagonist and as an androgen and thyroid hormone antagonist We analyzed the effects of neonatal exposure to BPA on the reproductive axis of female Sprague-Dawley rats.Fil: Fernandez, Marina Olga. Consejo Nacional de Investigaciones Científicas y Técnicas. Instituto de Biología y Medicina Experimental. Fundación de Instituto de Biología y Medicina Experimental. Instituto de Biología y Medicina Experimental; ArgentinaFil: Bianchi, Maria Silvia. Consejo Nacional de Investigaciones Científicas y Técnicas. Instituto de Biología y Medicina Experimental. Fundación de Instituto de Biología y Medicina Experimental. Instituto de Biología y Medicina Experimental; ArgentinaFil: Lux, Victoria Adela R.. Consejo Nacional de Investigaciones Científicas y Técnicas. Instituto de Biología y Medicina Experimental. Fundación de Instituto de Biología y Medicina Experimental. Instituto de Biología y Medicina Experimental; ArgentinaFil: Libertun, Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Instituto de Biología y Medicina Experimental. Fundación de Instituto de Biología y Medicina Experimental. Instituto de Biología y Medicina Experimental; Argentin
Relative blocking in posets
Poset-theoretic generalizations of set-theoretic committee constructions are
presented. The structure of the corresponding subposets is described. Sequences
of irreducible fractions associated to the principal order ideals of finite
bounded posets are considered and those related to the Boolean lattices are
explored; it is shown that such sequences inherit all the familiar properties
of the Farey sequences.Comment: 29 pages. Corrected version of original publication which is
available at http://www.springerlink.com, see Corrigendu
Non-malleable codes for space-bounded tampering
Non-malleable codes—introduced by Dziembowski, Pietrzak and Wichs at ICS 2010—are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries, result in a decoded value that is either identical or unrelated to the original message. Such codes are very useful for protecting arbitrary cryptographic primitives against tampering attacks against the memory. Clearly, non-malleability is hopeless if the class of tampering adversaries includes the decoding and encoding algorithm. To circumvent this obstacle, the majority of past research focused on designing non-malleable codes for various tampering classes, albeit assuming that the adversary is unable to decode. Nonetheless, in many concrete settings, this assumption is not realistic
Reexamination of Quantum Bit Commitment: the Possible and the Impossible
Bit commitment protocols whose security is based on the laws of quantum
mechanics alone are generally held to be impossible. In this paper we give a
strengthened and explicit proof of this result. We extend its scope to a much
larger variety of protocols, which may have an arbitrary number of rounds, in
which both classical and quantum information is exchanged, and which may
include aborts and resets. Moreover, we do not consider the receiver to be
bound to a fixed "honest" strategy, so that "anonymous state protocols", which
were recently suggested as a possible way to beat the known no-go results are
also covered. We show that any concealing protocol allows the sender to find a
cheating strategy, which is universal in the sense that it works against any
strategy of the receiver. Moreover, if the concealing property holds only
approximately, the cheat goes undetected with a high probability, which we
explicitly estimate. The proof uses an explicit formalization of general two
party protocols, which is applicable to more general situations, and a new
estimate about the continuity of the Stinespring dilation of a general quantum
channel. The result also provides a natural characterization of protocols that
fall outside the standard setting of unlimited available technology, and thus
may allow secure bit commitment. We present a new such protocol whose security,
perhaps surprisingly, relies on decoherence in the receiver's lab.Comment: v1: 26 pages, 4 eps figures. v2: 31 pages, 5 eps figures; replaced
with published version; title changed to comply with puzzling Phys. Rev.
regulations; impossibility proof extended to protocols with infinitely many
rounds or a continuous communication tree; security proof of decoherence
monster protocol expanded; presentation clarifie
- …