 Problem with trying to replicate my custom mouse rotation to all the clients
 How to find asset by it's number? Don't know what this number means
 How best to cook frozen (homemade, not storebought) blintzes?
 Extremely tender beef at hospital
 How to cook extremely soft chicken?
 How do Chinese restaurants tenderize their meat?
 Storing Cream Cheese Icing
 How do I reduce kitchen temperature during cooking?
 A way to prepare suet dumplings ahead of time?
 Pagination, Crawling And Indexing
 Stuck in Majora's Mask Fishing minigame (can't get out)
 Google Sheets formula to calculate gross monthly income based on net annual income
 Google Play Music skips songs and forces page reload
 Cleanse phone numbers data
 How can I download (at once) all the video files I uploaded to BlueJeans?
 Block “{{tag}} question” and similar as a question title
 Can I get the duck back? [duplicate]
 Dynamic Date Comparison in Search filter
 Sitecore 9 forms error
 Monero wallet not syncing properly
Is there a way to double the size of ciphertexts of a publickey scheme which is INDCCA2
Let $\Pi = \left( \mathrm{Gen}, \mathrm{Enc}, \mathrm{Dec} \right)$ a publickey scheme which is secure in the sense of INDCCA2.
Assume the ciphertexts space is $\mathcal{C} \subset \{0,1\}^{n}$.
Can we construct a $\Pi' = \left( \mathrm{Gen}', \mathrm{Enc}', \mathrm{Dec}' \right)$ which is also secure in the sense of INDCCA2 such that $$\mathcal{C}' \subset \{0,1\}^{2n}$$
and for every plaintext $x$,
$$C'(x)/C(x) > ploy(n)$$
and
$$0^{n} \Vert \mathrm{Enc}_{pk}(x) \in C'(x)$$
where $C(x) = \{ y \mid y = \mathrm{Enc}_{pk}(x) \}$.
In general, it seems easy to make the ciphertexts longer keeping the level of security. But if I just modify the form of ciphertexts simply (e.g. $r \Vert \mathrm{Enc}_{pk}(x)$ for $r \leftarrow \{ 0,1 \}^{n}$). It can not be secure in the sense of INDCCA2 any more.
This is actually a very interesting theoretical question that was open for many years. For CPAsecure encryption, it is possible to simply concatenate ciphertexts in o

This is actually a very interesting theoretical question that was open for many years. For CPAsecure encryption, it is possible to simply concatenate ciphertexts in order to increase the plaintext space. However, for CCA2, it is not sufficient to concatenate since it's possible to move around the bits and maul the ciphertext. Note that if you assume that the original plaintext space is large (superpolynomial), then it's easy to solve by just using hybrid encryption. This is because you can encrypt a symmetric key and work from there. However, if the plaintext space is small  especially hard if a single bit  then it's very unclear. Fortunately, Myers and shelat solved this in FOCS 2009 in a paper entitled Bit encryption is complete.
20180321 18:14:04