Public Key Research Articles

Performance comparison of quantum-safe multivariate polynomial public key encapsulation algorithm

A novel quantum-safe key encapsulation algorithm, called Multivariate Polynomial Public Key (MPPK), was recently proposed by Kuang, Perepechaenko, and Barbeau. Security of the MPPK key encapsulation mechanism does not rely on the prime factorization or discrete logarithm problems. It builds upon the NP-completeness of the modular Diophantine equation problem, for which there are no known efficient classical or quantum algorithms. Hence, it is resistant to known quantum computing attacks. The private key of MPPK comprises a pair of multivariate polynomials. In a companion paper, we analyzed the performance of MPPK when these polynomials are quadratic. The analysis highlighted the MPPK high decapsulation time. We found that, while maintaining the security strength, the polynomials can be linear. Considerable performance gains are obtained for the decapsulation process. In this article, we benchmark the linear case and compare the results with the previous quadratic case.

Ad Hoc Broadcast, Trace, and Revoke

Traitor tracing schemes [Chor–Fiat–Naor, Crypto ’94] help content distributors fight against piracy and are defined with the content distributor as a trusted authority having access to the secret keys of all users. While the traditional model caters well to its original motivation, its centralized nature makes it unsuitable for many scenarios. For usage among mutually untrusted parties, a notion of *ad hoc* traitor tracing (naturally with the capability of broadcast and revocation) is proposed and studied in this work. Such a scheme allows users in the system to generate their own public/secret key pairs, without trusting any other entity. To encrypt, a list of public keys is used to identify the set of recipients, and decryption is possible with a secret key for any of the public keys in the list. In addition, there is a tracing algorithm that given a list of recipients’ public keys and a pirate decoder capable of decrypting ciphertexts encrypted to them, identifies at least one recipient whose secret key must have been used to construct the said decoder. Two constructions are presented. The first is based on functional encryption for circuits (conceptually, obfuscation) and has constant-size ciphertext, yet its decryption time is linear in the number of recipients. The second is a generic transformation that reduces decryption time at the cost of increased ciphertext size. A matching lower bound on the trade-off between ciphertext size and decryption time is shown, indicating that the two constructions achieve all possible optimal trade-offs, i.e., they fully demonstrate the Pareto front of efficiency. The lower bound also applies to broadcast encryption (hence all mildly expressive attribute-based encryption schemes) and is of independent interest.

Public-Key Authenticated Encryption with Keyword Search Made Easy

Public-key searchable encryption allows keyword-associated tokens to be used to test if a ciphertext contains specific keywords. Due to the low entropies of keywords, the token holder can create ciphertexts from candidate keywords and test them using the token in hand to recover the keywords, known as inside keyword guessing attacks (IKGA). Public-key authenticated encryption with keyword search is a searchable encryption proposed to defend against such attacks. It ensures the sender's private key protects the ciphertexts from the IKGA. PAEKS schemes with reasonable security and practical efficiency remain elusive despite many proposals. This work provides a simple generic PAEKS scheme from non-interactive key exchange (NIKE) and symmetric-key equality-predicate encryption with three new constructions for the latter, respectively from pseudorandom functions (PRFs), the decision bilinear Diffie-Hellman assumption, and the learning-with-errors assumption. Instantiating our generic scheme, we derive several PAEKS schemes from the most well-known assumptions, with some of them achieving full cipher-keyword indistinguishability and full token indistinguishability in the standard model, for the first time. Our instantiated schemes allow practical implementations and outperform the existing PAEKS schemes under the same assumptions.

Lattice-Based Post-Quantum Public Key Encryption Scheme Using ElGamal’s Principles

Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems. Quantum computing threatens RSA and ECC with algorithms like Shor’s algorithm, which can accelerate computations exponentially. This risks exposing these systems to attacks, necessitating quantum-resistant cryptography. Cloud computing poses data security concerns, requiring robust cryptographic mechanisms and access controls. Lattice-based cryptography, leveraging problems like the Short Integer Solution (SIS), emerges as a solution. This paper presents a novel quantum-resistant public key encryption scheme based on ElGamal and SIS, ensuring security against quantum and classical threats in modern cryptographic environments.

Advancing IoT security with flame: A hybrid approach combining fuzzy logic and artificial lizard search optimization

The increasing usage of Internet of Things (IoT) devices has created a need for secure and efficient solutions to protect sensitive data from unauthorized access. However, the complicated and massive structure of IoT systems poses various security risks and challenges, especially in dynamic scenarios with high signaling overhead caused by subscriber mobility. So, in this paper, a Fuzzy-based Lightweight Authentication and Management of Encryption approach called ‘FLAME’ is proposed to solve the decentralized lightweight group key management problem by measuring the degree of security using fuzzy logic (FL) based on various factors like device and user behavior, network conditions, and resource availability. For effective key-based authentication, adopted an Artificial Lizard Search Optimization (ALSO) based RSA (Rivest, Shamir, Adleman) algorithm that generates private and public keys based on security evaluation outcome. The publishers and subscribers obtain encryption keys from the group key manager based on their security level, and dissemination is optimized by the ALSO algorithm. By leveraging the FL and ALSO based RSA algorithm, the system offers secure communication with limited utilization and protects confidential data in IoT environments. According to the analysis, results signify that the FLAME approach has a faster key generation, dissemination, and revocation time compared to existing approaches, along with reduced overhead during key management operations, and increased attack detection capacity of 98.7 %.

Auditable and dynamic access control scheme with behavior and identity tracing

Ciphertext policy attribute-based encryption (CP-ABE) is a potential solution to security sharing issues since it offers one-to-many encryption and fine-grained access control. To prevent users from disclosing their access permissions, traceable CP-ABE schemes are emerging. However, the current traceable CP-ABE schemes still have some security problems, such as impromptu attribute retracting, unreliable tracking, and easy disclosure of access policy privacy, making it essential to implement dynamic data security sharing and malicious user auditing. To address these issues, we propose an auditable and dynamic access control scheme with behavior and identity tracing. The scheme first uses an access tree with hidden leaf nodes to express the access policy, improving the flexibility and security of access control. Secondly, the Blockchain and InterPlanetary File System (IPFS) frameworks perform the audit authentication and store the ciphertext, policy, and public keys to avoid tampering with shared data. Furthermore, to prevent users from leaking their decryption keys, a tracing algorithm based on white-box traceability is developed. On this basis, an authority update algorithm is proposed to revoke the malicious user’s permission immediately and update the decrypted key for unrevoked users. An auditable smart contract based on blockchain is proposed to prevent user denial. Finally, theoretical analyses prove that the proposed scheme not only achieves traceability, revocation, authority updating, policy hiding, and audit, but also guarantees security under a chosen plaintext attack model. Experiments demonstrate that our proposal reduces the key generation time by 22.6%, the encryption and decryption time by 39.2% and 59.8%, and the storage costs of ciphertext and private key are reduced by 12.1% and 5.6% over existing schemes.

Privacy-Preserving Decentralized Functional Encryption for Inner Product

To support secure data mining and privacy-preserving computation, partial access and selective computation on encrypted data are desirable. Functional encryption (FE) is a new paradigm of public-key encryption and allows authorized users to compute specific functions on encrypted data without knowing the data. However, in some FE schemes, a trusted central authority (CA) is required to generate secret keys for users according to the description of functions. In this paper, to reduce trust on the CA and protect users' privacy, a privacy-preserving decentralised FE for inner product (PPDFEIP) scheme is proposed where multiple authorities co-exist and work independently without any interaction. Especially, to resist collusion attacks, all secret keys of the same user are tied to his/her global identifier (GID), but authorities cannot know any information of the GID even if they collaborate. We formalize the definition and security model of our PPFEIP scheme, and propose a concrete construction. Furthermore, the proposed scheme is implemented and evaluated. Finally, the security of our PPDFEIP scheme is reduced to well-known complexity assumptions. The novelty is to reduce trust on the CA, protect users' privacy and enable authorized users to compute inner product on encrypted data without compromising confidentiality.

Quantum Cryptography for Enhanced Data Security: A Comparative Survey of Data Encryption and Decryption of Error Correction

Data information security is a crucial concern that ought to be managed to help protect vital data. Cryptography is one of the conventional approaches for securing data and is generally considered a fundamental data security component that provides privacy, integrity, confidentiality, and authentication. In this paper, a comparative survey of Rivest-Shamir-Adleman (RSA) data security algorithm is proposed in order to compare their security strength. In doing so, we integrate traditional RSA and Gaussian Interpolation formulas to test their security level. The integration raised the security strength of RSA to the fifth degree,while the Gaussian First Forward Interpolation was used to encrypt the ASCII values of the message after which the traditional RSA was used to encrypt and decrypt the message in the second and third levels. Comparative data security analysis was performed using four different algorithms; RSA, SRNN, 2-Key pair algorithms, and the results showed that when the data size was small, the encryption and decryption times were lower for the proposed algorithm but higher when the data size was big. Thus the two public keys used and some mathematical relations made the eavesdropper not to get much knowledge about the key and therefore, unable to decrypt the message.

Communication security of intelligent information service platform combining AES and ECC algorithms

ABSTRACT The rapid progress of information technology has made the status of information service platforms increasingly prominent in social operations. However, their communication security is also facing unprecedented challenges. In response to the issues of insufficient security and efficiency in traditional encryption algorithms, this study combines advanced encryption standard algorithms with elliptic curve cryptography algorithms to generate encryption key pairs through elliptic curve cryptography algorithms. It utilizes advanced encryption standard algorithms to generate symmetric keys, and then encrypts the keys of the advanced encryption standard using the public key of the elliptic curve cryptography algorithm. Based on this, it implements advanced encryption standard encryption on data and designs a hybrid encryption algorithm. The results showed that the throughput of this method was 4000bit/s, with a delay of 550 m, which is higher than other algorithms, proving its high efficiency in processing data. The average bit change of the ciphertext in the hybrid encryption algorithm was 55.8 bits, with a range of bit changes of [69.3, 82.7], which is significantly higher than other algorithms, proving its high security. The designed algorithm has significant benefits in communication security of information service platforms and plays an important role in promoting the development of future network security defense technology.

Statistical privacy protection for secure data access control in cloud

Cloud Service Providers (CSPs) allow data owners to migrate their data to resource-rich and powerful cloud servers and provide access to this data by individual users. Some of this data may be highly sensitive and important and CSPs cannot always be trusted to provide secure access. It is also important for end users to protect their identities against malicious authorities and providers, when they access services and data. Attribute-Based Encryption (ABE) is an end-to-end public key encryption mechanism, which provides secure and reliable fine-grained access control over encrypted data using defined policies and constraints. Since, in ABE, users are identified by their attributes and not by their identities, collecting and analyzing attributes may reveal their identities and violate their anonymity. Towards this end, we define a new anonymity model in the context of ABE. We analyze several existing anonymous ABE schemes and identify their vulnerabilities in user authorization and user anonymity protection. Subsequently, we propose a Privacy-Preserving Access Control Scheme (PACS), which supports multi-authority, anonymizes user identity, and is immune against users collusion attacks, authorities collusion attacks and chosen plaintext attacks. We also propose an extension of PACS, called Statistical Privacy-Preserving Access Control Scheme (SPACS), which supports statistical anonymity even if malicious authorities and providers statistically analyze the attributes. Lastly, we show that the efficiency of our scheme is comparable to other existing schemes. Our analysis show that SPACS can successfully protect against Collision Attacks and Chosen Plaintext Attacks.

Attribute-based linear homomorphic signature scheme based on key policy for mobile crowdsensing

Compared with traditional wireless sensor networks, mobile crowdsensing networks have advantages of low cost, easy maintenance, and high scalability, which will play a role in city-level data sensing scenarios in the future. So far, linear homomorphic signatures based on Public Key Instruction,identity, as well as certificateless, have been proposed in wireless sensor networks to resist the data contamination. However, these signature schemes cannot perform finer-grained signature verification, and these signature schemes do not realize the separation of users’ sensitive information from their data. To solve the above problems, we design an attribute-based linear homomorphic signature scheme for large-scale wireless network built with mobile smart devices. First, we give the definition of the attribute-based linear homomorphic signature scheme based on key policy (KP-ABLHS). Second, we construct KP-ABLHS by incorporating attribute-based signature and linear homomorphic coding signature scheme. Finally, we prove our protocol is secure in random oracle model (ROM) and use Python pairing-based cryptography library (pypbc) to implement the scheme. The experimental results show that our scheme is as efficient as Li et al.’s scheme and has the advantage of signing the set of attributes, while the efficiency of our scheme is significantly better than that of scheme Boneh et al.’s scheme.

A Brief Systematics Review and Visualization of Smart Cities based on Fog and Big Data Analysis Technology

The fog computing is based on IoT, and same as clouds are on the edge of a network between a device and the cloud, which can provide very close service to the device in real time. cloud computing frameworks also extend support to emerging application paradigms such as IoT, Fog computing, Edge, and Big Data through service and infrastructure. the ubiquitous deployment of sensors in smart cities requires a high-performance computing paradigm to support big data analysis with smart technologies and communications in IoT, providing location-awareness and latency-sensitive computing near the data sources (i.e., at the edge of the network). Cloud Computing paradigms widely used in enterprises to address the emerging challenges of big data analysis because of its scalable and distributed data management scheme. However, data centers in the Cloud faces great challenges on the burden of exploding amount of big data and the additional requirements of location awareness and low latency at the edge of network necessary for smart cites. the widely distributed sensor networks generate massive volume of data, which leads to a “Big Data “analysis challenge. The machine-to-machine(M2M) communication among massive numbers of sensors will dominate future communication network traffic, namely Internet of Things, instead of traditional Internet of Contents (IoC) in human-to-human and human-to-machine communication. In this review system where we took the research article around 33 from the different database and also taken 1987 datasets form the PubMed database from 1959 to 2024 (02 June 2024). In addition, depending on the different requirement which is partially processed the data. Then the gathered data is stored at the ledger unit through the smart cities based on the fog computing and big data technology. The hashing identity-based data encryption is a public key encryption which uses a digital signature to encrypt the data to prevent the information from the third party.

A Method for Specifying Complete Signature Randomization and an Algebraic Algorithm Based on It

To eliminate the limitations of signature randomization in known algebraic algorithms with a hidden group, the security of which is based on the computational complexity of solving large systems of power equations, a method for ensuring complete randomization is proposed. Based on this method, a new algorithm of the indicated type was developed, using a four-dimensional finite non-commutative associative algebra as an algebraic basis. We obtained estimates of the security of algorithms to direct attacks as well as from attacks based on known signatures, which confirm the effectiveness of the proposed signature randomization method. Due to the relatively small size and signature of the public and private keys, the developed algorithm is of interest as a potential practical post-quantum digital signature scheme.

Secure personal-health-records searching in edge-based Internet of Medical Things through plaintext checkable encryption

The security of Personal Health Records (PHRs) within the Internet of Medical Things (IoMT) infrastructure is a pressing issue in the healthcare sector. Edge-based IoMT devices like smart wearables and implantables often acquire PHRs. Cloud computing plays a vital role in handling computing and storage tasks for edge-based IoMT devices. However, concerns about trust with cloud servers require the use of encryption, which may complicate the retrieval of encrypted PHRs from the cloud. This paper presents certificateless public key encryption with plaintext-checkable encryption (CL-PKE-PCE). CL-PKE-PCE enables searching for encrypted data using plaintext keywords while eliminating key escrow and certificate management issues. The CL-PKE-PCE scheme facilitates the verification of ciphertexts against plaintexts without the need for decryption, thereby maintaining data privacy. Furthermore, the security of the proposed CL-PKE-PCE scheme has been substantiated under the bilinear Diffie–Hellman assumption. Compared to similar work, it efficiently lowers calculation costs for encryption, decryption, and search algorithms by 63.66%, 51.17%, and 61.62%, respectively. The findings demonstrate that the CL-PKE-PCE is simultaneously secure and efficient, affirming its suitability for edge-based IoMT scenarios.

Syrga2: Post-Quantum Hash-Based Signature Scheme

This paper proposes a new post-quantum signature scheme, Syrga2, based on hash functions. As known, existing post-quantum algorithms are classified based on their structures. The proposed Syrga2 scheme belongs to the class of multi-use signatures with state retention. A distinctive feature of state-retaining signatures is achieving a compromise between performance and signature size. This scheme enables the creation of a secure signature for r messages using a single pair of secret and public keys. The strength of signature algorithms based on hash functions depends on the properties of the hash function used in their structure. Additionally, for such algorithms, it is possible to specify the security level precisely. In the proposed scheme, the HBC-256 algorithm developed at the Institute of Information and Computational Technologies (IICT) is used as the hash function. The security of the HBC-256 algorithm has been thoroughly studied in other works by the authors. In contrast to the Syrga1 scheme presented in previous works by the authors, the Syrga2 scheme provides for the definition of different security levels determined by the parameter τ. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme’s performance is evaluated for signature creation, signing, and message verification.

Color image encryption scheme for distributed architecture with SCFP chaotic map

Image protection mechanism in distributed cloud network is an essential component of information security field. In this paper, a novel one-dimensional sine-cosine fractional power chaotic map (SCFP) is proposed. Results of various dynamical system tests illustrate that SCFP exhibits superior chaotic behavior over its infinite positive real parameter range, whose complexity and unpredictability can guarantee the strength of image cryptosystem. Furthermore, a color image encryption scheme tailored for distributed architecture is devised. Firstly, a hybrid cryptographic mechanism is designed to perform diffusion and confusion encryption for image data and ECC public key encryption for intermediate keys. Secondly, the diffusion structure elevates processing units to row-column level, and the diffusion order is dictated by a pseudo-random sequence generated by SCFP. Thirdly, the confusion structure extends the unbiased and efficient Fisher-Yates algorithm into a 2D space, and adopts a design of dual plaintext-related key. Lastly, three techniques namely QOI lossless compression, DE information embedding and threshold secret sharing are integrated to resolve issues of data volume inflation, key synchronization difficulty and poor fault tolerance. Simulation experiments conducted on multiple color images demonstrate that the proposed scheme offers significant ciphertext randomness, sufficiently large key space and strong key sensitivity, which can ensure the integrity of image data and resist various typical cryptographic attacks, and outperforms existing schemes oriented to centralized architecture in terms of security and efficiency.

Verifiable Quantum Advantage without Structure

We show the following hold, unconditionally unless otherwise stated, relative to a random oracle: — There are NP search problems solvable by quantum polynomial-time (QPT) machines but not classical probabilistic polynomial-time (PPT) machines. — There exist functions that are one-way, and even collision resistant, against classical adversaries but are easily inverted quantumly. Similar counterexamples exist for digital signatures and CPA-secure public key encryption (the latter requiring the assumption of a classically CPA-secure encryption scheme). Interestingly, the counterexample does not necessarily extend to the case of other cryptographic objects such as PRGs. — There are unconditional publicly verifiable proofs of quantumness with the minimal rounds of interaction: for uniform adversaries, the proofs are non-interactive, whereas for non-uniform adversaries the proofs are two message public coin. — Our results do not appear to contradict the Aaronson-Ambanis conjecture. Assuming this conjecture, there exist publicly verifiable certifiable randomness, again with the minimal rounds of interaction. By replacing the random oracle with a concrete cryptographic hash function such as SHA2, we obtain plausible Minicrypt instantiations of the above results. Previous analogous results all required substantial structure, either in terms of highly structured oracles and/or algebraic assumptions in Cryptomania and beyond.

Finite algebras in the design of multivariate cryptography algorithms

A new approach to the design of multivariate public-key cryptalgorithms is introduced. It envisages using non-linear mappings defined as squaring and cubic operations in finite fields represented as finite algebras. The developed approach allows significant reduction of the size of public key and thereby make post-quantum algorithms of multivariate cryptography much more practical. In the developed algorithms, the secret key includes a set of values of structural constants that determine the modifications of the finite fields used and the coefficients in the set of sixth degree polynomials that make up the public key

دراسة تحليلية مقارنة بين خوارزميتي RSA وAES كأنظمة تشفير للبيانات

Data encryption IS defined as a method of transforming information into a coded format, ensuring that only authorized individuals can successfully decode and comprehend the content. In addition, cryptography is principally categorized into two distinct types: symmetric key cryptography and asymmetric key cryptography. In this research, we conduct a comparative analysis of two cryptographic systems: RSA (asymmetric) and AES (symmetric key), specifically evaluating their performance in data encryption for point-to-point communications. The analysis focuses on the speed of file encryption and decryption as well as the length of the encrypted data. Experimental results reveal that both RSA and AES are robust encryption algorithms; however, AES outperforms RSA in terms of both encryption and decryption speeds while also producing a smaller remaining data size that could not be encrypted due. Finally, the paper has outlined strengths and weaknesses of reviewed algorithms which make it possible to effectively put these algorithms together in protecting information and satisfying the security needs of applications. Keywords: Encryption – Decryption– Cryptosystems– Encryption Algorithm- RSA– AES.

Enhancing wireless sensor network security with optimized cluster head selection and hybrid public-key encryption

This paper introduces an integrated methodology that enhances both the efficiency and security of wireless sensor networks (WSNs) against various active attacks. A two-fold strategy is proposed that incorporates an advanced cluster head (CH) selection and a customized, lightweight encryption protocol. The CH selection process is optimized through a multi-phase approach using fuzzy logic, local and global network qualifiers, and a trust index to ensure the election of CHs that are not only energy-efficient but also reliable. To complement the robust CH selection, the study introduces a hybrid yet lightweight encryption scheme customized Rivest-Shamir-Adleman (c-RSA) and customized advanced encryption standard (c-AES) algorithms. This scheme is customized for WSNs with limited computational resources, maintaining strong encryption standards while significantly reducing energy consumption and computational overhead. Experimental results demonstrate that the proposed system substantially enhances network performance, exhibiting a 34.15% improvement in energy efficiency and a 30.95% increase in reliability over existing methods such as LEACH and its modified versions. This comprehensive approach underscores the potential for a synergistic design in WSNs that does not compromise on security while optimizing operational efficiency.