Taxonomic Features and Comparison of the Gut Microbiome from Two Edible Fungus-Farming Termites (Macrotermes falciger, M. natalensis) Harvested in the Vhembe District of Limpopo, South Africa

Background Termites are an important food resource for many human populations around the world, and are a good supply of nutrients. The fungus-farming ‘higher’ termite members of Macrotermitinae are also consumed by modern great apes and are implicated as critical dietary resources for early hominins. While the chemical nutritional composition of edible termites is well known, their microbiomes are unexplored in the context of human health. Here we sequenced the V4 region of the 16S rRNA gene of gut microbiota extracted from the whole intestinal tract of two Macrotermes sp. soldiers collected from the Limpopo region of South Africa. Results Major and minor soldier subcastes of M. falciger exhibit consistent differences in taxonomic representation, and are variable in microbial presence and abundance patterns when compared to another edible but less preferred species, M. natalensis. Subcaste differences include alternate patterns in sulfate-reducing bacteria and methanogenic Euryarchaeota abundance, and differences in abundance between Alistipes and Ruminococcaceae. M. falciger minor soldiers and M. natalensissoldiers have similar microbial profiles, likely from close proximity to the termite worker castes, particularly during foraging and fungus garden cultivation. Compared with previously published termite and cockroach gut microbiome data, the taxonomic representation was generally split between termites that directly digest lignocellulose and humic substrates and those that consume a more distilled form of nutrition as with the omnivorous cockroaches and fungus-farming termites. Lastly, to determine if edible termites may point to a shared reservoir for rare bacterial taxa found in the gut microbiome of humans, we focused on the genus Treponema. The majority of Treponemasequences from edible termite gut microbiota most closely relate to species recovered from other termites or from environmental samples, except for one novel OTU strain, which clustered separately with Treponema found in hunter-gatherer human groups. Conclusions Macrotermes consumed by humans display special gut microbial arrangements that are atypical for a lignocellulose digesting invertebrate, but are instead suited to the simplified nutrition in the fungus-farmer diet. Our work brings to light the particular termite microbiome features that should be explored further as avenues in human health, agricultural sustainability, and evolutionary research

Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search

By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem. With quantum computers we can provably find a shortest vector in time $2^{1.799n + o(n)}$, improving upon the classical time complexity of $2^{2.465n + o(n)}$ of Pujol and Stehl\'{e} and the $2^{2n + o(n)}$ of Micciancio and Voulgaris, while heuristically we expect to find a shortest vector in time $2^{0.312n + o(n)}$, improving upon the classical time complexity of $2^{0.384n + o(n)}$ of Wang et al. These quantum complexities will be an important guide for the selection of parameters for post-quantum cryptosystems based on the hardness of the shortest vector problem.Comment: 19 page

Gradual sub-lattice reduction and a new complexity for factoring polynomials

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For such applications, the complexity of the algorithm improves traditional lattice reduction by replacing some dependence on the bit-length of the input vectors by some dependence on the bound for the output vectors. If the bit-length of the target vectors is unrelated to the bit-length of the input, then our algorithm is only linear in the bit-length of the input entries, which is an improvement over the quadratic complexity floating-point LLL algorithms. To illustrate the usefulness of this algorithm we show that a direct application to factoring univariate polynomials over the integers leads to the first complexity bound improvement since 1984. A second application is algebraic number reconstruction, where a new complexity bound is obtained as well

Election Verifiability for Helios under Weaker Trust Assumptions

Most electronic voting schemes aim at providing verifiability: voters should trust the result without having to rely on some authorities. Actually, even a prominent voting system like Helios cannot fully achieve verifiability since a dishonest bulletin board may add ballots. This problem is called ballot stuffing. In this paper we give a definition of verifiability in the computational model to account for a malicious bulletin board that may add ballots. Next, we provide a generic construction that transforms a voting scheme that is verifiable against an honest bulletin board and an honest registration authority (weak verifiability) into a verifiable voting scheme under the weaker trust assumption that the registration authority and the bulletin board are not simultaneously dishonest (strong verifiability). This construction simply adds a registration authority that sends private credentials to the voters, and publishes the corresponding public credentials. We further provide simple and natural criteria that imply weak verifiability. As an application of these criteria, we formally prove the latest variant of Helios by Bernhard, Pereira and Warinschi weakly verifiable. By applying our generic construction we obtain a Helios-like scheme that has ballot privacy and strong verifiability (and thus prevents ballot stuffing). The resulting voting scheme, Helios-C, retains the simplicity of Helios and has been implemented and tested

A Tale of Three Signatures: practical attack of ECDSA with wNAF

One way of attacking ECDSA with wNAF implementation for the scalar multiplication is to perform a side-channel analysis to collect information, then use a lattice based method to recover the secret key. In this paper, we reinvestigate the construction of the lattice used in one of these methods, the Extended Hidden Number Problem (EHNP). We find the secret key with only 3 signatures, thus reaching the theoretical bound given by Fan, Wang and Cheng, whereas best previous methods required at least 4 signatures in practice. Our attack is more efficient than previous attacks, in particular compared to times reported by Fan et al. at CCS 2016 and for most cases, has better probability of success. To obtain such results, we perform a detailed analysis of the parameters used in the attack and introduce a preprocessing method which reduces by a factor up to 7 the overall time to recover the secret key for some parameters. We perform an error resilience analysis which has never been done before in the setup of EHNP. Our construction is still able to find the secret key with a small amount of erroneous traces, up to 2% of false digits, and 4% with a specific type of error. We also investigate Coppersmith's methods as a potential alternative to EHNP and explain why, to the best of our knowledge, EHNP goes beyond the limitations of Coppersmith's methods

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement

While many tailor made card game protocols are known, the vast majority of those suffer from three main issues: lack of mechanisms for distributing financial rewards and punishing cheaters, lack of composability guarantees and little flexibility, focusing on the specific game of poker. Even though folklore holds that poker protocols can be used to play any card game, this conjecture remains unproven and, in fact, does not hold for a number of protocols (including recent results). We both tackle the problem of constructing protocols for general card games and initiate a treatment of such protocols in the Universal Composability (UC) framework, introducing an ideal functionality that captures general card games constructed from a set of core card operations. Based on this formalism, we introduce Royale, the first UC-secure general card games which supports financial rewards/penalties enforcement. We remark that Royale also yields the first UC-secure poker protocol. Interestingly, Royale performs better than most previous works (that do not have composability guarantees), which we highlight through a detailed concrete complexity analysis and benchmarks from a prototype implementation

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model

Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to rely on a weaker hypothesis on the computational cost of gaining information about the plaintext pertaining to a ciphertext without knowing the key. Such a view is permitted by the Generic Model and the Random Oracle Model which provide non-standard computational models in which one may reason about the computational cost of breaking a cryptographic scheme. Using the proof assistant Coq, we provide a machine-checked account of the Generic Model and the Random Oracle Mode

Obscuration in AGNs: near-infrared luminosity relations and dust colors

We combine two approaches to isolate the AGN luminosity at near-infrared wavelengths and relate the near-IR pure AGN luminosity to other tracers of the AGN. Using integral-field spectroscopic data of an archival sample of 51 local AGNs, we estimate the fraction of non-stellar light by comparing the nuclear equivalent width of the stellar 2.3 micron CO absorption feature with the intrinsic value for each galaxy. We compare this fraction to that derived from a spectral decomposition of the integrated light in the central arc second and find them to be consistent with each other. Using our estimates of the near-IR AGN light, we find a strong correlation with presumably isotropic AGN tracers. We show that a significant offset exists between type 1 and type 2 sources in the sense that type 1 sources are 7 (10) times brighter in the near-IR at log L_MIR = 42.5 (log L_X = 42.5). These offsets only becomes clear when treating infrared type 1 sources as type 1 AGNs. All AGNs have very red near-to-mid-IR dust colors. This, as well as the range of observed near-IR temperatures, can be explained with a simple model with only two free parameters: the obscuration to the hot dust and the ratio between the warm and hot dust areas. We find obscurations of A_V (hot) = 5 - 15 mag for infrared type 1 sources and A_V (hot) = 15 - 35 mag for type 2 sources. The ratio of hot dust to warm dust areas of about 1000 is nicely consistent with the ratio of radii of the respective regions as found by infrared interferometry.Comment: 17 pages, 10 Figures, 3 Tables, accepted by A&

An outflow in the Seyfert ESO 362-G18 revealed by Gemini-GMOS/IFU observations

Indexación: Scopus.We present two-dimensional stellar and gaseous kinematics of the inner 0.7 × 1.2 kpc2 of the Seyfert 1.5 galaxy ESO 362-G18, derived from optical (4092-7338 Å) spectra obtained with the GMOS integral field spectrograph on the Gemini South telescope at a spatial resolution of ≈ 170 pc and spectral resolution of 36 km s-1. ESO 362-G18 is a strongly perturbed galaxy of morphological type Sa or S0/a, with a minor merger approaching along the NE direction. Previous studies have shown that the [O III] emission shows a fan-shaped extension of ≈ 10′′ to the SE. We detect the [O III] doublet, [N II] and Hα emission lines throughout our field of view. The stellar kinematics is dominated by circular motions in the galaxy plane, with a kinematic position angle of ≈ 137° and is centred approximately on the continuum peak. The gas kinematics is also dominated by rotation, with kinematic position angles ranging from 122° to 139°, projected velocity amplitudes of the order of 100 km s-1, and a mean velocity dispersion of 100 km s-1. A double-Gaussian fit to the [O III]λ5007 and Hα lines, which have the highest signal to noise ratios of the emission lines, reveal two kinematic components: (1) a component at lower radial velocities which we interpret as gas rotating in the galactic disk; and (2) a component with line of sight velocities 100-250 km s-1 higher than the systemic velocity, interpreted as originating in the outflowing gas within the AGN ionization cone. We estimate a mass outflow rate of 7.4 × 10-2 M⊙ yr-1 in the SE ionization cone (this rate doubles if we assume a biconical configuration), and a mass accretion rate on the supermassive black hole (SMBH) of 2.2 × 10-2 M⊙ yr-1. The total ionized gas mass within ∼84 pc of the nucleus is 3.3 × 105 M⊙; infall velocities of ∼34 km s-1 in this gas would be required to feed both the outflow and SMBH accretion. © ESO 2018.https://www.aanda.org/articles/aa/abs/2018/06/aa31671-17/aa31671-17.htm