Key Verification Research Articles

Ephemeral Keys Authenticated with Merkle Trees and Their Use in IoT Applications.

Public key algorithms based on quasi-cyclic binary moderate-density parity-check codes (QC-MDPCs) and QC low-density parity-check codes (QC-LDPCs) codes for key encapsulation and encryption submitted to the NIST post-quantum competition (Bit Flipping Key Encapsulation (BIKE), QC-MDPC KEM, LEDA) are vulnerable against reaction attacks based on decoding failures. To protect algorithms, authors propose to limit the key usage, in the extreme (BIKE) to only use ephemeral public keys. In some authenticated protocols, we need to combine each key with a signature, which can lead to increased traffic overhead, especially given the large signature sizes of some of the proposed post-quantum signature schemes. We propose to combine ephemeral public keys with a simple Merkle tree to obtain a server authenticated key encapsulation/transport suitable for TLS-like handshake protocols. This allows a very simple public key verification on the client, leading to efficient protocols suitable for Internet of Things applications.

Opposition Based Joint Grey Wolf-Whale Optimization Algorithm Based Attribute Based Encryption in Secure Wireless Communication

At present times, medical image security becomes a hot research topic in the healthcare sector. This paper presents an efficient lightweight image encryption model based on the Dynamic key generating Attribute based encryption (ABE) method with Opposition based joint Grey Wolf-Whale Optimization Algorithm (OjGW-WOA). The proposed encryption method undergoes certain pre-encryption steps like rotation and random column addition steps. Once the pre-encryption steps are done, ABE with OjGW-WOA is incorporated, where the optimal key is generated based on entropy value. In addition, the oppositional based learning concept is introduced to enhance the convergence rate and searching process of GWO and WOA algorithms. Next, the proposed encryption method is designed with a dynamic key generating model that generates updated keys during every time period. Therefore, during decryption, two-level key verification is done. At the first decryption stage, the key corresponding to that particular time period is required, then the original key is generated from that key and then employed for decrypting the original data. The proposed method is simulated using MATLAB tool and a detailed comparative results analysis is carried out. The performance of the proposed work is validated with the aid of performance metrics like Peak Signal to Noise Ratio (PSNR), number of changing pixel rate (NPCR) and unified averaged changed intensity (UACI). The experimental results stated that the presented model has resulted to a higher PSNR of 62.29 dB, NPCR of 99.23%, and UACI of 23.67%.

Broadcast Proxy Reencryption Based on Certificateless Public Key Cryptography for Secure Data Sharing

Broadcast proxy reencryption (BPRE), which combines broadcast encryption (BE) and proxy reencryption (PRE), is a technology used for the redistribution of data uploaded on the cloud to multiple users. BPRE reencrypts data encrypted by the distributor and then uploads it to the cloud into a ciphertext that at a later stage targets multiple recipients. As a result of this, flexible data sharing is possible for multiple recipients. However, various inefficiencies and vulnerabilities of the BE, such as the recipient anonymity problem and the key escrow problem, also creep into BPRE. Our aim in this study was to address this problem of the existing BPRE technology. The partial key verification problem that appeared in the process of solving the key escrow problem was solved, and the computational efficiency was improved by not using bilinear pairing, which requires a lot of computation time.

WITHDRAWN: Product key activation for software products using Collatz Conjuncture and asymmetric key cryptography

Abstract Nowadays, almost all software products are sold online. But there is a danger of unauthorized users using the product. For this reason, every company employs a product activation system where only authorized users that have a unique key called the product key can use the application. But attackers always find a way to get past the authorization. For example, they use a key generator that generates a random key that matches the format of the product key and can be used to activate the product. Therefore, to avoid this, we need improved product activation programs that can safeguard the product from unauthorized users. This paper proposes an improved key verification system to make sure that the product can be used on one system only. Every system has a unique MAC address, and that's what we use as the foundation for our method. The main contribution of this work is the effective use of a system's MAC address, which in turn boosts the security of the project. The necessary procedure consists of retrieving a MAC address from the user's system. Now, a serial key is derived by performing specific operations on the MAC address, which is then converted into a more straightforward, user-friendly product key while encryption and decryption take place during the transmission of keys between client and server. Looking ahead, this work can lead to better and consistent use of MAC addresses in key generation techniques, which is something that hasn't been explored enough.

Study on Trusted Computing and Measurement Certification Technology of On-Board Operating System

Based on the complexity of space environment and the limitation of space resources, a dynamic metric authentication method for spaceborne operating system with the trusted chip support is proposed, and the configurable key metric object identification scheme and verification strategy are given. In this method, Key measurement objects and measurement strategies can be set according to the key level of on-board application. The critical application processes in operation can be measured and verified periodically, then a system security protection verification mechanism for on-board software is obtained. The experimental results show that the dynamic measurement method improves the reliability of the system, and the performance meets the requirements of on-board applications, which has great practical value.

Implementation of Novel Methodology using Secured Accessibility of Data’s using Public and Private Key Verification Process with Steganography

Distributed computing has a significant job in the improvement of business frameworks. It empowers organizations like Microsoft, Amazon, IBM and Google to convey their administrations for a huge scope to its clients. A cloud specialist organization oversees distributed computing based administrations and applications. For any association a cloud specialist co-op (CSP) is an element which works inside it. So it experiences vulnerabilities related with association, including interior and outer assaults. So its test to association to verify a cloud specialist co-op while giving nature of administration. Property based encryption can be utilized to furnish information security with ciphertext strategy trait based encryption (CP-ABE). Be that as it may, ABE plans has absence of versatility and adaptability for giving Hierarchical CP-ABE plot is proposed here to give fine grained get to control. Information security is accomplished utilizing encryption, validation and approval components. Property key age is proposed for executing approval of clients. The proposed framework is proposes to consolidate cryptography with steganography in such a manner by installing crypto content into a picture to give expanded degree of information security and information proprietorship for imperfect interactive media applications. It makes it harder for a cryptanalyst to recover the plaintext of a mystery message from a stego-object if steganalysis were not utilized. This plan essentially improved the information security just as information protection.

Accessibility Utilizing Private Key Verification with Steganography over Difference Methods of Secure Information

Cloud is the normally utilized file to store, transmit, get and share mixed media substance. Cloud utilizes web to play out these undertakings because of which information turns out to be increasingly inclined to assaults. Information security and protection are compromised. This can be kept away from by constraining information access to confirmed clients and by concealing the information from cloud benefits that can't be trusted. Concealing information from the cloud administrations includes scrambling the information before putting away it into the cloud. Information to be imparted to different clients can be encoded by using Cipher Text-Policy Attribute Based Encryption (CP-ABE). CP-ABE is utilized which is a cryptographic method that controls access to the scrambled information. The matching put together calculation based with respect to bi-linearity is utilized in ABE because of which the prerequisites for assets like memory and force supply builds rapidly. Most of the gadgets that we use today have restricted memory. Therefore, a productive blending free CP–ABE get to control plot utilizing elliptic bend cryptography has been utilized. Blending based calculation is supplanted with scalar item on elliptic bends that lessens the important memory and asset prerequisites for the clients. Despite the fact that matching free CP-ABE is utilized, it is simpler to recover the plaintext of a mystery message if cryptanalysis is utilized. Along these lines, this work proposes to consolidate cryptography with steganography in such a manner by installing crypto content into a picture to give expanded degree of information security and information proprietorship for problematic sight and sound applications. It makes it harder for a cryptanalyst to recover the plaintext of a mystery message from a stego-object if steganalysis were not utilized. This plan fundamentally improved the information security just as information protection.

RETRACTED ARTICLE: R2R-CSES: proactive security data process using random round crypto security encryption standard in cloud environment

Cloud service provide the information security to protect the data using broad set of privacy policies and controls. Various security mechanisms concentrates the reality of key leakage issues to deal the security policy. The problem arise due to the leakage of data from attackers which leads the time factor of creating vulnerabilities and information loss. So information security in the cloud needs higher security crypto policy standards to make effective privacy protection. The cloud security service provider’s intent the proactive security standard to make the higher security in cryptographic encryption techniques. To propose a standard two-phase implementation of Round-key and random key based crypto security encryption standard (R2R-CSES) for improving security system in a cloud environment. R2R provides the high-level implementation of security protection using key verification policy. This service makes the random encryption using proactive security encryption with round random crypto policy holds key applicable standards with cloud authenticator policy. The projection of our results estimates the advanced encryption standard with key substitution make effective security to prevent vulnerabilities. The optimization produces least time complexity with service access to provide the security mechanism in high standard.

An enhanced approach for three factor remote user authentication in multi - server environment

With the agile development of the Internet era, starting from the message transmission to money transactions, everything is online now. Remote user authentication (RUA) is a mechanism in which a remote server verifies the user’s correctness over the shared or public channel. In this paper, we analyze an RUA scheme proposed by Chen for the multi-server environment and prove that their scheme is not secured. We also find numerous vulnerabilities such as password guessing attack, replay attack, Registration Center (RC) spoofing attack, session key verification attack, and perfect forward secrecy attack for Chen’s scheme. After performing the cryptanalysis of Chen’s scheme, we propose a biometric-based RUA scheme for the same multi-server environment. We prove that the proposed authentication scheme achieves higher security than Chen’s scheme with the use of informal security analysis as well as formal security analysis. The formal security analysis of the proposed scheme is done using a widely adopted random oracle method.

Adaptive Compiler Strategies for Mitigating Timing Side Channel Attacks

Existing compiler techniques can transform code to make its timing behavior independent of sensitive values to prevent information leakage through time side channels. Those techniques are hampered, however, by their static nature and dependence on details of the processor targeted during the compilation. This paper presents a dynamic compiler approach based on offline profiles and JIT compiler strategies. This approach reduces overhead significantly and enables a trade-off between provided protection and overhead. Furthermore, it supports adaptive policies in which the protection adapts to run-time changes in the requirements. A prototype implementation in the Jikes Research VM is evaluated on RSA encryption, HMAC key verification, and IDEA encryption.

A Hybrid Key Generation and a Verification Scheme

By introducing high randomness with reduced computational cost, physical layer (PHY) key generation is one of the candidate tools that can be used for the security of the Internet of Things applications. Nonidentical secret keys are one of the main problems of the physical layer (PHY) key generation schemes. In order to address this problem, key verification schemes, which are based on information reconciliation, are used in this article. In the current key verification techniques, the legitimate nodes reveal some information related to their secret keys to eliminate nonidentical bits. In this article, by jointly using PHY key generation with an embedded key, we propose a hybrid key generation and key verification scheme, where the revealed information during the key verification process is negligible, and the verified keys are identical. Numerical results and software-defined radio-based tests show that the proposed verification scheme achieves the requirements of the Industrial Internet of Things systems.

Leaving benefits on the table: Evidence from SNAP

Many social insurance programs require that beneficiaries periodically re-verify eligibility, allowing officials to identify ineligible applicants but risking the loss of eligible applicants who do not complete these requirements. While many states have invested in simplified verification procedures to reduce that risk, the extent of exit among eligible beneficiaries and the efficacy of these simplifications is not well established. This paper uses administrative data from the Supplemental Nutrition Assistance Program (SNAP) to establish three facts. First, retention in SNAP is low, with approximately one-half of entering cases leaving in the first year. Second, qualitative evidence and quantitative simulations suggest that approximately half of those who exit in the first year remain eligible. Third, using the staggered roll-out of an online case management tool in Michigan, I find that this simplification reduced the rate of long-term exit at key verification dates by almost 2pp (12%). These facts suggest that eligible retention is very incomplete, and that ongoing simplification efforts increase retention among eligible beneficiaries.

Keystroke Dynamics: Establishing Keyprints to Verify Users in Online Courses

This study examined the potential use of keystroke dynamics to create keyprints (typing fingerprints) to authenticate individuals in online courses. Previous studies have determined that keystroke typing patterns are unique; in addition to replicating these findings, this study explored best practices for implementing keyprint signatures in situations other than simple password or key phrase verification. While authentication can be difficult when attempting to correctly identify individual users, the results of this study indicate that keyprints can reliably indicate negative cases (a typing sample that is likely not the intended student). The results of this study suggest that complete keyprint signatures are better than keyprint profiles (reduced keyprints based on unique typing patterns only). Results also suggest that keyprint signatures are most reliable when a variety of methods are used to obtain keyprint data (i.e., both copy typing and free typing). Small comparison samples increase the challenge of identification but do not prevent the system from identifying negative cases.

A Key Verification Protocol for Quantum Key Distribution

Sharing a secret key between two physically separated nodes, Alice and Bob, is possible through the use of quantum key distribution (QKD) techniques. In the presence of an eavesdropper, Alice's key may not be identical with Bob's key, due to the characteristics of a quantum channel. To obtain identical keys at Alice and Bob, we propose a block-based key verification protocol that relies on Newton's polynomial interpolation. As the nodes solely share random numbers and indices of the removed blocks, no information is revealed about the secret message, at a cost of higher computational complexity. The error propagation through the key verification process is prevented by the characteristics of the proposed approach.

用于引力波关键技术验证的近地低成本商业卫星设计

用于引力波关键技术验证的近地低成本商业卫星设计

Signature Verification and Bloom Hashing Technique for Efficient Cloud Data Storage

Cloud computing is a one of the network-based computing that provides services to computer and other cloud devices. Secure cloud data storage is a significant when using the cloud services provided by the service provider in cloud environment. Many research works have been developed to provide secure wireless communication in cloud. However, integrity verification of stored data on cloud was not addressed in an efficient manner. In order to overcome above limitations, bloom hashing based Schnorr signature (BH-SS) technique is proposed. In BH-SS technique, at first, the cloud users send the request to cloud server and it response the user requested data. Next, bloom hash function is used to increase the integrity of cloud data storage. Bloom hash function is an efficient data structure used for storing the data and its hashed value. Bloom hash function stores the various cloud user data in it bits of array by generating hash value for each cloud data. Each data has the diverse hash value in bit array. This helps for BH-SS technique to improve the data integrity and dynamic data storage in cloud environment. Lastly, BH-SS technique employed Schnorr signature to ensure confidentiality of stored data with the aid of producing private signing key and public verification key. Therefore, proposed BH-SS technique improves the data integrity rate and reduces execution time. The BH-SS technique conducts experimental works on the parameters such as data integrity, space complexity, execution time and data confidentiality rate. The experimental results observe that the BH-SS technique is able to enhance the cloud data integrity and also reduces the execution time of cloud storage and space complexity when compared to state-of-the-art-works.

Dual-satellite integrated intelligent reconnaissance autonomous decision-making model

Aiming at aerospace remote sensing technology, this paper proposes a dualsatellite integrated intelligent reconnaissance decision-making model, and establishes a doublesatellite system. One satellite is used for “general investigation” and one satellite is used for “detailed investigation”. The target is carried out by general investigation load. Track identification provides guidance for detailed inspection loads, thereby improving the accuracy, real-time, flexibility and intelligence of space remote sensing. The focus is on three aspects: investigation model design, key algorithm research and semi-physical simulation verification. The reconnaissance model design completes the conceptual design and process demonstration of the model. The key algorithm research part completes the research of the fast detection based on deep learning and the key algorithm of load imaging strategy decision in the system. The satellite semi-physical simulation verification is carried out by constructing the semi-physical simulation verification system.

Standardizing by Running Code: The Signal Protocol and De Facto Standardization in End-to-End Encrypted Messaging

In the wake of the Snowden revelations, encryption of communications at a large scale and in a ‘usable’ manner has become a matter of public concern. This turning of encryption into a ‘political’ issue, coupled with seminal secure messaging protocols such as PGP (Pretty Good Privacy) and OTR (Off-the-Record Messaging) starting to show their age in terms of security and usability, has led to renewed efforts by the cryptography community (in particular by academic and free software colectives) to create next-generation secure messaging protocols. One of the leading motivations behind this effort consisted to facilitate key exchange and key verification process, previously identified as the main obstacles to the mass adoption of encryption (Whitten & Tygar, 1999). The most advanced and popular of these next generation protocols is currently the Signal Protocol (formerly Axolotl, firstly introduced in Signal and adopted or forked by other instant messaging applications, ranging from WhatsApp and Wire to Matrix and Conversations). While the Signal protocol is widely adopted and considered as an improvement over both OTR and PGP, it remains officially unstandardized, even though there is an informal draft elaborated towards that goal by the protocol’s creators, Trevor Perrin and Moxie Marlinspike. This paper analyses the reasons behind this absence of official standardization and explores how and why, in parallel, a de facto standardization process is happening in the field of end-to-end encrypted messaging that mostly revolves around the development and adoption of the Signal protocol. Drawing from an ongoing three-year investigation, from an STS perspective, of end-to-end encrypted messaging, we seek to unveil the ‘subtle’ processes that make the Signal protocol a quasi-standard. In its conclusions, the paper seeks to comment on the governance implications of this quasi-standardization process, both for the end-to-end encrypted messaging field and for the main existing Internet governance standardization bodies, such as the IETF.

Verification of User Interface Software: The Example of Use-Related Safety Requirements and Programmable Medical Devices

One part of demonstrating that a device is acceptably safe, often required by regulatory standards, is to show that it satisfies a set of requirements known to mitigate hazards. This paper is concerned with how to demonstrate that a user interface software design is compliant with use-related safety requirements. A methodology is presented based on the use of formal methods technologies to provide guidance to developers about addressing three key verification challenges: 1) how to validate a model, and show that it is a faithful representation of the device; 2) how to formalize requirements given in natural language, and demonstrate the benefits of the formalization process; and 3) how to prove requirements of a model using readily available formal verification tools. A model of a commercial device is used throughout the paper to demonstrate the methodology. A representative set of requirements are considered. They are based onUS Food and Drug Administration (FDA) draft documentation for programmable medical devices, and on best practice in user interface design illustrated in relevant international standards. The methodology aims to demonstrate how to achieve the FDA's agenda of using formal methods to support the approval process for medical devices.

Robust Biometric-based Anonymous User Authenticated Key Agreement Scheme for Telecare Medicine Information Systems

At present, numerous hospitals and medical institutes have implemented Telecare Medicine Information Systems (TMIS) with authentication protocols to enable secure, efficient electronic transactions for e-medicine. Numerous studies have investigated the use of authentication protocols to construct efficient, robust health care services, and recently, Liu et al. presented an authenticated key agreement mechanism for TMIS. They argued that their mechanism can prevent various types of attacks and preserve a secure environment. However, we discovered that Liu et al.`s mechanism presents some vulnerabilities. First, their mechanism uses an improper identification process for user biometrics; second, the mechanism is not guaranteed to protect against server spoofing attacks; third, there is no session key verification process in the authentication process. As such, we describe how the above-mentioned attacks operate and suggest an upgraded security mechanism for TMIS. We analyze the security and performance of our method to show that it improves security relative to comparable schemes and also operates in an efficient manner.