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 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.

scholarly journals Improved Construction for Inner Product Functional Encryption

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Qingsong Zhao ◽  
Qingkai Zeng ◽  
Ximeng Liu
Keyword(s):  
Data Privacy ◽  
Bilinear Pairing ◽  
Inner Product ◽  
Secret Key ◽  
Functional Encryption ◽  
New Paradigm ◽  
Practical Applications ◽  
Simulation Based ◽  
The Standard Model ◽  
Standard Notion

Functional encryption (FE) is a vast new paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted data. In a FE scheme, a user can learn specific function of encrypted messages by restricted functional key and reveals nothing else about the messages. Besides the standard notion of data privacy in FE, it should protect the privacy of the function itself which is also crucial for practical applications. In this paper, we construct a secret key FE scheme for the inner product functionality using asymmetric bilinear pairing groups of prime order. Compared with the existing similar schemes, our construction reduces both necessary storage and computational complexity by a factor of 2 or more. It achieves simulation-based security, security strength which is higher than that of indistinguishability-based security, against adversaries who get hold of an unbounded number of ciphertext queries and adaptive secret key queries under the External Decisional Linear (XDLIN) assumption in the standard model. In addition, we implement the secret key inner product scheme and compare the performance with the similar schemes.

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.

Cryptographic Primitives

2020 ◽  
pp. 57-134
Author(s):  
Andreas Bolfing
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Digital Signature ◽  
Discrete Logarithm ◽  
Public Key ◽  
Public Key Encryption ◽  
Cryptographic Primitives ◽  
Digital Signature Algorithm ◽  
Digital Signature Scheme ◽  
Current Standards

This chapter provides a very detailed introduction to cryptography. It first explains the cryptographic basics and introduces the concept of public-key encryption which is based on one-way and trapdoor functions, considering the three major public-key encryption families like integer factorization, discrete logarithm and elliptic curve schemes. This is followed by an introduction to hash functions which are applied to construct Merkle trees and digital signature schemes. As modern cryptoschemes are commonly based on elliptic curves, the chapter then introduces elliptic curve cryptography which is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). It considers the hardness of the ECDLP and the possible attacks against it, showing how to find suitable domain parameters to construct cryptographically strong elliptic curves. This is followed by the discussion of elliptic curve domain parameters which are recommended by current standards. Finally, it introduces the Elliptic Curve Digital Signature Algorithm (ECDSA), the elliptic curve digital signature scheme.

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.

Sign in / Sign up

Export Citation Format

Share Document