A commutative encryption system allows a message encrypted with two different keys to be decrypted using the keys in either order.
Questions tagged [commutative-encryption]
41 questions
7
votes
3 answers
Is there a way to prove equality of plaintext that was encrypted using different public keys?
Imagine if Alice encrypts message to Bob (using public key $P_{bob}$) and then Bob encrypts the same message to Carol (using $P_{carol}$). Is there a way for Bob to prove that:
$P_{carol}$ was indeed used
Message is still the same that Alice passed…

Pavel
- 171
- 4
4
votes
4 answers
Are there transitive ciphers (either symmetric and asymmetric)
Say Alice has information that's already encrypted with Bob's key.
She wants Bob to decrypt it without knowing what he just decrypted.
So she encrypts it with her key and sends it to him, he decrypts with his key, and sends it back and she decrypts…

Nati Keidar
- 63
- 1
- 4
1
vote
1 answer
Same hash for subsets of a set?
Suppose I have a set $S$ containing $n$ bit strings, where $n$ is on the order of about 10. Consider
$$\mathfrak{S} = \{ R : R \subseteq S, |R| \geq 2 \},$$
the collection of subsets of $S$ with two or more elements.
Does there exist a hashing…

TheIntern
- 111
- 3