meta user
network profile
| bio | website | cs.rutgers.edu/~david.cash |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 6 months |
| seen | 2 days ago | |
| stats | profile views | 112 |
|
Mar 19 |
comment |
Encryption with Deduplication Here's one published this year: eprint.iacr.org/2012/631.pdf |
|
Mar 16 |
answered | Strong encryption done by hand |
|
Feb 16 |
awarded | Critic |
|
Dec 23 |
awarded | Commentator |
|
Dec 23 |
comment |
Blind quantum computing and fully homomorphic encryption It appears to require a quantum computer and thus is not a serious contender for cloud computing applications. |
|
Dec 18 |
comment |
Individual bits of Textbook RSA @user4544 If I know the Jacobi symbol of $r$, then I can distinguish $r\oplus 0^n$ from $r\oplus 1^n$ with non-negligible probability. But if one wants to explore practical implications (at the end of the day), then that scheme has even bigger problems, like complete CCA insecurity. |
|
Dec 17 |
comment |
Individual bits of Textbook RSA @user4544: It is conjectured that no bit of $r$ can be recovered (I think.) But your PKE construction will not be IND-CPA secure, even if all input bits are hardcore for RSA. This is because your scheme will leak the Jacobi symbol (and possible more information). It was exactly this confusion that motivated my original comment above. |
|
Dec 17 |
comment |
Individual bits of Textbook RSA @user4544: The Jacobi symbol of $m$ can be computed from $m^e \mod N$. |
|
Dec 17 |
comment |
Individual bits of Textbook RSA One should clarify what a "bit" is here: the RSA function is indeed known to leak (at least) one bit of information about $m$. The conjecture that every bit is hardcore (which is how I interpreted your answer) would not contradict this. |
|
Dec 14 |
answered | Public keys and their protocols |
|
Dec 12 |
revised |
What are the benefits of lattice based cryptography? added 2 characters in body |
|
Dec 12 |
answered | What are the benefits of lattice based cryptography? |
|
Dec 11 |
awarded | Editor |
|
Dec 11 |
revised |
What are the cryptographic assumptions in the Dolev Yao model? added 3 characters in body |
|
Dec 11 |
answered | What are the cryptographic assumptions in the Dolev Yao model? |
|
Dec 11 |
answered | Need for Twin Elgamal encryption |
|
Dec 6 |
answered | Does RSA-OEAP have integrity and authenticity properties? |
|
Dec 1 |
answered | Weakness in using only one RSA key pair for two-way communication? |
|
Dec 1 |
comment |
Weakness in using only one RSA key pair for two-way communication? Can you be more specific about what you mean by half of an RSA private key? |
|
Nov 30 |
answered | What is an oracle adversary? |
