Abstract
The notion of key-privacy for encryption schemes was formally defined by Bellare, Boldyreva, Desai and Pointcheval in Asiacrypt 2001. This security notion has the application possibility in circumstances where anonymity is important. In this paper, we investigate the key-privacy issues of McEliece public-key encryption and its significant variants. To our best knowledge, it is the first time to consider key-privacy for such code-based public-key encryption, in the literature. We examine that the key-privacy is not available in the plain McEliece scheme, but can be achieved by some modification, with showing a rigorous proof. We believe that key-privacy confirmation will further magnify the application of McEliece and other code-based cryptography.
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
Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-Privacy in Public-Key Encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566–582. Springer, Heidelberg (2001)
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations Among Notions of Security for Public-Key Encryption Schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998)
Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: 1993 ACM Conf. Computer and Communications Security, pp. 62–73 (1993)
Courtois, N., Finiasz, M., Sendrier, N.: How to Achieve a McEliece-Based Digital Signature Scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157–174. Springer, Heidelberg (2001)
Halevi, S.: A Sufficient Condition for Key-Privacy. Cryptology ePrint Archive: Report 2005/005 (2005)
Kobara, K., Imai, H.: Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC. Public Key Cryptography, pp. 19–35 (2001)
McEliece, R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. Deep Space Network Progress Rep. (1978)
Niederreiter, H.: Knapsack-type Cryptosystems and Algebraic Coding Theory. Prob. of Control and Inf. Theory 15(2), 159–166 (1986)
Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic Security for the McEliece Cryptosystem without Random Oracles. In: WCC 2007, pp. 257–268 (2007)
Shoup, V.: Sequences of Games: a Tool for Taming Complexity in Security Proofs. Cryptology ePrint Archive: Report 2004/332 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamakawa, S., Cui, Y., Kobara, K., Hagiwara, M., Imai, H. (2007). On the Key-Privacy Issue of McEliece Public-Key Encryption. In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-77224-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77223-1
Online ISBN: 978-3-540-77224-8
eBook Packages: Computer ScienceComputer Science (R0)