Glucan Phosphatase Variants for Starch Phosphorylation

Glucan phosphatase nucleotide or polypeptide variants of the presently-disclosed subject matter can alter the biophysical properties of starch in vitro or in planta, as well as the total starch biomass production in planta as compared to plants expressing wild-type glucan phosphatases. Plants producing the polypeptide variants of the presently-disclosed subject matter can have increased starch accumulation, increased starched biomass, and/or starch having desired biophysical properties. A method of the presently-disclosed subject matter for producing altered starch includes providing a plant that produces a glucan phosphatase polypeptide variant that comprises an amino acid mutation and collecting starch from the plant

A unified framework for trapdoor-permutation-based sequential aggregate signatures

We give a framework for trapdoor-permutation-based sequential aggregate signatures (SAS) that unifies and simplifies prior work and leads to new results. The framework is based on ideal ciphers over large domains, which have recently been shown to be realizable in the random oracle model. The basic idea is to replace the random oracle in the full-domain-hash signature scheme with an ideal cipher. Each signer in sequence applies the ideal cipher, keyed by the message, to the output of the previous signer, and then inverts the trapdoor permutation on the result. We obtain different variants of the scheme by varying additional keying material in the ideal cipher and making different assumptions on the trapdoor permutation. In particular, we obtain the first scheme with lazy verification and signature size independent of the number of signers that does not rely on bilinear pairings. Since existing proofs that ideal ciphers over large domains can be realized in the random oracle model are lossy, our schemes do not currently permit practical instantiation parameters at a reasonable security level, and thus we view our contribution as mainly conceptual. However, we are optimistic tighter proofs will be found, at least in our specific application.https://eprint.iacr.org/2018/070.pdfAccepted manuscrip

Computing on the Edge of Chaos: Structure and Randomness in Encrypted Computation

This survey, aimed mainly at mathematicians rather than practitioners, covers recent developments in homomorphic encryption (computing on encrypted data) and program obfuscation (generating encrypted but functional programs). Current schemes for encrypted computation all use essentially the same noisy approach: they encrypt via a noisy encoding of the message, they decrypt using an approximate ring homomorphism, and in between they employ techniques to carefully control the noise as computations are performed. This noisy approach uses a delicate balance between structure and randomness: structure that allows correct computation despite the randomness of the encryption, and randomness that maintains privacy against the adversary despite the structure. While the noisy approach works , we need new techniques and insights, both to improve efficiency and to better understand encrypted computation conceptually

Thermophilic Phosphatases and Methods for Processing Starch Using the Same

The presently-disclosed subject matter includes thermophilic glucan phosphatase polypeptides. In some embodiments the polypeptide includes non-native laforin polypeptides, or fragments and/or variants thereof, and in some instances the polypeptide can alter the biophysical properties of starch in vitro or in planta. The presently-disclosed subject matter also includes isolated polynucleotides encoding the present polypeptides, methods for processing starch by exposing starch to the present polypeptides, and methods for making the present polypeptides

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public \Eval procedure that can be applied to ciphertexts. But the evaluated ciphertexts so generated may differ from freshly encrypted ones. This brings up the question of whether one can keep computing on evaluated ciphertexts. An \emph{$i$-hop} homomorphic encryption scheme is one where \Eval can be called on its own output up to $i$~times, while still being able to decrypt the result. A \emph{multi-hop} homomorphic encryption is a scheme which is $i$-hop for all~$i$. In this work we study $i$-hop and multi-hop schemes in conjunction with the properties of function-privacy (i.e., \Eval\u27s output hides the function) and compactness (i.e., the output of \Eval is short). We provide formal definitions and describe several constructions. First, we observe that bootstrapping techniques can be used to convert any (1-hop) homomorphic encryption scheme into an $i$-hop scheme for any~$i$, and the result inherits the function-privacy and/or compactness of the underlying scheme. However, if the underlying scheme is not compact (such as schemes derived from Yao circuits) then the complexity of the resulting $i$-hop scheme can be as high as $k^{O(i)}$. We then describe a specific DDH-based multi-hop homomorphic encryption scheme that does not suffer from this exponential blowup. Although not compact, this scheme has complexity linear in the size of the composed function, independently of the number of hops. The main technical ingredient in this solution is a \emph{re-randomizable} variant of the Yao circuits. Namely, given a garbled circuit, anyone can re-garble it in such a way that even the party that generated the original garbled circuit cannot recognize it. This construction may be of independent interest

Cryptanalyses of Candidate Branching Program Obfuscators

We describe new cryptanalytic attacks on the candidate branching program obfuscator proposed by Garg, Gentry, Halevi, Raykova, Sahai and Waters (GGHRSW) using the GGH13 graded encoding, and its variant using the GGH15 graded encoding as specified by Gentry, Gorbunov and Halevi. All our attacks require very specific structure of the branching programs being obfuscated, which in particular must have some input-partitioning property. Common to all our attacks are techniques to extract information about the ``multiplicative bundling\u27\u27 scalars that are used in the GGHRSW construction. For GGHRSW over GGH13, we show how to recover the ideal generating the plaintext space when the branching program has input partitioning. Combined with the information that we extract about the ``multiplicative bundling\u27\u27 scalars, we get a distinguishing attack by an extension of the annihilation attack of Miles, Sahai and Zhandry. Alternatively, once we have the ideal we can solve the principle-ideal problem (PIP) in classical subexponential time or quantum polynomial time, hence obtaining a total break. For the variant over GGH15, we show how to use the left-kernel technique of Coron, Lee, Lepoint and Tibouchi to recover ratios of the bundling scalars. Once we have the ratios of the scalar products, we can use factoring and PIP solvers (in classical subexponential time or quantum polynomial time) to find the scalars themselves, then run mixed-input attacks to break the obfuscation

Obfuscation Using Tensor Products

We describe obfuscation schemes for matrix-product branching programs that are purely algebraic and employ matrix groups and tensor algebra over a finite field. In contrast to the obfuscation schemes of Garg et al (SICOM 2016) which were based on multilinear maps, these schemes do not use noisy encodings. We prove that there is no efficient attack on our scheme based on re-linearization techniques of Kipnis-Shamir (CRYPTO 99) and its generalization called XL-methodology (Courtois et al, EC2000). We also provide analysis to claim that general Grobner-basis computation attacks will be inefficient. In a generic colored matrix model our construction leads to a virtual-black-box obfuscator for NC$^1$ circuits. We also provide cryptanalysis based on computing tangent spaces of the underlying algebraic sets

Smoking cessation for substance misusers: a systematic review of qualitative studies on participant and provider beliefs and perceptions

Introduction: Smoking prevalence among those in substance misuse treatment remains much higher than the general population, despite evidence for effective cessation interventions that do not negatively impact substance misuse outcomes. This systematic review summarises qualitative data on barriers and facilitators to smoking cessation for people in substance misuse treatment, participants’ and providers’ perceptions about effects of smoking cessation on substance misuse treatment, timing of intervention delivery and aspects of interventions perceived to be effective. Methods: Systematic review of qualitative studies and thematic synthesis of published qualitative data. Results: 10939 records and 132 full texts were screened. 22 papers reporting on 21 studies were included. Key themes identified were: strong relationships between smoking and other substance misuse; environmental influences; motivation; mental health; aspects of interventions perceived to be effective/ineffective; barriers and facilitators to intervention implementation; smoking bans/restrictions; and relationships with professionals. Many service users were motivated toward smoking cessation but were not offered support. Some felt interventions should be delivered after substance misuse treatment, whilst others felt concurrent/dual interventions would be beneficial, due to strong associations between smoking and other substances. Treatment providers felt they lacked training and resources for supporting smoking cessation, and were concerned about impact on substance misuse outcomes. Conclusions: Many substance misusers who also smoke are motivated to quit but perceive a lack of support from professionals. Additional training and resources are required to enable professionals to provide the support needed. More research is required to develop enhanced packages of care for this deprived group of smokers