Abstract
To address the question of secure and efficient management of the access credentials so that a user can store and retrieve them using a ‘short and easy-to-remember’ password in a connected world, X. Boyen proposed a user-centric model in ASIACCS’09, named Hidden Credential Retrieval (HCR). The protocol was shown secure under random-oracle model. However, the construction does not explicitly prevent an HCR server from colluding with the third party service provider (i.e., an online bank), which can result into retrieving the hidden credential without the user’s participation. In this paper, we show the HCR construction without the random-oracles with enhanced properties based on Okamoto’s blind signature scheme proposed in TCC’06. For the “Insider attack” model, we provide the attacker (server) with more computational ability in trying to recover the plaintext message from the ciphertext that has been stored in the server by the user, being completely offline. Moreover, we include an explicit notion of identity ID that is useful in practice, so that the server knows whose encrypted credential is to be used in the protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baek, J., Naini, R.S., Susilo, W.: Public Key Encryption with Keyword Search Revisited. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part I. LNCS, vol. 5072, pp. 1249–1259. Springer, Heidelberg (2008)
Bellovin, S.M., Merritt, M.: Encrypted key exchange: Password-based protocols secure against dictionary attacks. In: IEEE Symposium on Security and Privacy- SP 1992, pp. 72–84 (1992)
Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, Heidelberg (1990)
Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31–46. Springer, Heidelberg (2002)
Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)
Boneh, D., Crescenzo, G.D., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Boyen, X.: Hidden Credential Retrieval from a Reusable Password. In: The Proceedings of the 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS 2009, pp. 228–238 (2009)
Camenisch, J., Koprowski, M., Warinschi, B.: Efficient Blind Signatures without Random Oracles. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 134–148. Springer, Heidelberg (2005)
Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multi-Party Computation. In: The Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 639–648 (1996)
Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. In: The Proceedings of the 30th ACM Symposium on Theory of Computing, STOC 1998, pp. 209–218 (1998)
Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402–414. Springer, Heidelberg (1999)
Chaum, D.: Blind signatures for untraceable payments. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 199–203. Springer, Heidelberg (1999)
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: IEEE Symposium on Foundations of Computer Science, FOCS 1995, pp. 41–51 (1995)
Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game. In: The 19th Annual ACM Symposium on the Theory of Computing, STOC 1987, pp. 218–229 (1987)
Juels, A., Luby, M., Ostrovsky, R.: Security of blind digital signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 150–164. Springer, Heidelberg (1997)
Katz, J., Ostrovsky, R., Yung, M.: Efficient password-authenticated key exchange using human-memorable passwords. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 475–494. Springer, Heidelberg (2001)
Kimelfeld, B., Sagiv, Y.: Efficient engines for keyword proximity search. In: WebDB 2005 (2005)
Knuth, D.: The Art of Computer Programming: Sorting and Searching, 3rd edn., vol. 3. Addison-Wesley, Reading (1997)
Liu, F., Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: Proceedings of the 2006 ACM SIGMOD 2006, pp. 563–574 (2006)
Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573–590. Springer, Heidelberg (1999)
Okamoto, T.: Efficient Blind and Partially Blind Signatures Without Random Oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 80–99. Springer, Heidelberg (2006)
Okamoto, T.: Efficient Blind and Partially Blind Signatures Without Random Oracles. Cryptology ePrint Archive: Report 2006/102, http://eprint.iacr.org/2006/102
Yao, A.: How to Generate and Exchange Secrets. In: The 27th Annual IEEE Symposium on the Foundations of Computer Science, FOCS 1986, pp. 162–167 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyaji, A., Rahman, M.S., Soshi, M. (2011). Hidden Credential Retrieval without Random Oracles. In: Chung, Y., Yung, M. (eds) Information Security Applications. WISA 2010. Lecture Notes in Computer Science, vol 6513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17955-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-17955-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17954-9
Online ISBN: 978-3-642-17955-6
eBook Packages: Computer ScienceComputer Science (R0)