0
$\begingroup$

Suppose there exists a sender with multiple receivers (one-to-many), the sender and each receiver have their own public and private keys, and the sender generates for each receiver a different message m1,m2... The sender generates for each receiver different messages m1,m2... the ciphertexts c1,c2.... If these ciphertexts are aggregated into c, is there an algorithm that allows a single receiver to decrypt its own plaintext mi from c?

$\endgroup$
1
  • $\begingroup$ What prevents $c = 1\|c_1 \| 2\|c_2\| \ldots \|n\|c_n$? $\endgroup$
    – kelalaka
    Commented Jun 11 at 17:39

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.