Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
International Journal of Information Security
Erschienen in: International Journal of Information Security 4/2014

01.08.2014 | Regular Contribution

Lattice-based certificateless public-key encryption in the standard model

verfasst von: Reza Sepahi, Ron Steinfeld, Josef Pieprzyk

Erschienen in: International Journal of Information Security | Ausgabe 4/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008.
Vorheriger Artikel Efficient verifiably encrypted signatures from lattices
Nächster Artikel Sufficient conditions for sound tree and sequential hashing modes

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Literatur
1.
Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Proceedings of Eurocrypt’10, vol. 6110 of, Lecture Notes in Computer Science, pp. 553–572 (2010)
2.
3.
Al-Riyami, S.S., Paterson, K.: Certificateless public-key cryptography. In: Laih, C.-S. (ed.) Advances in Cryptology–ASIACRYPT 2003, vol. 2894, pp. 452–473. Springer, Berlin, Heidelberg (2003)CrossRef
4.
Au, M.H., Mu, Y., Chen, J., Wong, D.S., Liu, J.K., Yang, G.: Malicious KGC attacks in certificateless cryptography. In: Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS ’07, pp. 302–311. ACM (2007)
5.
Baek, J., Safavi-Naini, R., Susilo, W.: Certificateless public-key encryption without pairing. In: Information Security Conference/Information Security Workshop, vol. 3650 of Lecture Notes in Computer Science, pp. 134–148. Springer (2005)
6.
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) Advances in Cryptology–CRYPTO 98, pp. 26–46. Springer, Berlin (1998)
7.
Boneh, D. Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Proceedings of the 14th International Conference on Practice and Theory in Public-Key Cryptography Conference on Public-Key Cryptography, PKC’11, pp. 1–16. Springer, Berlin, Heidelberg (2011)
8.
9.
Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology–EUROCRYPT 2004, vol. 3027, pp. 223–238. Springer, Berlin, Heidelberg (2004)CrossRef
10.
Boneh, D., Katz, J.: Improved efficiency for CCA-secure cryptosystems built using identity-based encryption. In: Menezes, A. (ed.) Topics in Cryptology—CT-RSA 2005, vol. 3376, pp. 87–103. Springer, Berlin, Heidelberg (2005)CrossRef
11.
Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (without random oracles). In: Dwork, C. (ed.) Advances in Cryptology—CRYPTO 2006, vol. 4117, pp. 290–307. Springer, Berlin, Heidelberg (2006)CrossRef
12.
Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) Advances in Cryptology—EUROCRYPT 2003, vol. 2656, pp. 646–646. Springer, Berlin, Heidelberg (2003)
13.
Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology—EUROCRYPT 2004, vol. 3027, pp. 207–222. Springer, Berlin, Heidelberg (2004)CrossRef
14.
15.
Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) Advances in Cryptology—EUROCRYPT 2010, vol. 6110, pp. 523–552. Springer, Berlin (2010)CrossRef
16.
Choi, K.Y., Park, J.H., Hwang, J.Y., Lee, D.H.: Efficient certificateless signature schemes. In: Applied Cryptography and Network Security: 5th International Conference, ACNS 2007, Zhuhai, China, June 5–8, 2007: Proceedings, p. 443. Springer, New York (2007)
17.
Dent, A.: A survey of certificateless encryption schemes and security models. Int. J. Inf. Secur. 7(5), 349–377 (2008)
18.
Dent, A., Libert, B., Paterson, K.: Certificateless encryption schemes strongly secure in the standard model. In: Cramer, R. (ed.) Public-Key Cryptography—PKC 2008, vol. 4939, pp. 344–359. Springer, Berlin, Heidelberg (2008)CrossRef
19.
20.
Dodis, Y., Katz, J.: Chosen-ciphertext security of multiple encryption. In: Kilian, J. (ed.) Theory of Cryptography, vol. 3378, pp. 188–209. Springer, Berlin, Heidelberg (2005)CrossRef
21.
22.
Horwitz, J., Lynn, B.: Toward hierarchical identity-based encryption. In: Knudsen, L. (ed.) Advances in Cryptology—EUROCRYPT 2002, vol. 2332, pp. 466–481. Springer, Berlin, Heidelberg (2002)CrossRef
23.
Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In: Pieprzyk, J. (ed.) Advances in Cryptology—ASIACRYPT 2008, vol. 5350, pp. 372–389. Springer, Berlin, Heidelberg (2008)CrossRef
24.
Lai, J., Kou, W.: Self-generated-certificate public-key encryption without pairing. In: Okamoto, T., Wang, X. (eds.) Lecture Notes in Computer Science, pp. 476–489. Springer, Heidelberg (2007)
25.
Libert, B., Quisquater, J.-J.: On constructing certificateless cryptosystems from identity based encryption. In: Proceedings of the 9th International Conference on Theory and Practice of Public-Key Cryptography, PKC’06, pp. 474–490. Springer, Berlin, Heidelberg (2006)
26.
Park, J.H., Choi, K.Y., Hwang, J.Y., Lee, D.H.: Certificateless public-key encryption in the selective-id security model. In: Proceedings of the First International Conference on Pairing-Based Cryptography, Pairing’07, pp. 60–82. Springer, Berlin, Heidelberg (2007)
27.
Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) Advances in Cryptology—CRYPTO ’91, vol. 576, pp. 433–444. Springer, Berlin, Heidelberg (1992)
28.
Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G., Chaum, D. (eds.) Advances in Cryptology, vol. 196, pp. 47–53. Springer, Berlin, Heidelberg (1985)CrossRef
29.
Sun, Y., Zhang, F., Baek, J.: Strongly secure certificateless public-key encryption without pairing. In: Proceedings of the 6th International Conference on Cryptology and Network Security, CANS’07, pp. 194–208. Springer, Berlin, Heidelberg (2007)
30.
Yum, D.H., Lee, P.J.: Generic construction of certificateless encryption. In: ICCSA (1), vol. 3043 of Lecture Notes in Computer Science, pp. 802–811. Springer (2004)
Metadaten
Titel
Lattice-based certificateless public-key encryption in the standard model
verfasst von
Reza Sepahi
Ron Steinfeld
Josef Pieprzyk
Publikationsdatum
01.08.2014
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Information Security / Ausgabe 4/2014
Print ISSN: 1615-5262
Elektronische ISSN: 1615-5270
DOI
https://doi.org/10.1007/s10207-013-0215-8

Weitere Artikel der Ausgabe 4/2014

International Journal of Information Security 4/2014 Zur Ausgabe

Regular Contribution

ARITO: Cyber-attack response system using accurate risk impact tolerance

Regular Contribution

Sufficient conditions for sound tree and sequential hashing modes

Regular Contribution

Efficient verifiably encrypted signatures from lattices

Regular Contribution

Enhancing security of cookie-based sessions in mobile networks using sparse caching

Regular Contribution

Randomized gossip algorithms under attack