Large Universe Subset Predicate Encryption Based on Static Assumption (Without Random Oracle)

2019 ◽  
pp. 62-82 ◽  
Author(s):  
Sanjit Chatterjee ◽  
Sayantan Mukherjee
Keyword(s):  
Random Oracle ◽  
Predicate Encryption

scholarly journals A multi-authority approach to various predicate encryption types

2019 ◽  
Vol 88 (2) ◽  
pp. 363-390
Author(s):  
Tim van de Kamp ◽  
Andreas Peter ◽  
Willem Jonker
Keyword(s):  
Admissible Pair ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Encryption Scheme ◽  
Encoding Scheme ◽  
Decentralized System ◽  
Conversion Algorithm ◽  
Encryption Schemes ◽  
Generic Construction ◽  
Predicate Encryption

Abstract We propose a generic construction for fully secure decentralized multiauthority predicate encryption. In such multiauthority predicate encryption scheme, ciphertexts are associated with one or more predicates from various authorities and only if a user has a set of decryption keys that evaluates all predicates to true, the user is able to recover the message. In our decentralized system, anyone can create a new authority and issue decryption keys for their own predicates. We introduce the concept of a multi-authority admissible pair encoding scheme and, based on these encodings, we give a generic conversion algorithm that allows us to easily combine various predicate encryption schemes into a multi-authority predicate encryption variant. The resulting encryption schemes are proven fully secure under standard subgroup decision assumptions in the random oracle model. Finally, by instantiating several concrete multi-authority admissible pair encoding schemes and applying our conversion algorithm, we are able to create a variety of novel multi-authority predicate encryption schemes.

Leaky Random Oracle

2009 ◽  
Vol E92-A (8) ◽  
pp. 1795-1807 ◽  
Author(s):  
Kazuki YONEYAMA ◽  
Satoshi MIYAGAWA ◽  
Kazuo OHTA
Keyword(s):  
Random Oracle

scholarly journals An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Quanrun Li ◽  
Chingfang Hsu ◽  
Debiao He ◽  
Kim-Kwang Raymond Choo ◽  
Peng Gong
Keyword(s):  
Quantum Computer ◽  
Rapid Development ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Mean Value ◽  
Blind Signature ◽  
Signature Scheme ◽  
Practical Applications ◽  
Universal Quantum ◽  
Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

scholarly journals A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle

2016 ◽  
Vol 609 ◽  
pp. 253-261 ◽  
Author(s):  
Linming Gong ◽  
Shundong Li ◽  
Qing Mao ◽  
Daoshun Wang ◽  
Jiawei Dou
Keyword(s):  
Homomorphic Encryption ◽  
Random Oracle ◽  
Encryption Scheme ◽  
Chosen Ciphertext Security ◽  
Adaptive Chosen Ciphertext Security

scholarly journals ID-based key-insulated signcryption with equality test in cloud computing

2021 ◽  
Vol 3 (4) ◽  
Author(s):  
Seth Alornyo ◽  
Kingsford Kissi Mireku ◽  
Mustapha Adamu Mohammed ◽  
Daniel Adu-Gyamfi ◽  
Michael Asante
Keyword(s):  
Cloud Computing ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Harsh Environments ◽  
Secret Key ◽  
Secret Keys ◽  
Security Property ◽  
Equality Test ◽  
Chosen Ciphertext Attack ◽  
Chosen Message Attack

AbstractKey-insulated encryption reduces the problem of secret key exposure in hostile setting while signcryption cryptosystem attains the benefits of digitally signing a ciphertext and public key cryptosystem. In this study, we merge the primitives of parallel key-insulation cryptosystem and signcryption with equality test to construct ID-based parallel key-insulated signcryption with a test for equality (ID-PKSET) in cloud computing. The construction prevent data forgery, data re-play attacks and reduces the leakage of secret keys in harsh environments. Our scheme attains the security property of existential unforgeable chosen message attack (EUF-CMA) and indistinquishable identity chosen ciphertext attack (IND-ID-CCA2) using random oracle model.

scholarly journals Privacy preserving revocable predicate encryption revisited

2014 ◽  
Vol 8 (3) ◽  
pp. 471-485 ◽  
Author(s):  
Kwangsu Lee ◽  
Intae Kim ◽  
Seong Oun Hwang
Keyword(s):  
Privacy Preserving ◽  
Predicate Encryption

Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Shuichi Katsumata ◽  
Shota Yamada ◽  
Takashi Yamakawa
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Security Proofs
Sign in / Sign up

Export Citation Format

Share Document