scholarly journals Practical Inner Product Encryption with Constant Private Key

2020 ◽  
Vol 10 (23) ◽  
pp. 8669
Author(s):  
Yi-Fan Tseng ◽  
Zi-Yuan Liu ◽  
Raylin Tso
Keyword(s):  
State Of The Art ◽  
Inner Product ◽  
Cryptographic Primitives ◽  
Private Key ◽  
Security Proof ◽  
Identity Based ◽  
Key Length ◽  
Predicate Encryption ◽  
Pairing Computation ◽  
Very High

Inner product encryption, first introduced by Katz et al., is a type of predicate encryption in which a ciphertext and a private key correspond to an attribute vector and a predicate vector, respectively. Only if the attribute and predicate vectors satisfy the inner product predicate will the decryption in this scheme be correct. In addition, the ability to use inner product encryption as an underlying building block to construct other useful cryptographic primitives has been demonstrated in the context of anonymous identity-based encryption and hidden vector encryption. However, the computing cost and communication cost of performing inner product encryption are very high at present. To resolve this problem, we introduce an efficient inner product encryption approach in this work. Specifically, the size of the private key is only one G element and one Zp element, and decryption requires only one pairing computation. The formal security proof and implementation result are also demonstrated. Compared with other state-of-the-art schemes, our scheme is the most efficient in terms of the number of pairing computations for decryption and the private key length.

Practical identity-based encryption in multiple private key generator (PKG) environments

2013 ◽  
Vol 8 (1) ◽  
pp. 43-50 ◽  
Author(s):  
Shengbao Wang ◽  
Zhenfu Cao ◽  
Qi Xie ◽  
Wenhao Liu
Keyword(s):  
Practical Identity ◽  
Private Key ◽  
Identity Based Encryption ◽  
Identity Based

Hierarchical Identity-Based Signature in Polynomial Rings

2020 ◽  
Vol 63 (10) ◽  
pp. 1490-1499
Author(s):  
Zhichao Yang ◽  
Dung H Duong ◽  
Willy Susilo ◽  
Guomin Yang ◽  
Chao Li ◽  
...  
Keyword(s):  
Higher Dimensions ◽  
Polynomial Rings ◽  
Independent Interest ◽  
Private Key ◽  
Large Community ◽  
New Construction ◽  
Identity Based ◽  
And Storage ◽  
New Algorithms ◽  
Core Role

Abstract Hierarchical identity-based signature (HIBS) plays a core role in a large community as it significantly reduces the workload of the root private key generator. To make HIBS still available and secure in post-quantum era, constructing lattice-based schemes is a promising option. In this paper, we present an efficient HIBS scheme in polynomial rings. Although there are many lattice-based signatures proposed in recent years, to the best of our knowledge, our HIBS scheme is the first ring-based construction. In the center of our construction are two new algorithms to extend lattice trapdoors to higher dimensions, which are non-trivial and of independent interest. With these techniques, the security of the new scheme can be proved, assuming the hardness of the Ring-SIS problem. Since operations in the ring setting are much faster than those over integers and the new construction is the first ring-base HIBS scheme, our scheme is more efficient and practical in terms of computation and storage cost when comparing to the previous constructions.

scholarly journals On the security of $\alpha\eta$: response to 'some attacks on quantum-based cryptographic protocols'

2006 ◽  
Vol 6 (7) ◽  
pp. 561-582
Author(s):  
H.P. Yuen ◽  
R. Nair ◽  
E. Corndorf ◽  
G.S. Kanter ◽  
P. Kumar
Keyword(s):  
Coherent State ◽  
Optical Communications ◽  
A Priori ◽  
Key Generation ◽  
Generation System ◽  
New Approach ◽  
Security Proof ◽  
Grover Search ◽  
Channel Loss ◽  
Key Length

Lo and Ko have developed some attacks on the cryptosystem called $\alpha \eta$}, claiming that these attacks undermine the security of $\alpha\eta$ for both direct encryption and key generation. In this paper, we show that their arguments fail in many different ways. In particular, the first attack in [1] requires channel loss or length of known-plaintext that is exponential in the key length and is unrealistic even for moderate key lengths. The second attack is a Grover search attack based on `asymptotic orthogonality' and was not analyzed quantitatively in [1]. We explain why it is not logically possible to "pull back'' an argument valid only at $n=\infty$ into a limit statement, let alone one valid for a finite number of transmissions n. We illustrate this by a `proof' using a similar asymptotic orthogonality argument that coherent-state BB84 is insecure for any value of loss. Even if a limit statement is true, this attack is a priori irrelevant as it requires an indefinitely large amount of known-plaintext, resources and processing. We also explain why the attacks in [1] on $\alpha\eta$ as a key-generation system are based on misinterpretations of [2]. Some misunderstandings in [1] regarding certain issues in cryptography and optical communications are also pointed out. Short of providing a security proof for $\alpha\eta$, we provide a description of relevant results in standard cryptography and in the design of $\alpha\eta$ to put the above issues in the proper framework and to elucidate some security features of this new approach to quantum cryptography.

scholarly journals A Boosting Framework of Factorization Machine

2021 ◽  
pp. 2159036
Author(s):  
Jun Zhou ◽  
Longfei Li ◽  
Ziqi Liu ◽  
Chaochao Chen
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Experimental Results ◽  
Low Rank ◽  
Inner Product ◽  
Adaptive Boosting ◽  
Rank Matrix ◽  
Factorization Machine ◽  
Fixed Rank ◽  
Low Rank Matrix

Recently, Factorization Machine (FM) has become more and more popular for recommendation systems due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions are learned as a low rank weight matrix, which is formulated as an inner product of two low rank matrices. This low rank matrix can help improve the generalization ability of Factorization Machine. However, to choose the rank properly, it usually needs to run the algorithm for many times using different ranks, which clearly is inefficient for some large-scale datasets. To alleviate this issue, we propose an Adaptive Boosting framework of Factorization Machine (AdaFM), which can adaptively search for proper ranks for different datasets without re-training. Instead of using a fixed rank for FM, the proposed algorithm will gradually increase its rank according to its performance until the performance does not grow. Extensive experiments are conducted to validate the proposed method on multiple large-scale datasets. The experimental results demonstrate that the proposed method can be more effective than the state-of-the-art Factorization Machines.

scholarly journals In-House Developed Kr Estimator: Implemented to Analyze the Sensitivity of Relative Permeability Data to Variations in Wetting Phase Saturation

2011 ◽  
Vol 29 (6) ◽  
pp. 817-825 ◽  
Author(s):  
Muhammad Khurram Zahoor
Keyword(s):  
Porous Medium ◽  
Pore Size Distribution ◽  
Pore Size ◽  
Relative Permeability ◽  
State Of The Art ◽  
Data Generation ◽  
Phase Saturation ◽  
Complex Models ◽  
Relative Permeability Curves ◽  
Very High

Reservoir surveillance always requires fast, unproblematic access and solution to different relative permeability models which have been developed from time to time. In addition, complex models sometimes require in-depth knowledge of mathematics for solution prior to use them for data generation. For this purpose, in-house software has been designed to generate rigorous relative permeability curves, with a provision to include users own relative permeability models, a part from built-in various relative permeability correlations. The developed software with state-of-the-art algorithms has been used to analyze the effect of variations in residual and maximum wetting phase saturation on relative permeability curves for a porous medium having very high non-uniformity in pore size distribution. To further increase the spectrum of the study, two relative permeability models, i.e., Pirson's correlation and Brooks and Corey model has been used and the obtained results show that the later model is more sensitive to such variations.

A GLANCE BEYOND THE STANDARD MODEL: LATEST RESULTS FROM THE MEG EXPERIMENT

2014 ◽  
Vol 35 ◽  
pp. 1460390
Author(s):  
SIMEONE DUSSONI
Keyword(s):  
Beyond Standard Model ◽  
Standard Model ◽  
High Intensity ◽  
State Of The Art ◽  
Branching Ratio ◽  
Beyond The Standard Model ◽  
Upper Limit ◽  
The Standard Model ◽  
Key Features ◽  
Very High

The MEG experiment started taking data in 2009 looking for the Standard Model suppressed decay μ → e + γ, which, if observed, can reveal Beyond Standard Model physics. It makes use of state-of-the art detectors optimized for operating in conditions of very high intensity, rejecting as much background as possible. The data taking ended August 2013 and an upgrade R&D is started to push the experimental sensitivity. The present upper limit on the decay Branching Ratio (BR) is presented, obtained with the subset of data from 2009 to 2011 run, together with a description of the key features of the upgraded detector.

Implementation of Algorithms for Identity Based Encryption and Decryption

2021 ◽  
pp. 315-327
Author(s):  
Kannan Balasubramanian ◽  
M. Rajakani
Keyword(s):  
Third Party ◽  
Public And Private ◽  
Trusted Third Party ◽  
Private Key ◽  
Identity Based Encryption ◽  
Encryption And Decryption ◽  
Semantic Security ◽  
Identity Based ◽  
Mail Address ◽  
E Mail

Identity-based cryptosystems were introduced to overcome one of the main problems in public key encryption, the generation of public and private keys. In the identity-based cryptosystem, an identifier such as an e-mail address of a user can be used to generate public and private keys by a trusted third party. The trusted third party uses a system-wide master secret to provide private keys to a user. Identity-based cryptosystems can be constructed using the idea of pairings. This article discusses four different identity-based cryptosystems: the Boneh-Franklin scheme, the Cock's scheme, the Authenticated IBE scheme and the Hierarchical IBE scheme. This article also discusses the security notions considered for the identity-based cryptosystem. The security notions considered are: one-wayness, indistinguishability, semantic security and non-malleability. An architecture consisting of a public parameter server and private key generator for the implementation of the identity-based cryptosystems is also discussed.

Sign in / Sign up

Export Citation Format

Share Document