Skip to main content
Top

2018 | OriginalPaper | Chapter

On Constructing Pairing-Free Identity-Based Encryptions

Authors : Xin Wang, Bei Liang, Shimin Li, Rui Xue

Published in: Information Security

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, we focus on constructing IBE from hardness assumptions without pairings. Especially, we propose two IBE schemes that are provably secure under new number theoretic assumptions over the group \(\mathbb {Z}_{N^2}^*\), in the Random Oracle (RO) model. We essentially take advantage of the underlying algebraic structure to overcome the difficulties in devising an IBE scheme.
More precisely, our contributions are two-fold and can be summarised as follows: (i) We give two concrete pairing-free constructions of IBE based on a variant of DDH assumption and Paillier’s \(\mathsf {DCR}\) assumption respectively over the group \(\mathbb {Z}_{N^2}^*\). These schemes are quite efficient and easily to be proven \(\mathsf {IND}\text {-}\mathsf {ID}\text {-}\mathsf {CPA}\) in the random oracle model. (ii) We also provide a generic construction of selectively secure IBE from DDH group with a \(\mathsf {DL}\)-solvable subgroup in the standard model by employing puncturable PRFs and indistinguishability obfuscation.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Footnotes
1
Of course, this cannot be realized in a prime order group due to the hardness of discrete logarithm problem, instead we can choose a composite order group with unknown order.
 
2
Note that since \(\ell \) is a polynomial of the security parameter \(\kappa \), but N is exponentially large, a brute force may not be possible to retrieve \(a_i\in \mathbb {Z}_{\lfloor N/\ell \rfloor }\) from \(g^{a_i}\). For instance, practically \(\ell =80\), \(N=2^{1024}\).
 
3
Observe that g generates the 2N-th power residue subgroup of \(\mathbb {Z}_{N^2}^*\), namely \(\mathbb {G}_{N}\) w.h.p: the probability that g is not a generator is \(\frac{p'+q'-1}{p'q'}\le \frac{1}{p'}+\frac{1}{q'}\).
 
Literature
3.
go back to reference Boneh, D., Papakonstantinou, P., Rackoff, C., Vahlis, Y.: On the impossibility of basing identity based encryption on trapdoor permutations. In: FOCS (2008) Boneh, D., Papakonstantinou, P., Rackoff, C., Vahlis, Y.: On the impossibility of basing identity based encryption on trapdoor permutations. In: FOCS (2008)
14.
go back to reference Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013) Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)
19.
go back to reference Paillier, P.: Public-key cryptosystems based on discrete logarithms residues. In: EUROCRYPT (1999) Paillier, P.: Public-key cryptosystems based on discrete logarithms residues. In: EUROCRYPT (1999)
20.
go back to reference Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC (2014) Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC (2014)
Metadata
Title
On Constructing Pairing-Free Identity-Based Encryptions
Authors
Xin Wang
Bei Liang
Shimin Li
Rui Xue
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-99136-8_17

Premium Partner