nach oben

Erschienen in:

2018 | OriginalPaper | Buchkapitel

Anonymous Identity-Based Hash Proof System from Lattices in the Standard Model

verfasst von : Qiqi Lai, Bo Yang, Yong Yu, Yuan Chen, Liju Dong

Erschienen in: Information Security and Privacy

Verlag: Springer International Publishing

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

An Identity-Based Hash Proof System (IB-HPS) is a fundamental and important primitive, which is widely adapted to construct a number of cryptographic schemes and protocols, especially for leakage-resilient ones. Therefore it is significant to instantiate IB-HPSs from various assumptions. However, all existing IB-HPSs based on lattices are set only in the random oracle model. Thus, proposing an IB-HPS from lattices in the standard model is an essential and interesting work.

In this paper, we introduce a much more compact definition for an anonymous IB-HPS, defining computational indistinguishability of valid/invalid ciphertexts and anonymity of identity simultaneously. Then, through utilizing the technique for delegating a short lattice basis due to Agrawal et al. in CRYPTO 2010 and the property of the smoothing parameter over random lattices, we present a new construction of IB-HPS in the standard model. Furthermore, we show that our new construction is selectively secure and anonymous based on the standard learning with errors (LWE) assumption in the standard model.

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

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 "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"

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

Vorheriges Kapitel Lattice-Based Dual Receiver Encryption and More

Nächstes Kapitel Post-Quantum One-Time Linkable Ring Signature and Application to Ring Confidential Transactions in Blockchain (Lattice RingCT v1.0)

Nur mit Berechtigung zugänglich

In order to understand the difference between the concepts of an IB-HPS and an IB-KEM, one can refer to the similar relationship between a HPS and a KEM in the public-key setting. A HPS can always be viewed as a KEM in the modular construction of public-key encryption schemes. Besides, a HPS is a basic cryptographic primitive, which can be furthermore construct many protocols in different applications [9‐15]. However, a KEM can be utilized only in the encryption schemes for message transmission.

More strictly, we need first choose a collision-resilient hash function \(h:\{0,1\}^*\rightarrow \{0,1\}^d\), then map arbitrary identity, such as email address, phone number and passport number, to the bit strings of length d.

Here it is more convenient for us to view mpk as an implicit parameter. This is because all different decapsulation algorithms have the same mpk as input.

Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553–572. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_28CrossRefMATH

Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 98–115. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_6CrossRefMATH

Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 113–134. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_6CrossRefMATH

Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: Proceedings of STACS 2009, Freiburg, Germany, pp. 75–86 (2009)

Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1–9. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48523-6_1CrossRef

Baek, J., Duncan, S., Li, J., Au, M.H.: Efficient generic construction of CCA-secure identity-based encryption from randomness extraction. Comput. J. 59(4), 508–521 (2016)CrossRefMathSciNet

Boneh, D., Gentry, C., Hamburg M.: Space-efficient identity based encryption without pairings. In: Proceedings of FOCS 2007, Providence, RI, USA, pp. 647–657 (2007)

Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523–552. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_27CrossRef

Chen, R., Mu, Y., Yang, G., Susilo, W., Guo, F., Zhang, M.: Cryptographic reverse firewall via malleable smooth projective hash functions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 844–876. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53887-6_31CrossRef

10.

Chen, R., Mu, Y., Yang, G., Susilo, W., Guo, F.: Strong authenticated key exchange with auxiliary inputs. Des. Codes Cryptogr. 85(1), 145–173 (2017)MathSciNetCrossRefMATH

11.

Chen, R., Mu, Y., Yang, G., Susilo, W., Guo, F.: Strongly leakage-resilient authenticated key exchange. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 19–36. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-29485-8_2CrossRef

12.

Chen, R., Mu, Y., Yang, G., Susilo, W., Guo, F., Zheng, Y.: A note on the strong authenticated key exchange with auxiliary inputs. Des. Codes Cryptogr. 85(1), 175–178 (2017)MathSciNetCrossRefMATH

13.

Chen, R., Mu, Y., Yang, G., Guo, F., Wang, X.: Dual-server public-key encryption with keyword search for secure cloud storage. IEEE Trans. Inf. Forensics Secur. 11(4), 789–798 (2016)

14.

Chen, R., Mu, Y., Susilo, W., Yang, G., Guo, F., Zhang, M.: One-round strong oblivious signature-based envelope. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 3–20. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40367-0_1CrossRef

15.

Chen, R., Mu, Y., Yang, G., Guo, F., Wang, X.: A new general framework for secure public key encryption with keyword search. In: Foo, E., Stebila, D. (eds.) ACISP 2015. LNCS, vol. 9144, pp. 59–76. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19962-7_4CrossRef

16.

Chen, Y., Zhang, Z., Lin, D., Cao, Z.: Anonymous identity-based hash proof system and its applications. In: Takagi, T., Wang, G., Qin, Z., Jiang, S., Yu, Y. (eds.) ProvSec 2012. LNCS, vol. 7496, pp. 143–160. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33272-2_10CrossRef

17.

Chen, Y., Zhang, Z., Lin, D., Cao, Z.: Generalized (identity-based) hash proof system and its applications. Secur. Commun. Netw. 9(12), 1698–1716 (2016)CrossRef

18.

Chen, Y., Zhang, Z., Lin, D., Cao, Z.: Identity-based extractable hash proofs and their applications. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol. 7341, pp. 153–170. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31284-7_10CrossRef

19.

Chen, Y., Zhang, Z., Lin, D., Cao, Z.: CCA-secure IB-KEM from identity-based extractable hash proof system. Comput. J. 57(10), 1537–1556 (2014)CrossRef

20.

Chow, S.M., Dodis, Y., Rouselakis, Y., Waters, B.: Practical leakage-resilient identity-based encryption from simple assumptions. In: Proceedings of the 17th ACM Conference on Computer and Communications Security–CCS 2010, Chicago, Illinois, USA, pp. 152–161 (2010)

21.

Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45–64. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46035-7_4CrossRef

22.

Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 361–381. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11799-2_22CrossRef

23.

Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing–STOC 2008, Victoria, British Columbia, Canada, pp. 197–206 (2008)

24.

Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 553–571. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74143-5_31CrossRef

25.

Katz, J., Vaikuntanathan, V.: Smooth projective hashing and password-based authenticated key exchange from lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 636–652. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10366-7_37CrossRef

26.

Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267–302 (2007)MathSciNetCrossRefMATH

27.

Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 18–35. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03356-8_2CrossRef

28.

Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1–40 (2009)MathSciNetCrossRefMATH

29.

Peikert, C.: Limits on the hardness of lattice problems in \(\ell _p\) norms. Comput. Complex. 17(2), 300–351 (2008)MathSciNetCrossRefMATH

Titel: Anonymous Identity-Based Hash Proof System from Lattices in the Standard Model
verfasst von: Qiqi Lai
Bo Yang
Yong Yu
Yuan Chen
Liju Dong
Verlag: Springer International Publishing
Buch: Information Security and Privacy
Print ISBN: 978-3-319-93637-6

Electronic ISBN: 978-3-319-93638-3

Copyright-Jahr: 2018
DOI: https://doi.org/10.1007/978-3-319-93638-3_31

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner