Intersubband-transition-induced phase matching

We suggest the use of the refractive-index changes associated with the intersubband transitions in quantum wells for phase matching in nonlinear materials. An improvement in the conversion efficiency of mid-IR second-harmonic generation by almost 2 orders of magnitude over non-phase-matched bulk GaAs is predicted. We also show that the linear phase contributions of intersubband transitions used for resonant enhancement of second-harmonic generation must be considered, as they could limit the conversion efficiency by increasing the phase mismatch on one hand or offset the bulk's dispersion and lead to phase matching on the other

On Constructing One-Way Permutations from Indistinguishability Obfuscation

We prove that there is no black-box construction of a one-way permutation family from a one-way function and an indistinguishability obfuscator for the class of all oracle-aided circuits, where the construction is domain invariant (i.e., where each permutation may have its own domain, but these domains are independent of the underlying building blocks). Following the framework of Asharov and Segev (FOCS \u2715), by considering indistinguishability obfuscation for oracle-aided circuits we capture the common techniques that have been used so far in constructions based on indistinguishability obfuscation. These include, in particular, non-black-box techniques such as the punctured programming approach of Sahai and Waters (STOC \u2714) and its variants, as well as sub-exponential security assumptions. For example, we fully capture the construction of a trapdoor permutation family from a one-way function and an indistinguishability obfuscator due to Bitansky, Paneth and Wichs (TCC \u2716). Their construction is not domain invariant and our result shows that this, somewhat undesirable property, is unavoidable using the common techniques. In fact, we observe that constructions which are not domain invariant circumvent all known negative results for constructing one-way permutations based on one-way functions, starting with Rudich\u27s seminal work (PhD thesis \u2788). We revisit this classic and fundamental problem, and resolve this somewhat surprising gap by ruling out all such black-box constructions -- even those that are not domain invariant

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

Recent breakthroughs in cryptography have positioned indistinguishability obfuscation as a ``central hub\u27\u27 for almost all known cryptographic tasks, and as an extremely powerful building block for new cryptographic tasks resolving long-standing and foundational open problems. However, constructions based on indistinguishability obfuscation almost always rely on non-black-box techniques, and thus the extent to which it can be used as a building block has been completely unexplored so far. We present a framework for proving meaningful negative results on the power of indistinguishability obfuscation. By considering indistinguishability obfuscation for oracle-aided circuits, we capture the common techniques that have been used so far in constructions based on indistinguishability obfuscation. These include, in particular, non-black-box techniques such as the punctured programming approach of Sahai and Waters (STOC \u2714) and its variants, as well as sub-exponential security assumptions. Within our framework we prove the first negative results on the power of indistinguishability obfuscation and of the tightly related notion of functional encryption. Our results are as follows: -- There is no fully black-box construction of a collision-resistant function family from an indistinguishability obfuscator for oracle-aided circuits. -- There is no fully black-box construction of a key-agreement protocol with perfect completeness from a private-key functional encryption scheme for oracle-aided circuits. Specifically, we prove that any such potential constructions must suffer from an exponential security loss, and thus our results cannot be circumvented using sub-exponential security assumptions. Our framework captures constructions that may rely on a wide variety of primitives in a non-black-box manner (e.g., obfuscating or generating a functional key for a function that uses the evaluation circuit of a puncturable pseudorandom function), and we only assume that the underlying indistinguishability obfuscator or functional encryption scheme themselves are used in a black-box manner

Tight Tradeoffs in Searchable Symmetric Encryption

A searchable symmetric encryption (SSE) scheme enables a client to store data on an untrusted server while supporting keyword searches in a secure manner. Recent experiments have indicated that the practical relevance of such schemes heavily relies on the tradeoff between their space overhead, locality (the number of non-contiguous memory locations that the server accesses with each query), and read efficiency (the ratio between the number of bits the server reads with each query and the actual size of the answer). These experiments motivated Cash and Tessaro (EUROCRYPT \u2714) and Asharov et al. (STOC \u2716) to construct SSE schemes offering various such tradeoffs, and to prove lower bounds for natural SSE frameworks. Unfortunately, the best-possible tradeoff has not been identified, and there are substantial gaps between the existing schemes and lower bounds, indicating that a better understanding of SSE is needed. We establish tight bounds on the tradeoff between the space overhead, locality and read efficiency of SSE schemes within two general frameworks that capture the memory access pattern underlying all existing schemes. First, we introduce the ``pad-and-split\u27\u27 framework, refining that of Cash and Tessaro while still capturing the same existing schemes. Within our framework we significantly strengthen their lower bound, proving that any scheme with locality $L$ must use space $\Omega ( N \log N / \log L )$ for databases of size $N$. This is a tight lower bound, matching the tradeoff provided by the scheme of Demertzis and Papamanthou (SIGMOD \u2717) which is captured by our pad-and-split framework. Then, within the ``statistical-independence\u27\u27 framework of Asharov et al. we show that their lower bound is essentially tight: We construct a scheme whose tradeoff matches their lower bound within an additive $O(\log \log \log N)$ factor in its read efficiency, once again improving upon the existing schemes. Our scheme offers optimal space and locality, and nearly-optimal read efficiency that depends on the frequency of the queried keywords: For a keyword that is associated with $n = N^{1 - \epsilon(n)}$ document identifiers, the read efficiency is $\omega(1) \cdot \epsilon(n)^{-1}+ O(\log\log\log N)$ when retrieving its identifiers (where the $\omega(1)$ term may be arbitrarily small, and $\omega(1) \cdot \epsilon(n)^{-1}$ is the lower bound proved by Asharov et al.). In particular, for any keyword that is associated with at most $N^{1 - 1/o(\log \log \log N)}$ document identifiers (i.e., for any keyword that is not exceptionally common), we provide read efficiency $O(\log \log \log N)$ when retrieving its identifiers

A Paradoxical Isopotentiality: A Spatially Uniform Noise Spectrum in Neocortical Pyramidal Cells

Membrane ion channels and synapses are among the most important computational elements of nerve cells. Both have stochastic components that are reflected in random fluctuations of the membrane potential. We measured the spectral characteristics of membrane voltage noise in vitro at the soma and the apical dendrite of layer 4/5 (L4/5) neocortical neurons of rats near the resting potential. We found a remarkable similarity between the voltage noise power spectra at the soma and the dendrites, despite a marked difference in their respective input impedances. At both sites, the noise levels and the input impedance are voltage dependent; in the soma, the noise level increased from σ = 0.33 ± 0.28 mV at 10 mV hyperpolarization from the resting potential to σ = 0.59 ± 0.3 at a depolarization of 10 mV. At the dendrite, the noise increased from σ = 0.34 ± 0.28 to σ = 0.56 ± 0.30 mV, respectively. TTX reduced both the input impedance and the voltage noise, and eliminated their voltage dependence at both locations. We describe a detailed compartmental model of a L4/5 neuron with simplified electrical properties that successfully reproduces the difference in input impedance between dendrites and soma and demonstrates that spatially uniform conductance-base noise sources leads to an apparent isopotential structure which exhibits a uniform power spectra of voltage noise at all locations. We speculate that a homogeneous distribution of noise sources insures that variability in synaptic amplitude as well as timing of action potentials is location invariant

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations

Searchable symmetric encryption (SSE) enables a client to store a database on an untrusted server while supporting keyword search in a secure manner. Despite the rapidly increasing interest in SSE technology, experiments indicate that the performance of the known schemes scales badly to large databases. Somewhat surprisingly, this is not due to their usage of cryptographic tools, but rather due to their poor locality (where locality is defined as the number of non-contiguous memory locations the server accesses with each query). The only known schemes that do not suffer from poor locality suffer either from an impractical space overhead or from an impractical read efficiency (where read efficiency is defined as the ratio between the number of bits the server reads with each query and the actual size of the answer). We construct the first SSE schemes that simultaneously enjoy optimal locality, optimal space overhead, and nearly-optimal read efficiency. Specifically, for a database of size $N$, under the modest assumption that no keyword appears in more than $N^{1 - 1/\log\log N}$ documents, we construct a scheme with read efficiency $\tilde{O}(\log \log N)$. This essentially matches the lower bound of Cash and Tessaro (EUROCRYPT \u2714) showing that any SSE scheme must be sub-optimal in either its locality, its space overhead, or its read efficiency. In addition, even without making any assumptions on the structure of the database, we construct a scheme with read efficiency $\tilde{O}(\log N)$. Our schemes are obtained via a two-dimensional generalization of the classic balanced allocations (``balls and bins\u27\u27) problem that we put forward. We construct nearly-optimal two-dimensional balanced allocation schemes, and then combine their algorithmic structure with subtle cryptographic techniques

Spirocerca lupi induced oesophageal neoplasia : predictors of surgical outcome

Canine spirocercosis is caused by the nematode Spirocerca lupi. Migration results in oesophageal fibro-inflammatory nodules that may undergo neoplastic transformation. No studies have assessed pre- or post-surgical prognostic indicators in dogs that undergo intervention for S. lupi induced oesophageal neoplasia. This observational, multi-center study aimed to assess the outcome of dogs with Spirocerca induced sarcoma undergoing endoscopic-guided ablation (n = 12) or surgery (n = 18), and identify prognostic indicators. Parameters evaluated included: age, weight, gender, presenting complaints, duration of clinical signs, complete blood count, serum biochemistry, neoplasia size, placement of percutaneous endoscopically-placed gastrostomy tube, histopathological mitotic indices, days to discharge and chemotherapy administration. Kaplan-Meier survival curves showed no difference in survival between ablation and surgery {(median: 73.5 days (range: 0–1511) vs. 108 days (range: 0–1550), respectively (p = 0.982)}. Reduced survival was documented in patients presenting with weight loss (P = 0.027), hypochromasia (MCHC 15 × 109/L, P = 0.017) with a hazard ratio of 2.51 (CI95% = 1.071–6.018, P = 0.034), 2.71 (CI95% = 1.10–6.65, P = 0.03) and 4.39 (CI95%: 1.21–15.97, P = 0.025) respectively. In the dogs surviving more than 21 days, Ht 15.0 × 109/L at presentation were associated with reduced survival (p = 0.016, p = 0.021 respectively) and hazard ratio of 3.29 (CI95% = 1.18–9.2, P = 0.023) and 3.81 (CI95% = 1.15–12.55, P = 0.028) respectively. Intra-intervention-group survival analysis identified increased survival time in dogs receiving chemotherapy, but only within the surgical group (P = 0.02).The hospitalisation time of dogs undergoing ablation (median: 0 days, range: 0–4) was significantly shorter than dogs undergoing surgery (9 days, 1–21) (P < 0.001). In this study, no clear benefit was identified for surgery, thus when ablation is technically possible it should be considered advantageous, as hospitalisation time is significantly shorter. Weight loss, hypochromasia and leucocytosis were identified as long-term prognostic indicators at presentation.http://www.elsevier.com/locate/vetpar2019-01-30hj2018Companion Animal Clinical Studie

The role of landscape and history on the genetic structure of peripheral populations of the Near Eastern fire salamander, Salamandra infraimmaculata, in Northern Israel

Genetic studies on core versus peripheral populations have yielded many patterns. This diversity in genetic patterns may reflect diversity in the meaning of peripheral populations as defined by geography, gene flow patterns, historical effects, and ecological conditions. Populations at the lower latitude periphery of a species' range are of particular concern because they may be at increased risk for extinction due to global climate change. In this work we aim to understand the impact of landscape and ecological factors on different geographical types of peripheral populations with respect to levels of genetic diversity and patterns of local population differentiation. We examined three geographical types of peripheral populations of the endangered salamander, Salamandra infraimmaculata, in Northern Israel, in the southernmost periphery of the genus Salamandra, by analyzing the variability in 15 microsatellite loci from 32 sites. Our results showed that: (1) genetic diversity decreases towards the geographical periphery of the species' range; (2) genetic diversity in geographically disjunct peripheral areas is low compared to the core or peripheral populations that are contiguous to the core and most likely affected by a founder effect; (3) ecologically marginal conditions enhance population subdivision. The patterns we found lead to the conclusion that genetic diversity is influenced by a combination of geographical, historical, and ecological factors. These complex patterns should be addressed when prioritizing areas for conservation.Peer reviewe