Results 231 to 240 of about 20,722 (263)
Some of the next articles are maybe not open access.

HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES

International Journal of Foundations of Computer Science, 2010
In a proxy re-encryption scheme, a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in public key settings. Hierarchical identity-based cryptography is a generalization of identity-based encryption that mirrors an organizational hierarchy ...
Ren, Yanli   +3 more
openaire   +2 more sources

Private Key Management in Hierarchical Identity-Based Encryption

2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System, 2007
Hierarchical identity-based encryption (HIBE) is a generalization of IBE that mirrors an organizational hierarchy, which consists of a root private key generator (PKG), domain PKGs and users. In a traditional HIBE system, users retrieve private keys from their domain PKGs, while domain PKGs request domain secret keys from the root PKG. What's more, the
Zhongren Liu   +3 more
openaire   +1 more source

Cryptanalysis of a Hierarchical Identity-Based Encryption Scheme

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2010
Hierarchical Identity-Based Encryption (HIBE) is a generalization of identity-based encryption that mirrors an organizational hierarchy, and allows the root Private Key Generator (PKG) to distribute the workload of key generations to lower-level PKGs. In Indocrypt'08, Ren and Gu proposed a new HIBE scheme, and claimed that their scheme is fully chosen ...
WENG, Jian   +3 more
openaire   +2 more sources

A Hierarchical Identity-Based Encryption for MANETs

2011 International Conference on Computational Problem-Solving (ICCP), 2011
Mobile ad-hoc networks (MANETs) have no fixed infrastructure such as base stations or mobile switching centers, and the framework is dynamic owing to frequent changes in both topology and membership. Consequently, the trust relationships among nodes also change, and many security solutions with static configurations will become inadequate.
openaire   +1 more source

Adaptively Secure Hierarchical Identity-Based Encryption over Lattice

2017
Quantum computer is regarded as a threat to the cryptosystem at present. Lattice with a rich mathematics structure gave a choice for building post-quantum secure hierarchical identity-based encryption (HIBE) system. But in the existing works, there are many shortcomings such as large public/private key space and weak security model.
Leyou Zhang, Qing Wu
openaire   +1 more source

Hierarchical Identity-based Broadcast Encryption Scheme on Lattices

2011 Seventh International Conference on Computational Intelligence and Security, 2011
In this paper, a hierarchical identity-based broadcast encryption scheme is proposed based on the learning with errors problem, which is a classic hard problem on lattices. In the proposed scheme, each user's identity is associated with a lattice matrix, then the relationship between the lattice and its sub lattice could easily represent the ...
Zhang Jinman, Chen Qin
openaire   +1 more source

Hierarchical Identity-Based Encryption

2021
Seong Oun Hwang, Intae Kim, Wai Kong Lee
openaire   +1 more source

New Escrow-Free Scheme for Hierarchical Identity-Based Encryption

2015
Key escrow is an inherent problem in identity-based encryption IBE since it was first proposed by Shamir in 1984. We present a new scheme to remove key escrow from IBE and HIBE, based on the security notion of anonymous ciphertext indistinguishability against key generation center ACI-KGC proposed by Chow.
Fang Qi, Xin Tang, Quanyun Wei
openaire   +1 more source

Anonymous Hierarchical Identity-Based Encryption in Prime Order Groups

2012
A hierarchical identity-based encryption (HIBE) scheme is called anonymous if the ciphertext does not leak the identity of the recipient. Currently, anonymous HIBE schemes are constructed in composite order groups or achieve selective-ID security in prime order groups and the ciphertext size is linear in the maximum depth of hierarchy.
Yanli Ren, Shuozhong Wang, Xinpeng Zhang
openaire   +1 more source

Home - About - Disclaimer - Privacy