Certificateless Public Auditing Protocol with Constant

To provide the integrity of outsourced data in the cloud storage services, many public auditing schemes which allow a user to check the integrity of the outsourced data have been proposed. Since most of the schemes are constructed on Public Key Infrastructure (PKI), they suffer from several concerns like management of certificates. To resolve the problems, certificateless public auditing schemes also have been studied in recent years. In this paper, we propose a certificateless public auditing scheme which has the constant-time verification algorithm. Therefore, our scheme is more efficient than previous certificateless public auditing schemes. To prove the security of our certificateless public auditing scheme, we first define three formal security models and prove the security of our scheme under the three security models

Bi-weekly Chemotherapy of Paclitaxel and Cisplatin in Patients with Metastatic or Recurrent Esophageal Cancer

Although various combinations of chemotherapy regimens have been tried for patients with esophageal cancer, their duration of survival is extremely poor. In this study, we investigated the safety and clinical efficacy of paclitaxel and cisplatin chemotherapy in metastatic or recurrent esophageal cancer. 32 patients enrolled in this study and the median age was 60 yr. Of all the 32, 28 patients (88%) had been treated previously, 22 of them with chemotherapy or radiation therapy. All patients in the study received biweekly paclitaxel (90 mg/m2) followed by cisplatin (50 mg/m2). One patient (3%) responded completely, and 12 patients (38%) showed a partial response; in 9 patients (28%) the disease remained stable, and in 10 patients (31%) it progressed. The objective response rate was 41%. The median duration of response was 4.8 months, and the median overall survival in all patients was 7 months. The 1-yr and 2-yr survival rates were 28.1% and 7.1%, respectively. Grade 3 or 4 of neutropenia and anemia were observed in 6 (19%) and 5 (16%) patients, respectively. The major non-hematologic toxicity was fatigue, but most of them could manageable. In conclusion, biweekly paclitaxel and cisplatin is effective in patients with metastatic or recurrent esophageal cancer

Effect of Smaller Fingerprint Sensors on the Security of Fingerprint Authentication

Small fingerprint sensors are necessary to be used in the small devices like smartphones, USBs, and cards. Different small devices have different sizes of fingerprint sensors. The scanned fingerprint image through a small fingerprint sensor is a partial fingerprint image instead of a whole fingerprint image, if we use a small fingerprint sensor. If the size of the partial fingerprints stored in the database decreases, the number of minutiae that are compared when matching decreases. Unfortunately, for the small number of minutiae, it is possible to construct “Masterprints”. Masterprints can be used to impersonate multiple users stored in the database. If the size of a partial image is 15 % of a whole image, a Masterprint can be produced. We investigate the vulnerability of various sizes of partial images due to the Masterprint. Because sensors have different sizes, we use partial images of 9% to 48% of a whole image. Our results show that the security of partial fingerprint authentication is severely affected by the sizes of partial images and sensors. The smaller the partial image size, the larger the impostor matching rate; and the smaller the false matching rates, the steeper the impostor matching rate increases

On the Unlinkability of Fingerprint Shell

To prevent the leakage of original biometric information of a user, it may be transformed into a cancelable form. A cancelable biometric transformation should satisfy four requirements: unlinkability, revocability, noninvertibility, and performance. In 2014, Moujahdi et al. proposed a new cancelable fingerprint transformation called fingerprint shell, which was also later discussed by Ali et al. In this paper, we show that all of the shell fingerprint schemes presented by Moujahdi et al. and Ali et al. do not satisfy the condition of unlinkability

Parallel Key Exchange

Abstract: In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a party and an edge represents a relation of two parties who are to share a key. We first propose a security model for a key graph, which extends the Bellare-Rogaway model for two-party key exchange. Next, we clarify the relations among the various security notions of key exchange. Finally, we construct an efficient key exchange protocol for a key graph using the randomness re-use technique. Our protocol establishes the multiple keys corresponding to all edges of a key graph in a single session. The security of our protocol is proven in the standard model

<italic>Cost-Effectively</italic> Searchable Blackbox Data With <italic>Unlinkability</italic> Based on Public Blockchain

A blackbox data can be used to identify the cause of an accident. And we may need to find blackbox videos recorded by the third party to accurately analyze the cause of the accident. One of the basic requirements of blackbox data is integrity, and this integrity can be provided by uploading the data to blockchains. However, the existing blackbox data storage systems have two big problems, cost and privacy. The transaction fees are the costs necessary to upload data to the blockchains. The transaction fees of the major public blockchain are getting higher. Therefore, if a user uses Bitcoin or Ethereum to upload its blackbox video, the costs could be very expensive. On the other hand, the private information such as driving route could be revealed from the uploaded information to the blockchain. We suggest a cost-effective searchable blackbox data storage system with strong anonymity, i.e. unlinkability, using blockchains. In our scheme, the cost of registering a blackbox video is $\frac {cost_{tr}}{n}$ , where $cost_{tr}$ is the cost necessary to upload a transaction to a blockchain and $n$ is the number of uploading users at the same time. Therefore, our scheme is practical with public blockchains such as Bitcoin or Ethereum. In the paper, we suggest a cost-effective searchable black box data storage system with unlinkability using blockchains