Part of the book series:Lecture Notes in Computer Science ((LNSC,volume 6672))
Included in the following conference series:
1111Accesses
Abstract
The notion of encryption simulatability was proposed by Dent to help proving plaintext awareness, and it was claimed that a hybrid encryption scheme composed of a simulatable KEM and a simulatable DEM is simulatable. Here we prove the simulatability of IND-CCA2 secure probabilistic symmetric encryption scheme with every string in its ciphertext space being a valid ciphertext. Moreover, for such a DEM and a simulatable KEM with sparse valid ciphertext space, we show that the resulting hybrid encryption scheme is not simulatable. However, if both the KEM and DEM have sparse valid ciphertext space, or every string in the ciphertext space of the hybrid encryption scheme is a valid ciphertext, then the hybrid encryption scheme is simulatable. Thus the proof for the plaintext awareness of the Cramer-Shoup hybrid encryption scheme provided by Dent is still valid.
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 5719
- Price includes VAT (Japan)
- Softcover Book
- JPY 7149
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 259–274. Springer, Heidelberg (2000)
Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: FOCS, pp. 394–403 (1997)
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk [13], pp. 26–45
Bellare, M., Palacio, A.: Towards plaintext-aware public-key encryption without random oracles. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 48–62. Springer, Heidelberg (2004)
Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92–111. Springer, Heidelberg (1995)
Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk [13], pp. 13–25
Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing 33, 167–226 (2001)
Dent, A.W.: The cramer-shoup encryption scheme is plaintext aware in the standard model. Cryptology ePrint Archive, Report 2005/261 (2005),http://eprint.iacr.org/
Dent, A.W.: The cramer-shoup encryption scheme is plaintext aware in the standard model. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 289–307. Springer, Heidelberg (2006)
Desai, A.: New paradigms for constructing symmetric encryption schemes secure against chosen-ciphertext attack. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 394–412. Springer, Heidelberg (2000)
Gazi, P., Stanek, M.: On ciphertext undetectability. Tatra Mountains Mathematical Publications 41(3), 133 (2008)
Kiltz, E.: Chosen-ciphertext secure key-encapsulation based on gap hashed diffie-hellman. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 282–297. Springer, Heidelberg (2007)
Krawczyk, H. (ed.): CRYPTO 1998. LNCS, vol. 1462. Springer, Heidelberg (1998)
Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427–437. ACM, New York (1990)
Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)
Raimondo, M.D., Gennaro, R., Krawczyk, H.: Deniable authentication and key exchange. In: ACM Conference on Computer and Communications Security, pp. 400–409 (2006)
Teranishi, I., Ogata, W.: Relationship between standard model plaintext awareness and message hiding. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 226–240. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, No.19A Yuquan Road, 100049, Beijing, China
Yamin Liu, Bao Li, Xianhui Lu & Xiaoying Jia
- Yamin Liu
You can also search for this author inPubMed Google Scholar
- Bao Li
You can also search for this author inPubMed Google Scholar
- Xianhui Lu
You can also search for this author inPubMed Google Scholar
- Xiaoying Jia
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
Institute for Infocomm Research, 1 Fusionopolis Way, # 19-01 Connexis (South Tower), 138632, Singapore, Singapore
Feng Bao
Jinan University, Huangpu Avenue West 602, 510632, Tianhe District, Guangzhou, China
Jian Weng
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Li, B., Lu, X., Jia, X. (2011). Encryption Simulatability Reconsidered. In: Bao, F., Weng, J. (eds) Information Security Practice and Experience. ISPEC 2011. Lecture Notes in Computer Science, vol 6672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21031-0_2
Download citation
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-642-21030-3
Online ISBN:978-3-642-21031-0
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative