Master Key Research Articles

INTEGRATED CRYPTOGRAPHICAL ACCESS CONTROL OVER NETWORK PROJECT

Cryptanalysis is a new ID-based encryption scheme proposed by Meshram. I found a method for factor N, where N is the parameter proposed by Meshram. We also provide a method for retrieving the Secret Master key for Mayshram’s ID-based encryption scheme. Identity-based (ID-based) cryptography is very useful because it simplifies certificate management in public-key cryptocurrency. For the design of the Integrated File Level Cryptographic Access Control (IFLCAC) system, it makes file security much easier for the end-user. This system combines the advantages of traditional file-level cryptography and full-disc cryptography systems, making it safe and easy to use. We first look at existing file cryptography systems, compare them to two, and then describe the interactions between components and components of the integrated file-level cryptographic access control system. Because its defense relies on the difficulty of discrete logarithmic and integer factor problems, it proves that his scheme is safe against favorable select-plain invasion. We show that this new ID-based encryption scheme is not secure by introducing a method to retrieve the secret master key.

MASTER KEY Project: Powering Clinical Development for Rare Cancers Through a Platform Trial.

For rare cancers, challenges in establishing standard therapies are greater than those for major cancers, and effective methods are needed. MASTER KEY Project is a multicenter study based in Japan, with two main parts: prospective registry study and multiple clinical trials. Advanced rare cancers, cancers of unknown primary origin, and those with rare tissue subtypes of common cancers are targeted. The registry study accumulates highly reliable consecutive data that can be used for future drug development. The multiple trials are conducted simultaneously, targeting either a specific biomarker or a rare tumor type of interest. The first interim data set from the registry part presented here shows the prevalence of genetic abnormalities, response rates, survival rates, and clinical trial enrollment rates. From May 2017 to April 2019, 560 patients (mean age = 53) were enrolled in the project. Frequent cancer types included soft tissue sarcomas, neuroendocrine tumors, and central nervous system tumors. Among the 528 patients with assessable data, 69% (364/528) had next‐generation sequencing tests, with 48% (176/364) harboring an “actionable” alteration. Seventy‐one (13%) patients have been enrolled in one of the clinical trials, with an accrual rate of 3.94 patients/month. A descriptive analysis of biomarker‐directed or non‐biomarker‐directed treatment survival was performed. This project is expected to accelerate development of treatments for rare cancers and show that comprehensive platform trials are an advantageous strategy.

Enhanced Security Identity-Based Privacy-Preserving Authentication Scheme Supporting Revocation for VANETs

Existing conditional privacy-preserving communication protocols based on a tamper-proof device (TPD) in vehicular ad hoc networks (VANETs) face the challenges of master key compromise and vehicle revocation. To address these challenges, we propose a new identity-based anonymous authentication scheme. In this scheme, the master key of the system will not be directly installed in the TPD; hence, it is impossible for an adversary to obtain the system master key from the TPD. To generate the private key of the vehicle, an additional secret is required, and this secret is provided by the roadside unit (RSU). Therefore, revoking a malicious vehicle from the VANETs is efficient, since the RSU only needs to stop generating the up-to-date secret for the vehicle. In addition, the signature verification algorithm of the scheme involves no bilinear pairing operations, making the verification process more efficient. The security of the scheme is proved to be equivalent to the elliptic curve discrete logarithm assumption in the random oracle. The experimental results show that the authentication of the scheme is more efficient, and the communication cost has been diminished.

Long and Strong Security using Reputation and ECC for Cloud Assisted Wireless Sensor Networks

Wireless sensor network plays a significant role in the construction of smart cities, and the social network includes the Internet of Things, etc. In general, networks are most vulnerable of all the wireless devices due to the massive damage caused by disrupting these networks. Hence the nodes present in the network should get validated for its reputation. Therefore a Long and Strong Security mechanism with two-level checks is proposed here. Level 1 check includes verifying node reputation value and level 2 check includes Elliptical curve cryptography (ECC). Each sensor node sends the public master key to the cloud and secretly stored in the sensor node. Before data transmission, every node checks the master key, and if the master key is a match, then it transmits the data to the next hop. This process is continued until the source reaches the destination in the network.

On the educated selection of unsupervised algorithms via attacks and anomaly classes

Anomaly detection aims at finding patterns in data that do not conform to the expected behavior. It is largely adopted in intrusion detection systems, relying on unsupervised algorithms that have the potential to detect zero-day attacks; however, efficacy of algorithms varies depending on the observed system and the attacks. Selecting the algorithm that maximizes detection capability is a challenging task with no master key. This paper tackles the challenge above by devising and applying a methodology to identify relations between attack families, anomaly classes and algorithms. The implication is that an unknown attack belonging to a specific attack family is most likely to get observed by unsupervised algorithms that are particularly effective on such attack family. This paves the way to rules for the selection of algorithms based on the identification of attack families. The paper proposes and applies a methodology based on analytical and experimental investigations supported by a tool to i) identify which anomaly classes are most likely raised by the different attack families, ii) study suitability of anomaly detection algorithms to detect anomaly classes, iii) combine previous results to relate anomaly detection algorithms and attack families, and iv) define guidelines to select unsupervised algorithms for intrusion detection.

Anonymous-authentication scheme based on fog computing for VANET.

Privacy protection in vehicular ad hoc networks (VANETs) has always been a research hotspot, especially the issue of vehicle authentication, which is critical to ensure the safe communication of vehicles. However, using the real identity in the process of authentication can easily result in a leak of the privacy information of the vehicles. Therefore, most existing privacy-protection schemes use anonymous authentication and require one-to-one communication between vehicles and the trusted authority (TA). However, when the number of vehicles is too large, network congestion can take place. In addition, the process of updating the anonymous by the TA or the vehicle itself, can result in both poor real-time performance and leakage of the system master key. To solve these problems, this study proposes a fog-computing-based anonymous-authentication scheme for VANETs; the scheme reduces the communication burden of the TA by enabling self-authentication between vehicles and road-side units (RSUs), thus improving the vehicle-authentication efficiency. For updating the anonymous, we design a fog-computing-based pseudonym-updating and -tracking strategy, which guarantees real-time communication and reduces the instances of re-authentication interactions for legitimate vehicles. The experimental results show that the scheme not only meets the privacy-protection requirements of VANETs but also offers better performance than that of the existing anonymous-authentication schemes.

Leakage-free ID-Based Signature, Revisited

Abstract Recently, Tseng et al. proposed a new notion for identity-based signature (IBS) scheme to resist ephemeral secret leakage (ESL) attacks, called leakage-free identity-based signature (leakage-free IBS), and devised the first secure leakage-free IBS scheme. However, they only considered the situation of the leakage of ephemeral secrets used for generating the signatures. Notice that the private key extraction procedure is probabilistic as well in their scheme, that is, there are ephemeral secrets used by the key generation center to generate the signers’ private keys. It is practical to consider that if the adversary comprises these ephemeral secrets, then he can reveal the master key of the system. Therefore, it is desired to introduce a new security notion for the leakage-free IBS schemes to consider the ESL attacks on both private key extraction and signing procedures. In this paper, we present such security notion. Moreover, we propose two IBS schemes that are proved to be secure under the new security notion.

Performance Analysis of Different Channel Allocation Schemes of Random Access (RA) MAC Protocol with Back-Off Algorithm (BOA)

Cognitive radio technology is an effective method to improve the utilization and efficiency of radio spectrum. Cognitive radio technology solves spectrum scarcity problem by allowing cognitive users to use spectrum holes when primary users are absent. Cognitive radio networks are classified according to the infrastructure into: (A) centralized cognitive radio networks and (B) cognitive radio ad-hoc networks. The cognitive media access control (MAC) protocols are the master key of designing cognitive radio network. These allow cognitive users to identify and use the available frequency spectrum in a manner constrains the levels of interference to the primary users. Cognitive radio MAC protocols can be classified into: (A) random access control protocol (B) time slotted control protocols (C) hybrid protocols. In this paper, the dynamic open spectrum sharing (DOSS) MAC protocol is proposed as an example for random access control protocol. Due to the collision among users, the network throughput will be reduced. In order to enhance the performance of DOSS protocol, a back-off algorithm (BOA) will be executed and analyzed to enhance the network throughput. An optimum number of data retransmissions that decrease blocking and dropping ratio are investigated. Moreover, two accessing channels techniques for the proposed algorithm will be presented: fixed channel allocation (FCA) and dynamic channel allocation (DCA) schemes. DCA scheme allows to users to choose the control channel in a dynamic manner. The dynamic behavior decreases the limitation of control channel saturation. So, it can increase the network throughput. The performance analysis of the FCA and DCA schemes for the proposed protocol will be simulated. Finally, the performance analysis of DCA scheme of DOSS mac protocol with BOA will be investigated.

Secure Remote Multi-Factor Authentication Scheme Based on Chaotic Map Zero-Knowledge Proof for Crowdsourcing Internet of Things

Recently, application scenario of crowdsourcing IoT has covered to e-healthcare service, smart home, smart city, internet of vehicles due to the proliferation of smart devices such as smart mobile devices, smart wearable device, smart medical devices and smart furniture, etc. Patient's data collected by the smart devices send to the various remote medical servers. A group of medical professionals remote access patient data stored at the medical server database. Smart home users want to remote real-time access information of smart devices at home. All these operations need via wireless remote communication, which is suffering from various kinds of threat and attacks. Hence, there are a large number of multi-factor remote authentication and key agreement schemes designed for the application of crowdsourcing IoT. However, in most existing related multi-factor schemes, all factors for identity authentication only act as a parameter for encrypting the local secret key. In this paper, we propose a new secure remote multi-factor authentication scheme that includes three factors: 1) user identity; 2) password; and 3) user biometrics, which are authenticated by the remote server, act as a part of the secret key and participate in the key agreement process. We choose the chaotic map since it has a smaller key size and lower computational overhead, and then achieve remote multi-factor authentication and key agreement by artfully employ it to zero-knowledge technology and the fuzzy extractor technology. Our scheme is more secure and robust since the user revealing nothing sensitive information, and the adversary cannot impersonate any user even if he gets the server's master key. We have done security proof for our proposed scheme using the Random-Or-Real(ROR) model, Burrows-Abadi-Needham (BAN) logic, and ProVerif 2.00 to show that the presented scheme is secure. Also, we give an additional security analysis for other various attacks. Finally, according to the test and simulation result, the proposed scheme is very suitable for the power-constrained smart devices, and in the next generation 5G communication environment, its applicability and usability will be greatly enhanced.

Privacy Protection of VANET Based on Traceable Ring Signature on Ideal Lattice

With the development of the Vehicular Ad-Hoc Network (VANET), protecting user privacy while ensuring security has become an immense challenge. A ring signature has the characteristics of no manager and unconditional anonymity, which can substantially protect user privacy. However, two problems exist in practical applications: first, unconditional anonymity cannot track the signer, which has potential security risks; and second, ordinary ring signatures cannot resist quantum attacks. In response to these problems, this paper proposes a Traceable Ring Signature (TRS) scheme on ideal lattice. In the scheme, the traceability of the ring signature is achieved by adding information to the ring signature. Selecting the algorithm on the ideal lattice to generate the master key can effectively resist quantum attacks. The scheme gives a detailed security proof and efficiency analysis. The new scheme has strong unforgeability for the difficult problem of Short Integer Solution (SIS) Question and a smaller signature size.

Transitory Master Key Transport Layer Security for WSNs

Security approaches in Wireless Sensor Networks (WSNs) are normally based on symmetric cryptography. Instead of symmetric encryption, some alternative approaches have been developed by using public-key cryptography. However, the higher computational cost represents a hard limitation to their use. In this paper, a new key management protocol is proposed. A transitory symmetric key is used to authenticate nodes in the network during the key establishment. However, pairwise keys are established using asymmetric cryptography. A theoretical analysis shows that the computational effort required by the public key cryptosystem is greatly reduced, while the security of the network is increased with respect to state-of-the-art schemes based on a transitory master key. Moreover, an experimental analysis demonstrates that this proposed approach can reduce the time spent for key establishment by about 35%.

MACM: How to Reduce the Multi-Round SCA to the Single-Round Attack on the Feistel-SP Networks

Since the master key length becomes longer and longer in ciphers, an adversary often needs to preform the multi-round side channel analysis (SCA) in order to recover the master key by enough round keys. Traditional multi-round SCA is launched by adaptive manner in practice, which means that the input of each round is calculated in an on-the-fly way based on all round keys of anterior rounds. However, compared to the classical single-round SCA, the multi-round SCA in adaptive manner is severely limited in several practical scenarios, because all round keys of anterior rounds must be properly recovered before the attack against the next round. In this paper, we focus on the Feistel-SP networks, break the interdependency between the alternating measurement and analysis phases, propose a Multi-round non-Adaptive Chosen Message (MACM) approach, which can reduce the multi-round SCA to the single-round attack. In MACM, the set of plaintexts applied to multiple rounds is calculated in an off-line way. We also prove that the revealed round keys by MACM are adequate to recover the master key. Furthermore, we carefully analyze the advantages of MACM regarding to robustness and compatibility. In order to further manifest the validity of MACM, we perform extensive experiments on three typical Feistel-SP ciphers, Camellia, CLEFIA and SM4, the master keys are recovered as expected, and the number of traces in MACM is at least 25% less than that in the adaptive manner.

Strong and Weak Hydrogen Bonds in Protein–Ligand Recognition

The hydrogen bond has justifiably been termed the ‘master key of molecular recognition’. It is an interaction that is weaker than the covalent bond and stronger than the van der Waals interaction. The ubiquity and flexibility of hydrogen bonds make them the most important physical interaction in systems of biomolecules in aqueous solution. Hydrogen bonding plays a significant role in many chemical and biological processes, including ligand binding and enzyme catalysis. In biological processes, both specificity and reversibility are important. Weaker interactions can be made and broken more easily than stronger interactions. In this context, it is of interest to assess the relative significance of strong and weak interactions in the macromolecular recognition processes. Is protein–ligand binding governed by conventional, that is, electrostatic N–H…O and O–H…O hydrogen bonds, or do weaker interactions with a greater dispersive component such as C–H…O hydrogen bonds also play a role? If so, to what extent are they significant? Most proteins, involving as they do, main chains, side chains, and differently bound forms of water, do not really have a static fixed structure, but rather have a dynamic, breathing nature. This tendency may to some extent be lessened by the ligands which are small molecules, but in the end, it is reasonable to expect that the strong and weak hydrogen bonds inside the protein and also at the protein–ligand interface will also have dynamic character; arguably, the weaker the hydrogen bond, the greater its dynamic character. These are often central to the much debated mechanisms of binding such as conformational selection and induced fit. All protein–ligand interactions must compete with interactions with water; both the protein and the ligand are solvated before complexation and lose their solvation shell on complex formation. Conversely, the entropic cost of trapping highly mobile water molecules in the binding site is large. However, in favorable cases, these losses are suitably compensated by the enthalpic gain resulting from water-mediated hydrogen bonds. In effect, the enthalpy–entropy balance is a fine one, and for a water molecule to be able to contribute to binding affinity, it has to be in a binding site that provides the maximum number of hydrogen-bond partners at the optimum distance and orientation. In summary, hydrogen bonds are crucial to the recognition of ligands by proteins. Integration of knowledge gained from more high-quality protein–ligand structures into theoretical and computational molecular models will be an exciting challenge in the coming years.

Scheme Construction of VR Cloud Integration Intelligent System Based on Internet of Things

With the rapid development of mobile Internet and intelligent terminals, the privacy data generated by mobile applications is increasing. Because of the limited computing and storage capacity of mobile intelligent terminals, the security measures designed for traditional network terminal devices are not suitable for mobile intelligent terminals. This paper analyses the current application situation of virtual reality technology and Internet of Things technology and the bottleneck of engineering application and popularization, and probes into relevant problems. On this basis, a new model of intelligent system based on virtual reality and Internet of Things is proposed. The extended Spice protocol provides efficient support for front-end separation of displays and calculations. The encryption master key is generated by splicing the keys generated by the authentication cloud and the mobile intelligent terminal, and the master key is used to effectively prevent the mobile intelligent terminal and the cloud storage server from leaking the privacy data of the mobile user. Realize the unified management, flexible deployment, flexible delivery and automatic operation and maintenance of basic resources, and promote the transformation of application deployment from applying for equipment to applying for service.

Algebraic Differential Fault Analysis on SIMON Block Cipher

Algebraic differential fault attack (ADFA) is an attack in which an attacker combines a differential fault attack and an algebraic technique to break a targeted cipher. In this paper, we present three attacks using three different algebraic techniques combined with a differential fault attack in the bit-flip fault model to break the SIMON block cipher. First, we introduce a new analytic method which is based on a differential trail between the correct and faulty ciphertexts. This method is able to recover the entire master key of any member of the SIMON family by injecting faults into a single round of the cipher. In our second attack, we present a simplified Grobner basis algorithm to solve the faulty system. We show that this method could totally break SIMON ciphers with only 3 to 5 faults injected. Our third attack combines a fault attack with a modern SAT solver. By guessing some key bits and with only a single fault injected at the round $T - 6$T-6, where $T$T is the number of rounds of a SIMON cipher, this combined attack could manage to recover a master key of the cipher. For the last two attacks, we perform experiments to demonstrate the effectiveness of our attacks. These experiments are implemented on personal computers and run in very reasonable timing.

APEX, a Master Key To Resolve Membrane Topology in Live Cells.

Determining the topology of the membrane proteome is fundamental for understanding its function at the membrane. However, conventional methods involving test tube reactions often lead to unreliable results, which do not accurately reflect membrane topology under physiological conditions, as perturbations occur during lysis. In this Perspective, we introduce a new method using engineered ascorbate peroxidase (APEX) for revealing membrane topological information in live cells without performing complicated sample preparation. We also discuss several examples of clearly resolved membrane topologies of various important mitochondrial proteins (e.g., LETM1, NDUFB10, MCU, SFXN1, and EXD2) and endoplasmic reticulum proteins (e.g., HMOX1) determined by using APEX-based methods.

TACKLE: A phase II study of alectinib in patients with unresectable rare cancer harboring ALK alterations (NCCH1712)

Abstract Background ALK (anaplastic lymphoma kinase) activation in cancer was discovered in anaplastic large-cell non-Hodgkin’s lymphoma, followed by non-small cell lung cancer. Since then, several human cancers have reported to present ALK alterations, such as translocation, overexpression and mutation. ALK-tyrosine kinase inhibitors are reported to be effective in some of these cancers. Methods TACKLE (NCCH1712/MK003) is a phase II study designed to evaluate efficacy and safety of alectinib in patients with ALK-positive advanced rare cancer. This study is conducted as part of the MASTER KEY project, which is a basket/umbrella trial including a registry study for rare cancers (UMI27552). ALK-positive was defined as follow, 1) translocation, 2) activating mutation, 3) overexpression. Rare cancer was defined as annual incidence Clinical Trial Information JMA-IIA00364

ROCK Trial (NCCH1709): Nivolumab monotherapy in Rare cancer patients with mismatch repair deficiency biomarker: phase II

Abstract Background Mismatch repair deficiency (dMMR) / microsatellite instability-high (MSI-H) in cells lead to neoplastic development and progression, an important feature in Lynch syndrome. dMMR/MSI-H is a positive predictive marker for immune checkpoint inhibitors. Nivolumab is a PD-1 inhibitor, approved in the US for pts with dMMR/MSI-H colorectal cancers. Other than colorectal cancers, a subset of rare cancers also share this characteristic. Methods This is a phase 2, open-label, single arm study designed to investigate the efficacy and safety of nivolumab monotherapy in patients with advanced rare tumors with dMMR/MSI-H. This study is conducted as part of the MASTER KEY Project, which is a basket/umbrella trial including a registry study for rare cancers (UMI27552). dMMR was identified by a negative immunohistochemical staining of one of the following: MLH1, MSH2, MSH6, PMS2. Rare cancer was defined as annual incidence Clinical Trial Information JMA-IIA00344

Basket trials for regulatory approval of rare cancer drugs in Japan

Abstract A basket trial in oncology enrolls patient populations with a specific molecular status among several cancer types and often evaluates the treatment effect of an investigational agent across cancer types. MASTER KEY Project that is a platform trial with a registry study for rare cancers established by National Cancer Center Hospital in Japan includes several single-arm basket trials for rare cancers to evaluate the response rate of the targeted agents across the cancer types of interest. Novel cancer drugs for rare cancers have been occasionally approved with evidence from a single pivotal trial alone in Japan. Applicants consider to propose new drug application (NDA) based solely on the result of one pivotal basket trial; however, the difficulty lies the in the statistical evaluation of response rate across cancer types because of the limited sample size of basket trials. In this presentation, the recent advance of statistical methodologies for basket trials is overviewed and regulatory challenges we face in Japan are also introduced as well as the accelerated review system.

441O - A platform trial with a registry study for rare cancers: MASTER KEY project

BackgroundRare cancers have had a challenge in establishing standard therapies for patients compared to major cancers, due to the lack of basis for clinical studies and investigations. We started a biomarker driven basket/umbrella trial using a “master protocol”, called the MASTER KEY Project, which aims to find more efficient ways to evaluate treatments for rare cancers. MethodsThe project opened in April 2017 and consists of a prospective registry study part and a multiple clinical trials part. Patients with advanced rare cancers (annual incidence <6 / 100,000 population)/cancers of unknown primary/rare tissue subtypes of common cancers, undergoing a molecular diagnostic testing are enrolled. The primary objective of the registry study is to collect consecutive data on biomarker, patient background, and prognosis to build a database highly reliable for use as historical control data in future clinical trials. Sub-studies are placed under a “master protocol”, and each sub-study will enroll patients with the appropriate biomarker, regardless of tumor type. ResultsAs of Feb. 2019, 515 patients were enrolled in the project, and 493 were available for their backgrounds. Most frequent cancer types were: soft tissue sarcomas (33.7%), neuroendocrine tumors (7.3%), tumors of CNS (5.9%), salivary gland tumors (4.5%), etc. 346 patients had next generation sequencing testing results. The most common alterations were TP53 (32.4%), KRAS (10.4%), PIK3CA (9.5%), MDM2 (5.2%), CDK42 (4.9%), CDKN2A (4.9%), and RB1 (4.9%). 278 patients already had 6 months follow-up, and 116 patients received 181 systemic chemotherapy regimens after enrollment. Of those regimens, 25 were biomarker-based therapies, and median progression free survival was 8.1 months compared to 4.8 months with other cytotoxic chemotherapy regimens (Hazard ratio 0.61; 95% confidential interval 0.32-1.07). ConclusionsMASTER KEY Project is one of the largest platform trials focused only on rare cancers. The project provided the chance for rare cancer patients to receive biomarker-based treatment, and it showed better prognosis. This is a continuous project aimed to accelerate treatment development for rare cancers, with clinical trials directed towards new drug approvals. Clinical trial identificationUMIN000027552. Legal entity responsible for the studyThe authors. FundingAstellas Pharma, Bristol-Myers Squibb, Chugai Pharmaceutical, Daiichi Sankyo, Eisai, Kyorin Pharmaceutical, Novartis Parma, Ono Pharmaceutical, Otsuka Pharmaceutical, Pfizer, Taiho Pharmaceutical and Takeda Pharmaceutical. DisclosureAll authors have declared no conflicts of interest.