Security Proof of AugPAKE

In this paper, we show that the AugPAKE protocol provides the semantic security of session keys under the strong Diffie-Hellman (SDH) assumption in the random oracle model

Comparison of Postoperative Complications after Endoscopic Submucosal Dissection: Differences of Insufflations and Anesthesias

Endoscopic submucosal dissection (ESD) has enabled the collective resection and increased the accuracy of pathological diagnosis. However, ESD requires a long operation time, which results in increased doses of analgesics/sedatives, and causes worsening of respiratory and hemodynamic statuses. To reduce postoperative complications, we have applied ESD with CO2 insufflation and general anesthesia. This study included 50 patients who underwent ESD for early gastric cancer, 25 with air insufflation and intravenous anesthesia (Air/IV group), and the remaining 25 with CO2 insufflation and general anesthesia (CO2/GA group). Postoperative enlarged feeling of the abdomen was observed only in 1 of 25 patients in the CO2/GA group (P = 0.0416). Postoperative severe unrest was observed in none of the patients in the CO2/GA group and in 4 of 25 (16%) patients in the Air/IV group (P = 0.0371). CO2 insufflation and general anesthesia are useful in stabilizing intraoperative conditions and reducing postoperative complications

The Creation of School Education Bringing up a Student Carrying Tomorrow (3) : The Valuation of "Compulsory Subjects", "Optional Subjects", and "Integrated Subjects"

The purpose of this study is to show the valuation of "Compulsory Subjects", "Optional Subjects", and "Integrated Subjects", to show the relationship between each subjects and "three abilities", "the ability of recognizing othere senses of value", "the ability of self-expression and communication" and "the ability of decision-making" which defined by the project members. The main result of this study is that we should make up the standards which teachers, students and parents recognize as important abilities

Self-synchronized message randomization methods for subliminal channels

When one transmits a secret message sequence on a random number type subliminal channel, he/she has to convert the secret message sequence into a (practically) indistinguishable random number sequence rst, and then embeds it on a carrier sequence. Otherwise the carrier sequence could be distinguished from one that contains no secret message. If others can distinguish whether a secret message sequence is embedded in the carrier sequence, the carrier sequence cannot be a subliminal channel. That is, a converter to convert any message sequence into a (practically) indistinguishable one is required. Moreover in many applications of subliminal channels, the deconverter corresponding to the converter should be self-synchronized with the converted sequence, because additional information to synchronize reduces the indistinguishability. Therefore, both (practical) indistinguishability and self-synchronization are required to the converter for subliminal channels. Vernum encryption can convert any message sequences into perfectly indistinguishable random number sequences. However the receivers cannot decode the message sequences from anywhere of the converted sequences without any knowledge of the synchronization. On the contrary, (ECB), CBC, CFB mode block ciphers and self-synchronizing stream ciphers can realize the self-synchronization. However, most of the output sequences can be distinguished from real or well-designed random number sequences by using the birthday paradox distinguishers we propose in this paper under some conditions. In this paper, we design some pairs of converters and deconverters that satisfy both (practical) indistinguishability and self-synchronization

Pretty-Simple Password-Authenticated Key-Exchange Under Standard Assumptions

In this paper, we propose a pretty-simple password-authenticated key-exchange protocol, which is proven to be secure in the standard model under the following three assumptions. (1) DDH (Decision Diffie-Hellman) problem is hard. (2) The entropy of the password is large enough to avoid on-line exhaustive search (but not necessarily off-line exhaustive search). (3) MAC is selectively unforgeable against partially chosen message attacks, (which is weaker than being existentially unforgeable against chosen message attacks)