Results 81 to 90 of about 37,961 (305)
Efficient Verifiable Dynamic Threshold Secret Sharing Scheme Based on Elliptic Curves
International Journal of Information and Communication Technology Research, 2015 A dynamic threshold secret sharing (DTSS) scheme allows the secret to be updated without changing the shares. The first DTSS scheme was proposed by Laih et al. in 1991. Several other schemes based on different methods have been proposed since then.
Amir Alaei, Mohammad Hesam Tadayon
doaj
Secure Collaborative Publicly Verifiable Computation
IEEE Access, 2017 Publicly Verifiable Computation (PVC) enables computationally weak trusted sources to outsource several computations to some more powerful public untrusted clouds.
Qiang Wang +4 more
doaj +1 more source
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Tobacco Control, 1999 Joe and his cartoon-character friends began populating advertisements for the Camel brand in the United States in 1988 and continued doing so for the next decade (figure 1). As described in a fawning retrospective produced for RJ Reynolds: “Between 1988 and 1997, the Joe Camel campaign was one of the most recognized ad campaigns in America, and that ...
openaire +2 more sources
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
Correctness Verifiable Outsourcing Computation Scheme of Shortest Path Querying over Encrypted Graph Data [PDF]
Jisuanji kexueMass graph data such as geolocation and social networks are widely used and contain massive privacy,usually,it requires varied query services through secure outsourcing computation schemes.However,it is still an open challenge to design correctness ...
DING Hongfa, YU Yingying, JIANG Heling
doaj +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Shorter lattice-based verifiable encryption using bimodal Gaussian
CybersecurityVerifiable encryption enables the decryption to be taken on properly generated ciphertexts, by making the encryptor provide a zero-knowledge proof. To meet the quantum-safe application requirements, such as key escrow, Lyubashevsky et al.
Dong Fang +5 more
doaj +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
Journal of Symbolic Computation, 1987 This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely presented group G is nilpotent. If G is not nilpotent, the procedure may not terminate. A preliminary computer implementation of the procedure has been used to prove a theorem about minimal presentations of free nilpotent groups of class 3.
openaire +2 more sources