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 A PKC-based security architecture for WSN

2020 ◽  
Vol 309 ◽  
pp. 02006
Author(s):  
Jianbo Yao ◽  
Chaoqiong Yang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Public Key Cryptography ◽  
Public Key ◽  
Wireless Sensor ◽  
Security Architecture ◽  
Important Challenge ◽  
Identity Based ◽  
And Storage ◽  
Energy Computation

It is an important challenge to find out suitable cryptography for WSN due to limitations of energy, computation capability and storage resources. Considering this sensor feature on limitations of resources, a security architecture based-on public key cryptography is proposed. The security architecture is based on identity based cryptosystem, but not requires key handshaking. The analysis shows that the security architecture ensures a good level of security and is very much suitable for the resources constrained trend of wireless sensor network.

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

Big Data Analytics

2018 ◽  
pp. 124-138
Author(s):  
Sreenu G. ◽  
M.A. Saleem Durai
Keyword(s):  
Decision Making ◽  
Big Data ◽  
Real Life ◽  
Big Data Analytics ◽  
Speed Up ◽  
Processing Techniques ◽  
And Storage ◽  
Big Data Computing ◽  
New Algorithms ◽  
Over Time

Advances in recent hardware technology have permitted to document transactions and other pieces of information of everyday life at an express pace. In addition of speed up and storage capacity, real-life perceptions tend to transform over time. However, there are so much prospective and highly functional values unseen in the vast volume of data. For this kind of applications conventional data mining is not suitable, so they should be tuned and changed or designed with new algorithms. Big data computing is inflowing to the category of most hopeful technologies that shows the way to new ways of thinking and decision making. This epoch of big data helps users to take benefit out of all available data to gain more precise systematic results or determine latent information, and then make best possible decisions. Depiction from a broad set of workloads, the author establishes a set of classifying measures based on the storage architecture, processing types, processing techniques and the tools and technologies used.

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.

Leakage-free ID-Based Signature, Revisited

2020 ◽  
Vol 63 (8) ◽  
pp. 1263-1270
Author(s):  
Xi-Jun Lin ◽  
Lin Sun ◽  
Haipeng Qu
Keyword(s):  
Extraction Procedure ◽  
Key Generation ◽  
Private Key ◽  
Identity Based ◽  
Key Extraction ◽  
Security Notion

Abstract Recently, Tseng et al. proposed a new notion for identity-based signature (IBS) scheme to resist ephemeral secret leakage (ESL) attacks, called leakage-free identity-based signature (leakage-free IBS), and devised the first secure leakage-free IBS scheme. However, they only considered the situation of the leakage of ephemeral secrets used for generating the signatures. Notice that the private key extraction procedure is probabilistic as well in their scheme, that is, there are ephemeral secrets used by the key generation center to generate the signers’ private keys. It is practical to consider that if the adversary comprises these ephemeral secrets, then he can reveal the master key of the system. Therefore, it is desired to introduce a new security notion for the leakage-free IBS schemes to consider the ESL attacks on both private key extraction and signing procedures. In this paper, we present such security notion. Moreover, we propose two IBS schemes that are proved to be secure under the new security notion.

scholarly journals Research on User Identity Authentication Based on Two-way Confirmation in Data Transmission

2018 ◽  
Vol 173 ◽  
pp. 03019
Author(s):  
Qin Li ◽  
Caiming Liu ◽  
Siyuan Jing ◽  
Lijun Du
Keyword(s):  
Data Transmission ◽  
Identity Authentication ◽  
Public Key ◽  
Network Environment ◽  
The Public ◽  
Private Key ◽  
Identity Based ◽  
Set Up

User identity authentication is the foundation of data transmission in the complicated network environment. Moreover, the key issue is the effective identity authentication of both sides in data transmission. An authentication method for user identity based on two-way confirmation in data transmission is proposed in this paper. The public key, private key, information of traditional identity authentication, one-time transmission key, timestamp, authentication lifecycle for timestamp and other authentication elements are constructed. Based on guaranteeing the timeliness of data transmission, the two-way user identity authentication process for sending terminal and receiving terminal is set up through using the information of traditional identity authentication and one-time transmission key.

Fully Secure Codes Based Tracing and Revoking Scheme with Constant Ciphertext

2014 ◽  
Vol 543-547 ◽  
pp. 3300-3307 ◽  
Author(s):  
Xing Wen Zhao ◽  
Gao Fei Zhao ◽  
Hui Li
Keyword(s):  
Random Oracle ◽  
Broadcast Encryption ◽  
Traitor Tracing ◽  
Encryption Scheme ◽  
User Revocation ◽  
New Construction ◽  
Identity Based ◽  
Traitor Tracing Schemes ◽  
Adaptive Adversary ◽  
Adversary Model

In broadcast encryption system certain users may leak their decryption keys to build pirate decoders, so traitor tracing is quite necessary. There exist many codes based traitor tracing schemes. As pointed out by Billet and Phan in ICITS 2008, these schemes lack revocation ability. The ability of revocation can disable identified malicious users and users who fail to fulfill the payments, so that the broadcast encryption system can be more practical. Recently, Zhao and Li presented a construction of codes based tracing and revoking scheme which achieves user revocation as well as traitor tracing. However, their scheme is only secure against chosen plaintext attacks under selective-adversary model with random oracle. In this paper, we obtain a new construction of codes based tracing and revoking scheme which is proved secure against chosen ciphertext attacks under adaptive-adversary model without random oracle. Our idea is to insert codeword into Boneh and Hamburgs identity based broadcast encryption scheme to retain the ability of user revocation and use Boneh and Naors method to trace traitors. Our fully secure scheme is roughly as efficient as Zhao and Lis scheme while the security is enhanced.

A new method for generating keys in the RSA cryptosystem

2020 ◽  
Vol 20 (2) ◽  
pp. 221-223
Author(s):  
N.V. Markova ◽  
Keyword(s):  
New Method ◽  
Public Key ◽  
Rsa Cryptosystem ◽  
The Public ◽  
Private Key ◽  
New Construction

V.A. Bykovsky built a new version of the RSA cryptosystem, in which for the same private key lengths the length of the public key decreases asymptotically by a factor of three. The paper proposes a new construction on this theme, in which the length of the public key is reduced by more than three times.

scholarly journals Alternative proofs of linear response for piecewise expanding unimodal maps

2009 ◽  
Vol 30 (1) ◽  
pp. 1-20 ◽  
Author(s):  
VIVIANE BALADI ◽  
DANIEL SMANIA
Keyword(s):  
Linear Response ◽  
Higher Dimensions ◽  
Higher Order ◽  
Independent Interest ◽  
Brute Force ◽  
Original Proof ◽  
Srb Measure ◽  
Unimodal Maps ◽  
Singular Terms ◽  
Response Formula

AbstractWe give two new proofs that the Sinai–Ruelle–Bowen (SRB) measure t↦μt of a C2 path ft of unimodal piecewise expanding C3 maps is differentiable at 0 if ft is tangent to the topological class of f0. The arguments are more conceptual than the original proof of Baladi and Smania [Linear response formula for piecewise expanding unimodal maps. Nonlinearity21 (2008), 677–711], but require proving Hölder continuity of the infinitesimal conjugacy α (a new result, of independent interest) and using spaces of bounded p-variation. The first new proof gives differentiability of higher order of ∫ ψ dμt if ft is smooth enough and stays in the topological class of f0 and if ψ is smooth enough (a new result). In addition, this proof does not require any information on the decomposition of the SRB measure into regular and singular terms, making it potentially amenable to extensions to higher dimensions. The second new proof allows us to recover the linear response formula (i.e. the formula for the derivative at 0) obtained by Baladi and Smania, by an argument more conceptual than the ‘brute force’ cancellation mechanism used by Baladi and Smania.

Sign in / Sign up

Export Citation Format

Share Document