[PDF] Top 20 Identity-based Hierarchical Key-insulated Encryption without Random Oracles
Has 10000 "Identity-based Hierarchical Key-insulated Encryption without Random Oracles" found on our website. Below are the top 20 most common "Identity-based Hierarchical Key-insulated Encryption without Random Oracles".
Identity-based Hierarchical Key-insulated Encryption without Random Oracles
... the key-insulation paradigm in the identity-based ...setting. Identity-based encryption (IBE) has been widely studied thus far, and therefore we believe that the ... See full document
24
Efficient Hierarchical Identity Based Encryption Scheme in the Standard Model
... is based on the Bilinear Diffie- Hellman (BDH) assumption in the random oracle ...HIBE based on BDH without random oracles ...cal identity based encryption ... See full document
6
Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles
... of key encapsulation mechanisms (KEMs) ...CCA-secure encryption schemes. As in the public-key and identity-based setting it is not hard to see that combining any CCA-secure attribute- ... See full document
19
On the Power of Hierarchical Identity-Based Encryption
... A hierarchical identity based encryption scheme (see Definition ...decryption key can be considered as a master secret key on its own to generate decryption keys for ...a ... See full document
33
Generic Construction of Server-Aided Revocable Hierarchical Identity-Based Encryption with Decryption Key Exposure Resistance
... secret key of a user can be divided into two parts: one part is its own secret key which used to realize key revocation by combining with the key update information, the second part is used to ... See full document
24
A Pairing Based Strong Designated Verifier Signature Scheme without Random Oracles
... scheme based on bilinear pairings without random oracles is ...is based on Water’s scheme proposed in ...signer’s identity are based on the standard complexity ...secret ... See full document
14
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
... Identity-based encryption (IBE) [28] enables a user to encrypt to a recipient’s identity id ...secret key for id, obtained by a trusted ...the random oracle model, the first ... See full document
34
Strongly Secure Revocable ID-based Signature without Random Oracles
... public key systems, before verifying a signature, a user must obtain the corresponding authenticated public key ...public key management becomes an important ...public key management, Shamir ... See full document
13
A Novel Strong Designated Verifier Signature Scheme without Random Oracles
... pairing based strong designated verifier signature scheme based on non-interactive zero knowledge proofs is ...games without random oracles; furthermore, this scheme has a security ... See full document
16
Semantic Security for the McEliece Cryptosystem without Random Oracles
... for encryption/decryption (as long as one can afford storing keys of hundreds of kilobytes in size); b) Not only a public-key encryption but also the other primitives ...[7], ... See full document
19
Ambiguous One-Move Nominative Signature Without Random Oracles
... secure without random oracles to ...the random oracle assumption and in [21], the number of components in signer A’s key is linear to the security ...ElGamal encryption ... See full document
16
COMPARATIVE ANALYSIS OF IDENTITY-BASED ENCRYPTION WITH TRADITIONAL PUBLIC KEY ENCRYPTION IN WIRELESS NETWORK
... the random oracle model is quite controversial, an important open problem after the construction of the Boneh-Franklin scheme was to develop an identity based encryption scheme which is ... See full document
10
A Review on Identity Based Encryption in Revocable Cloud Storage
... A. Identity based encryption without random oracles Since the subjective prophet show is uncommonly imperfect, an essential open issue after the change of the Boneh-Franklin ... See full document
7
Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles
... Up to now, only two NIZK shuffle arguments in the CRS model have been proposed, by Groth and Lu [GL07] and Lipmaa and Zhang [LZ12,LZ13], both of which are significantly slower than the fastest arguments in the ... See full document
23
Simulation-Based Selective Opening Security for Receivers under Chosen-Ciphertext Attacks
... secret key of any identity which is not equal to the challenge identity, by querying the private key generation oracle ...secret key of any identity, including the challenge ... See full document
27
Designated Verifier Threshold Proxy Signature Scheme without Random Oracles
... Abstract. In a (t, n) designated verifier threshold proxy signature scheme, an original signer can delegate his/her signing power to n proxy signers such that any t or more out of n proxy signers can sign messages on ... See full document
18
OleF: An Inverse-Free Online Cipher
... Abstract. Online ciphers, in spite of being insecure against an sprp adversary, can be desirable at places because of their ease of implementation and speed. Here we propose a single-keyed inverse-free construction that ... See full document
22
An Efficient Identity Based Homomorphic Broadcast Encryption
... an identity-based homomorphic broadcast encryption ...ciphertext without decrypting them, which can be decrypt by a re- ceiver who belongs to the two receiver sets of the two ... See full document
8
Functional Encryption: Decentralised and Delegatable
... functional encryption have also considered a simulation based definition [GKP + 13, GGG + 14] for functional ...simulation based security for functional encryption for general circuits and ... See full document
38
RANDOM KEY & THE NTH PRIME NUMBER BASED SYMMETRIC KEY ENCRYPTION ALGORITHM
... Different encryption methods are used to provide the security to the network and ...data. Encryption is the process of changing plain readable text into unreadable cipher ...same key is used in ... See full document
10
Related subjects