Building matrixes of higher order to achieve the special commutative multiplication and its applications in cryptography: بناء مصفوفات تبديلية من مراتب عليا وتطبيقاتها في التشفير

2021 ◽  
Vol 5 (3) ◽  
pp. 16-1
Author(s):  
Mechal Fheed Alslman, Nassr Aldin Ide, Ahmad Zakzak Mechal Fheed Alslman, Nassr Aldin Ide, Ahmad Zakzak
Keyword(s):  
Communication Channels ◽  
Higher Order ◽  
Public Key ◽  
Public Key Encryption ◽  
Secret Key ◽  
Open Communication ◽  
Encryption Method ◽  
Two Sides ◽  
Commutative Property ◽  
Square Matrix

In this paper, we introduce a method for building matrices that verify the commutative property of multiplication on the basis of circular matrices, as each of these matrices can be divided into four circular matrices, and we can also build matrices that verify the commutative property of multiplication from higher order and are not necessarily divided into circular matrices. Using these matrixes, we provide a way to securely exchange a secret encryption key, which is a square matrix, over open communication channels, and then use this key to exchange encrypted messages between two sides or two parties. Moreover, using these matrixes we also offer a public-key encryption method, whereby the two parties exchange encrypted messages without previously agreeing on a common secret key between them.

scholarly journals Private Predicate Encryption for Inner Product from Key-Homomorphic Pseudorandom Function

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Yi-Fan Tseng ◽  
Zi-Yuan Liu ◽  
Jen-Chieh Hsu ◽  
Raylin Tso
Keyword(s):  
Discrete Logarithm ◽  
Public Key ◽  
Inner Product ◽  
Sensitive Information ◽  
Public Key Encryption ◽  
Secret Key ◽  
New Paradigm ◽  
Generic Construction ◽  
Predicate Encryption ◽  
Pseudorandom Function

Predicate encryption (PE), formalized by Katz et al., is a new paradigm of public-key encryption that conceptually captures the public-key encryption that supports fine-grained access control policy. Because of the nature of PE, it is used for cloud storage so that users can retrieve encrypted data without revealing any information about the data to cloud servers and other users. Although lots of PE schemes have been studied, the predicate-hiding security is seldom considered; that is, the user’s secret key may leak sensitive information of the predicate. Additionally, the security of the current predicate-hiding PE schemes relies on the discrete logarithm assumption which cannot resist the quantum attacks in the future. In this paper, we propose a generic PE for inner product under symmetric-key setting, called private IPE, from specific key-homomorphic pseudorandom function (PRF). The rigorous proofs are provided to show that the construction is payload-hiding, attribute-hiding, and predicate-hiding secure. With the advantage of the generic construction, if the underlying PRF can resist quantum attacks, then, through our proposed generic construction, a quantum-resistant private IPE can be obtained.

scholarly journals Novel Framework for Maximizing Security over Wireless Network

2020 ◽  
Vol 9 (5) ◽  
pp. 39-45
Keyword(s):  
Wireless Network ◽  
Public Key ◽  
Dynamic State ◽  
Public Key Encryption ◽  
Secret Key ◽  
Maximum Security ◽  
Network Vulnerabilities ◽  
Trapdoor Function ◽  
Security Standards ◽  
Security Concern

With the increasing adoption of application running over wireless networking system, there is also an increasing security concern in it. Review of existing security protocols in wireless networks shows that they are highly specific to adversaries and hence they cannot be applicable with the dynamic state of network vulnerabilities. Apart from this, it was also explored that public key encryption requires a drastic change in its design methodology in order to make it more resource friendly for increased network lifetime. Therefore, this manuscript presents a novel framework that develops an enhanced model of public key encryption using algebraic structure that can generate an elite secret key. The study also introduces a design of an efficient trapdoor function which renders maximum resiliency towards different forms of lethal attacks as well as adhere to maximum security standards in wireless network. The study outcome shows that proposed system out performs frequently used existing security standards in many aspects.

scholarly journals Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

2017 ◽  
Vol 2017 ◽  
pp. 1-27 ◽  
Author(s):  
Shuai Han ◽  
Shengli Liu ◽  
Lin Lyu
Keyword(s):  
Public Key ◽  
Authenticated Encryption ◽  
Public Key Encryption ◽  
Secret Key ◽  
Diffie Hellman ◽  
Affine Functions ◽  
Generic Construction ◽  
Hash Proof System ◽  
Auxiliary Input ◽  
Ddh Assumption

KDM[F]-CCA security of public-key encryption (PKE) ensures the privacy of key-dependent messages f(sk) which are closely related to the secret key sk, where f∈F, even if the adversary is allowed to make decryption queries. In this paper, we study the design of KDM-CCA secure PKE. To this end, we develop a new primitive named Auxiliary-Input Authenticated Encryption (AIAE). For AIAE, we introduce two related-key attack (RKA) security notions, including IND-RKA and weak-INT-RKA. We present a generic construction of AIAE from tag-based hash proof system (HPS) and one-time secure authenticated encryption (AE) and give an instantiation of AIAE under the Decisional Diffie-Hellman (DDH) assumption. Using AIAE as an essential building block, we give two constructions of efficient KDM-CCA secure PKE based on the DDH and the Decisional Composite Residuosity (DCR) assumptions. Specifically, (i) our first PKE construction is the first one achieving KDM[Faff]-CCA security for the set of affine functions and compactness of ciphertexts simultaneously. (ii) Our second PKE construction is the first one achieving KDM[Fpolyd]-CCA security for the set of polynomial functions and almost compactness of ciphertexts simultaneously. Our PKE constructions are very efficient; in particular, they are pairing-free and NIZK-free.

ASYMMETRICAL QUANTUM KEY DISTRIBUTION PROTOCOL

2002 ◽  
Vol 13 (10) ◽  
pp. 1387-1392 ◽  
Author(s):  
XIAOYU LI
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Public Key ◽  
Secret Key ◽  
The Real ◽  
The Public ◽  
Epr Pairs ◽  
Epr Pair ◽  
Two Sides ◽  
Quantum Key Distribution Protocol

We provide an asymmetrical quantum key distribution protocol based on the correlations of EPR pairs. It is a variant of the modified Lo–Chau protocol where the EPR pair is not in the state Φ+ but is in one of the four states {Φ±, Ψ±}. The two sides communicating with each other are not equal in the process of establishing the key. A public key system can be built on the protocol. It differs from classical public key system in that there are three keys: the public key, the secret key and the real key.

scholarly journals A Latticed-Based Public Key Encryption with KDM Security from R-LWE

2012 ◽  
Vol 6-7 ◽  
pp. 398-403
Author(s):  
Yan Fang Wu ◽  
Zheng Huang ◽  
Qiao Yan Wen
Keyword(s):  
Low Cost ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Secret Key ◽  
Worst Case ◽  
Encryption And Decryption ◽  
Learning With Errors ◽  
High Level ◽  
The Cost

Since the introduction of the ring learning with errors (R-LWE) by Lyubashevsky, Peikert and Regev, many efficient and secure applications were founded in cryptography. In this paper, we mainly present an efficient public-key encryption scheme based on the R-LWE assumption. It is very simple to describe and analyze. As well as it can achieve security against certain key-dependent message (KDM) attacks. Namely, this efficient encryption scheme can securely encrypt its own secret key. The security of this scheme follows from the already proven hardness of the R-LWE problem since the R-LWE assumption is reducible to worst-case problems on the ideal lattice. Besides, the scheme enjoys a high level efficiency and low cost since the operations of the scheme are very simple and fast. The cost of both the encryption and decryption is only polylog(n) bit per message symbol.

scholarly journals Improving the efficiency of the steganographic method of data hiding with the application of iterative functions and noise addition

2021 ◽  
Vol 3 (2) ◽  
pp. 66-73
Author(s):  
I. M. Zhuravel ◽  
◽  
L. Z. Mychuda ◽  
Yu. I. Zhuravel ◽  
◽  
...  
Keyword(s):  
Data Hiding ◽  
Communication Channels ◽  
Visual Quality ◽  
Performance Criterion ◽  
Secret Key ◽  
Open Communication ◽  
Common Criteria ◽  
Secure Data Transmission ◽  
Hidden Data ◽  
Iterative Functions

The development of computer and digital technology contributes to the growth of information flows transmitted through open and closed communication channels. In many cases, this information is confidential, financial, or commercial in nature and is of value to its owners. This requires the development of mechanisms to protect information from unauthorized access. There are two fundamental areas of secure data transmission over the open communication channels – cryptography and steganography. The fundamental difference between them is that cryptography hides from others the content of the message, and steganography hides the very fact of the message transmission. This paper is devoted to steganographic methods of data concealment, which are less researched than cryptographic, but have significant potential for use in a variety of applications. One of the important characteristics of most methods is their effectiveness. In general, efficiency is assessed in the context of solving specific problems. However, the most common criteria for the effectiveness of steganographic methods are the amount of hidden data and the method of transmitting the secret key to the receiving party, which will not allow the attacker to intercept it. Because media files make up a significant portion of network traffic, a digital image is chosen as the stegocontainer. It is proposed to determine the coordinates of the embedding location on the basis of iterative functions. The advantage of their use is the compactness of the description of the coordinates of the pixels in which the data will be hidden. In addition, it is proposed to use the Diffie-Gellman algorithm to transfer the parameters of iterative functions to the receiving side. This method of key distribution makes the steganographic method less vulnerable to being stolen by an attacker. The second performance criterion is the amount of hidden data. The paper found that the moderate addition of multiplicative noise makes it possible to increase the amount of hidden data without significantly reducing the visual quality of the stegocontainer. To analyze the distortions in the image-stegocontainer, which are due to the influence of noise and modification of the lower bits of pixels, the method of a quantitative assessment of visual quality is used, which is based on the laws of visual perception. Keywords: steganographic data hiding; hiding efficiency; iterative functions; Diffie-Gelman algorithm.

Sign in / Sign up

Export Citation Format

Share Document