Objective: To compare the effects of letrozole and human menopausal gonadotropin (HMG) in the treatment of patients with polycystic ovary syndrome (PCOS) resistant to clomiphene citrate (CC). Methods: A total of 96 clomiphene resistance polycystic ovary syndrome patients infertility were randomly divided into an LE group, and HMG group (n = 48). LE group orally received letrozole at 5.0 mg/d−1 on the 3rd–5th days of menstrual cycle for 5 consecutive days, and 75 U/d−1 HMG was given through intramuscular injection for 5 days starting from the third day of menstrual cycle in HMG group. Number of growing and mature follicles, serum E2 (pg/mL), serum P (ng/mL), endometrial thickness, occurrence of pregnancy and miscarriage were observed. Results: There was no significant difference in the number of ovulation cycles between the 2 groups (53.6% vs 64.7%, P > .05). The number of mature follicular cycles in the HMG group was higher than that of the letrozole group (P < .01). There were no significant differences in the clinical pregnancy rate (22.9% vs 27.1%, P > .05) and abortion rate (6.2% vs 10.4%, P > .05). There was no significant difference in the endometrial thickness between the 2 groups on the day of HCG injection [(9.1 ± 0.2) mm vs (10.7 ± 1.6) mm, P > .05]; the serum estradiol (E2) was lower in the letrozole group. The incidence of ovarian cysts was lower than that of HMG group (P < .05). There was2 ovarian hyperstimulation syndrome in the letrozole group; the incidence of ovarian hyperstimulation syndrome in the HMG group was 12.5%. Conclusion: Letrozole-induced ovulation can obtain ovulation rate and pregnancy rate similar to gonadotropin, but reduce the risk associated with treatment. It can be used as an effective ovulation option for patients with polycystic ovary syndrome who are resistant to clomiphene.
To achieve the fairness and the privacy of the e-commence, and also to consider the quantum security of the e-commence, a lattice-based encrypted verifiably encryption signature scheme (EVES) is proposed in this paper. We achieve the strong unforgeability and the opacity properties in the standard model over lattice without the help of the lattice-based delegation technologies which is one of main tools to achieve the standard model security for the lattice-based cryptography. It is shown that the proposed scheme can be used to design a fair and privacy-preserving e-commence system in cloud, not only for business-to-customer business(B2C) but also for customer-to-customer business(C2C). The main reason is that the verifier can read the details of the EVES by easily computation operations before the EVES is verified. Then the seller who acts as a verifier in EVES scheme can ask a proxy sever to deal the business for him. Then the seller does not need to keep online for most of time. Moreover, we compare the proposed EVES with some known lattice-based VES schemes. Besides the proposed scheme achieves the more cryptographic functions, such as EVES vs VES and standard model vs random oracle model etc., the proposed scheme even has some advantage about the computation cost compared with known lattice-based VES schemes.
To efficiently authenticate the updated data in fog computing, this paper proposed a lattice-based incremental digital signature scheme. The proposed scheme is provable secure in the standard model whose security is based on the hardness of the shortest integer solution (SIS) problem. There are several characters of the proposed scheme that are suitable for the application in. Such as, most of the time-consuming computing operations in the proposed scheme can be finished by the parallel computing. As a result, the computing speed of the proposed scheme can be improved efficiently. On the other hand, compared with a known lattice-based incremental digital signature, both the public key size and the signature length are shorter. Then the store resource and the bandwidth of the fog device can be saved efficiently when it is used in fog computing. Furthermore, a simulated experiment is given to check the functions of the proposed scheme by Java language on PC. The result shows that the computing cost to update a signature is much less than that to resign a message. At the same time, the parallel computing and pre-computing can really efficiently improve the computing speed of the proposed scheme. Since the SIS problem is hard even on quantum computers, the proposed scheme also gives a post-quantum secure solution to authenticate the updated data in fog computing.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.