Separable Identity-Based Deniable Authentication: Cryptographic Primitive for Fighting Phishing

2006 ◽  
pp. 68-80 ◽  
Author(s):  
Willy Susilo ◽  
Yi Mu
Keyword(s):  
Deniable Authentication ◽  
Cryptographic Primitive ◽  
Identity Based

scholarly journals A Provably Secure ID-Based Signcryption Protocol for Secure and Authentic Energy Efficient Communication

2021 ◽  
Author(s):  
Sunil Kumar ◽  
Pratik Gupta ◽  
Dharminder Dharminder
Keyword(s):  
Computational Cost ◽  
Single Step ◽  
Step Method ◽  
Performance Review ◽  
Diffie Hellman ◽  
Cryptographic Primitive ◽  
Energy Efficient Communication ◽  
Efficient Communication ◽  
Identity Based ◽  
Provably Secure

Abstract Singcryption was first proposed by Yuliang Zheng [1] in 1997, based on the construction of a shortened ElGamal-based signature scheme in parallel to authenticated encryption in a symmetric environment. Signcryption is a cryptographic primitive that enables the conventional two-step method of secure and authenticated message transmission or storage (sign-then-encrypt or encrypt-then-sign) to be done in a single step at a much lower computational cost than the traditional two-step approach. This article concentrates on designing a provably secure identity-based signcryption (IBSC) scheme. The user performs pairing-free computation during encryption in the proposed scheme, making it user-side effective. In addition, the IBSC structure is shown to be secure when dealing with modified bilinear Diffie-Hellman inversion (MBDHI) and modified bilinear strong Diffie-Hellman (MBSDH) problems. The proposed framework supports efficient communication, protection against chosen cipher attack, and existential unforgeability against chosen message attack, according to the performance review of IBSC with related schemes.

Biometric Identity Based Encryption

2011 ◽  
pp. 181-193
Author(s):  
Neyire Deniz Sarier
Keyword(s):  
New Method ◽  
Future Trends ◽  
Computational Power ◽  
Collusion Attacks ◽  
Implementation Challenges ◽  
Identity Based Encryption ◽  
Cryptographic Primitive ◽  
Attack Scenario ◽  
Security Properties ◽  
Identity Based

In this chapter, we evaluate the security properties and different applications of Identity Based Encryption (IBE) systems. Particularly, we consider biometric identities for IBE, which is a new encryption system defined as fuzzy IBE. Next, we analyze the security aspects of fuzzy IBE in terms of the security notions it must achieve and the prevention of collusion attacks, which is an attack scenario specific to fuzzy IBE. In this context, we present a new method that avoids the collusion attacks and describe the currently most efficient biometric IBE scheme that implements this new method. Also, we investigate implementation challenges for biometric IBE systems, where fuzzy IBE could be a potential cryptographic primitive for biometric smartcards. Due to the limited computational power of these devices, a different solution for biometric IBE is considered, which is the encryption analogue of the biometric identity based signature system of Burnett et al. (2007). Finally, we state the future trends for biometric IBE systems and conclude our results.

Leakage-Resilient Hierarchical Identity-Based Encryption with Recipient Anonymity

2019 ◽  
Vol 30 (04) ◽  
pp. 665-681
Author(s):  
Yinghui Zhang ◽  
Menglei Yang ◽  
Dong Zheng ◽  
Tiantian Zhang ◽  
Rui Guo ◽  
...  
Keyword(s):  
Data Security ◽  
Secret Key ◽  
Leakage Resilience ◽  
Identity Based Encryption ◽  
Cryptographic Primitive ◽  
Dual System Encryption ◽  
The Standard Model ◽  
Leakage Resilient ◽  
Key Leakage ◽  
Identity Based

As a promising public key cryptographic primitive, hierarchical identity-based encryption (HIBE) introduces key delegation mechanisms into identity-based encryption. However, key leakage and recipient anonymity issues have not been adequately addressed in HIBE. Hence, direct applications of traditional HIBE schemes will violate data security and abuse users’ privacy in practice. In this paper, we propose an anonymous unbounded hierarchical identity-based encryption scheme, which achieves bounded leakage resilience and the hierarchy depth is not limited. Our security proofs based on the dual system encryption technique show that the proposed scheme is capable of resisting key leakage and it realizes recipient anonymity in the standard model. In addition, leakage resilience analysis indicates that our scheme allows the leakage rate of approximate 1/3 no matter the hierarchy depth of identities. Finally, performance comparisons show the practicability of our scheme. In particular, the secret key of our construction is of a fixed-length.

Identity-based deniable authentication for ad hoc networks

Computing ◽  
2013 ◽  
Vol 96 (9) ◽  
pp. 843-853 ◽  
Author(s):  
Fagen Li ◽  
Pan Xiong ◽  
Chunhua Jin
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Deniable Authentication ◽  
Identity Based ◽  
Hoc Networks

On the General Construction of Tightly Secure Identity-Based Signature Schemes

2020 ◽  
Vol 63 (12) ◽  
pp. 1835-1848
Author(s):  
Ge Wu ◽  
Zhen Zhao ◽  
Fuchun Guo ◽  
Willy Susilo ◽  
Futai Zhang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
General Construction ◽  
Security Level ◽  
Signature Schemes ◽  
Small Constant ◽  
Security Parameter ◽  
Cryptographic Primitive ◽  
Identity Based ◽  
Tight Security

Abstract A tightly secure scheme has a reduction, where the reduction loss is a small constant. Identity-based signature (IBS) is an important cryptographic primitive, and tightly secure IBS schemes enjoy the advantage that the security parameter can be optimal to achieve a certain security level. General constructions of IBS schemes (Bellare, M., Namprempre, C., and Neven, G. (2004) Security Proofs for Identity-Based Identification and Signature Schemes. In Proc. EUROCRYPT 2004, May 2–6, pp. 268–286. Springer, Berlin, Interlaken, Switzerland; Galindo, D., Herranz, J., and Kiltz, E. (2006) On the Generic Construction of Identity-Based Signatures With Additional Properties. In Proceedings of ASIACRYPT 2006, December 3–7, pp. 178–193. Springer, Berlin, Shanghai, China) and their security have been extensively studied. However, the security is not tight and how to generally construct a tightly secure IBS scheme remains unknown. In this paper, we concentrate on the general constructions of IBS schemes. We first take an insight into previous constructions and analyze the reason why it cannot achieve tight security. To further study possible tightly secure constructions, we propose another general construction, which could be seen as a different framework of IBS schemes. Our construction requires two traditional signature schemes, whereas the construction by Bellare et al. uses one scheme in a two-round iteration. There are no additional operations in our general construction. Its main advantage is providing the possibility of achieving tight security for IBS schemes in the random oracle model. Combining two known signature schemes, we present an efficient IBS scheme with tight security as an example.

scholarly journals Strong Identity-Based Proxy Signature Schemes, Revisited

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Weiwei Liu ◽  
Yi Mu ◽  
Guomin Yang ◽  
Yangguang Tian
Keyword(s):  
Proxy Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Cryptographic Primitive ◽  
Identity Based

Proxy signature is a useful cryptographic primitive that has been widely used in many applications. It has attracted a lot of attention since it was introduced. There have been lots of works in constructing efficient and secure proxy signature schemes. In this paper, we identify a new attack that has been neglected by many existing proven secure proxy signature schemes. We demonstrate this attack by launching it against an identity-based proxy signature scheme which is proven secure. We then propose one method that can effectively prevent this attack. The weakness in some other proxy signature schemes can also be fixed by applying the same method.

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 Improved functional proxy re-encryption schemes for secure cloud data sharing

2018 ◽  
Vol 15 (3) ◽  
pp. 585-614 ◽  
Author(s):  
Xu Wang ◽  
Xiaoyuan Yang ◽  
Cong Li ◽  
Yudong Liu ◽  
Yong Ding
Keyword(s):  
Data Sharing ◽  
Data Storage ◽  
Finite Automata ◽  
Cloud Data ◽  
Storage Mechanism ◽  
Cryptographic Primitive ◽  
Encryption Schemes ◽  
Secret Keys ◽  
Identity Based ◽  
Chosen Ciphertext Attack

Recently Liang et al. propose an interesting privacy-preserving ciphertext multi-sharing control for big data storage mechanism, which is based on the cryptographic primitive of anonymous multi-hop identity based conditional proxy re-encryption scheme AMH-IBCPRE. They propose a concrete AMH-IBCPRE scheme and conclude their scheme can achieve IND-sCon-sID-CCA secure (indistinguishable secure under selectively conditional selectively identity chosen ciphertext attack). However, our research show their scheme can not be IND-sConsID- CCA secure for single-hop and multi-hop data sharing. Also in 2014, Liang et al. propose an interesting deterministic finite automata-based functional proxy reencryption scheme DFA-based FPRE for secure public cloud data sharing, they also conclude their scheme can achieve IND-CCA secure (indistinguishable secure under chosen ciphertext attack), we also show their scheme can not be IND-CCA secure either. For these two proposals, the main reason of insecurity is that part of the re-encryption key has the same structure as the valid ciphertext, thus the adversary can query on the decryption oracle with this part of the re-encryption key to get secret keys, which will break the CCA-security of their scheme.We give an improved AMH-IBCPRE scheme and an improved DFA-based FPRE scheme for cloud data sharing and show the new schemes can resist our attack and be CCA-secure.We also demonstrate our improved AMH-IBCPRE scheme?s efficiency compared with other related identity based proxy re-encryption schemes, the results show our scheme is almost the most efficient one.

Sign in / Sign up

Export Citation Format

Share Document