138 reputation
6
bio website cs.brown.edu/~csaftoiu
location New York, NY
age 26
visits member for 8 months
seen Sep 19 at 14:27

Graduated from Brown University.


Apr
27
awarded  Teacher
Mar
17
awarded  Scholar
Mar
17
accepted Do any one-key-of-many cryptographic schemes exist?
Mar
13
comment Do any one-key-of-many cryptographic schemes exist?
Oh that's awesome! Way more efficient than encrypting the entire message n times.
Mar
12
comment Do any one-key-of-many cryptographic schemes exist?
@RickyDemer: Aw was looking forward to it. I'll try searching around those keywords. I still don't see why a random key would work. I could see a scheme where if I have as many shared keys as 2^bit length then anyone could decrypt it w/ a random string, but I don't see why it's trivially impossible where if I have only 5 keys, only 5 other keys would be able to decrypt it. However, my grasp of the math behind cryptography is very elementary, so I realize my intuitions are probably in accurate.
Mar
12
awarded  Student
Mar
12
comment Do any one-key-of-many cryptographic schemes exist?
@RickyDemer: Oh heh trivial in that sense. Hmm so what if he does - why does that make it impossible? Because there's no way a static subset of keys would be able to decrypt an essentially infinite number of possibilities? In any case, can you think of any options where the ciphertext length does scale sublinearly with n but the original message can be retrieved (perhaps from a different part of each decryption)?
Mar
12
comment Do any one-key-of-many cryptographic schemes exist?
@RickyDemer: I do want each recipient to get the same message. Why is it trivial as it stands? Say there are five people and with each of them I share a different key, a, b, c, d, e, respectively. They each only know one of the keys. I want to encrypt M into E so that each of the five people can fully decrypt E back to M. And yep I don't want len(E)=5*len(M). What's a trivial way to do that?
Mar
11
awarded  Supporter
Mar
11
answered Are RSA or ECC vulnerable to an attack where the same (unknown) plaintext is encrypted with multiple public keys?
Mar
11
revised Are RSA or ECC vulnerable to an attack where the same (unknown) plaintext is encrypted with multiple public keys?
added 363 characters in body
Mar
11
revised Are RSA or ECC vulnerable to an attack where the same (unknown) plaintext is encrypted with multiple public keys?
added 125 characters in body
Mar
11
revised Are RSA or ECC vulnerable to an attack where the same (unknown) plaintext is encrypted with multiple public keys?
added 125 characters in body
Mar
11
awarded  Editor
Mar
11
revised Do any one-key-of-many cryptographic schemes exist?
added 37 characters in body
Mar
11
asked Are RSA or ECC vulnerable to an attack where the same (unknown) plaintext is encrypted with multiple public keys?
Mar
11
asked Do any one-key-of-many cryptographic schemes exist?
Mar
11
awarded  Autobiographer