scholarly journals Designated Server-Aided Revocable Identity-based Keyword Search on Lattice

2021 ◽  
Author(s):  
Ying Guo ◽  
Fei Meng ◽  
Leixiao Cheng ◽  
Xiaolei Dong ◽  
Zhenfu Cao
Keyword(s):  
Standard Model ◽  
Keyword Search ◽  
Key Generation ◽  
Encryption Scheme ◽  
Security Proof ◽  
The Standard Model ◽  
Secret Keys ◽  
Identity Based ◽  
Learning With Errors ◽  
Designated Server

Abstract Public key encryption scheme with keyword search (PEKS) is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it's critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user's secret keys are exposed.In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors (LWE) problem on the standard model.

scholarly journals Designated server-aided revocable identity-based keyword search on lattice

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Ying Guo ◽  
Fei Meng ◽  
Leixiao Cheng ◽  
Xiaolei Dong ◽  
Zhenfu Cao
Keyword(s):  
Standard Model ◽  
Keyword Search ◽  
Key Generation ◽  
Encryption Scheme ◽  
Security Proof ◽  
The Standard Model ◽  
Secret Keys ◽  
Identity Based ◽  
Designated Server ◽  
Learning With Errors Problem

AbstractPublic key encryption scheme with keyword search is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it’s critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user’s secret keys are exposed. In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors problem on the standard model.

scholarly journals Anonymous Multireceiver Identity-Based Encryption against Chosen-Ciphertext Attacks with Tight Reduction in the Standard Model

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yi-Fan Tseng ◽  
Chun-I Fan
Keyword(s):  
Standard Model ◽  
Open Problem ◽  
Multiple Receivers ◽  
Identity Based Encryption ◽  
Security Proof ◽  
Cryptographic Primitive ◽  
The Standard Model ◽  
Tight Reduction ◽  
Identity Based

Multireceiver identity-based encryption is a cryptographic primitive, which allows a sender to encrypt a message for multiple receivers efficiently and securely. In some applications, the receivers may not want their identities to be revealed. Motivated by this issue, in 2010, Fan et al. first proposed the concept of anonymous multireceiver identity-based encryption (AMRIBE). Since then, lots of literature studies in this field have been proposed. After surveying the existing works, however, we found that most of them fail to achieve provable anonymity with tight reduction. A security proof with tight reduction means better quality of security and better efficiency of implementation. In this paper, we focus on solving the open problem in this field that is to achieve the ANON-IND-CCA security with tight reduction by giving an AMRIBE scheme. The proposed scheme is proven to be IND-MID-CCA and ANON-MID-CCA secure with tight reduction under a variant of the DBDH assumption. To the best of our knowledge, this is the first scheme proven with tight reducible full CCA security in the standard model.

scholarly journals Cryptanalysis of a Fuzzy Identity Based Encryption Scheme in the Standard Model

Informatica ◽  
2012 ◽  
Vol 23 (2) ◽  
pp. 299-314
Author(s):  
Xu An Wang ◽  
Xiaoyuan Yang ◽  
Minqing Zhang ◽  
Yong Yu
Keyword(s):  
Standard Model ◽  
Encryption Scheme ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Identity Based ◽  
Fuzzy Identity

scholarly journals Efficient identity-based encryption with Hierarchical key-insulation from HIBE

2021 ◽  
Author(s):  
Keita Emura ◽  
Atsushi Takayasu ◽  
Yohei Watanabe
Keyword(s):  
Standard Model ◽  
Special Requirement ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Secret Keys ◽  
Generic Construction ◽  
Identity Based ◽  
Important Notion ◽  
Effective Design ◽  
Key Exposure

AbstractHierarchical key-insulated identity-based encryption (HKIBE) is identity-based encryption (IBE) that allows users to update their secret keys to achieve (hierarchical) key-exposure resilience, which is an important notion in practice. However, existing HKIBE constructions have limitations in efficiency: sizes of ciphertexts and secret keys depend on the hierarchical depth. In this paper, we first triumph over the barrier by proposing simple but effective design methodologies to construct efficient HKIBE schemes. First, we show a generic construction from any hierarchical IBE (HIBE) scheme that satisfies a special requirement, called MSK evaluatability introduced by Emura et al. (Des. Codes Cryptography 89(7):1535–1574, 2021). It provides several new and efficient instantiations since most pairing-based HIBE schemes satisfy the requirement. It is worth noting that it preserves all parameters’ sizes of the underlying HIBE scheme, and hence we obtain several efficient HKIBE schemes under the k-linear assumption in the standard model. Since MSK evaluatability is dedicated to pairing-based HIBE schemes, the first construction restricts pairing-based instantiations. To realize efficient instantiation from various assumptions, we next propose a generic construction of an HKIBE scheme from any plain HIBE scheme. It is based on Hanaoka et al.’s HKIBE scheme (Asiacrypt 2005), and does not need any special properties. Therefore, we obtain new efficient instantiations from various assumptions other than pairing-oriented ones. Though the sizes of secret keys and ciphertexts are larger than those of the first construction, it is more efficient than Hanaoka et al.’s scheme in the sense of the sizes of master public/secret keys.

A Provably Secure Certificateless Proxy Signature Scheme Against Malicious-But-Passive KGC Attacks

2019 ◽  
Vol 63 (8) ◽  
pp. 1139-1147
Author(s):  
Wenjie Yang ◽  
Jian Weng ◽  
Xinyi Huang ◽  
Anjia Yang
Keyword(s):  
Standard Model ◽  
Proxy Signature ◽  
Public Key ◽  
Key Generation ◽  
Signature Scheme ◽  
Interesting Problem ◽  
System Parameters ◽  
Security Proof ◽  
The Standard Model ◽  
Provably Secure

Abstract In certificateless proxy signature (CLPS), the key generation center is responsible for initializing the system parameters and can obtain the opportunity to adaptively set some trapdoors in them when wanting to launch some attacks. Until now, how to withstand the malicious-but-passive key generation center (MKGC) attacks in CLPS is still an interesting problem. In this paper, we focus on the challenging issue and introduce a CLPS scheme provably secure in the standard model. To the best of our knowledge, we are the first to demonstrate its security under MKGC attacks by adopting the technology of embedding the classic difficulty problems into the target entity public key rather than the system parameters during the security proof process.

Sign in / Sign up

Export Citation Format

Share Document