meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 6 months |
| seen | 1 hour ago | |
| stats | profile views | 9 |
|
Mar 22 |
comment |
How to compute the dot product on encrypted values? @RickyDemer. I misunderstood the scheme. I thought that you were able to do just one multiplications but after D.W explanation it's clear that you can do more unless you want to multiply them together. Thank you |
|
Mar 22 |
accepted | How to compute the dot product on encrypted values? |
|
Mar 21 |
comment |
How to compute the dot product on encrypted values? @RickyDemer in my case there is not secure multiparty computation. I have $m$ nodes. Each node is giving its $n$ integer values to another party who computes the dot product of all pairs of $m$ nodes.Also the cited reference at the link says for a public key construction with 1 multiplication but for dot product i need $n$ |
|
Mar 21 |
asked | How to compute the dot product on encrypted values? |
|
Mar 20 |
answered | Security of Deterministic Encryption Scheme |
|
Mar 19 |
revised |
Is Convergent Encryption really secure? added 1197 characters in body |
|
Mar 13 |
comment |
Is there an efficient way to hide the encrypted plaintext length with a block cipher? @PaŭloEbermann i want to hide plaintext size |
|
Mar 11 |
comment |
Is there an efficient way to hide the encrypted plaintext length with a block cipher? The intuition of the question is to expand the ciphertext size such that when you encrypt only one block of plaintext and the message is one block to further produce more ciphertext blocks |
|
Mar 11 |
comment |
Is there an efficient way to hide the encrypted plaintext length with a block cipher? @fgrieu I.e: 16bytes of plaintext to 128*16bytes of ciphertext or to k*16bytes of ciphertext tuned by a parameter $k$ appropriately, given as input to the block cipher |
|
Mar 11 |
asked | Is there an efficient way to hide the encrypted plaintext length with a block cipher? |
|
Mar 3 |
answered | Why is Bcrypt called a Key Derivation Function? |
|
Mar 3 |
comment |
Why is elliptic curve cryptography not widely used, compared to RSA? @ThomasPornin Why then RSA outperfoms only in signature verification?and not in all other crypto-operations like encryption,decryption, signature.The operation is the same: Modular exponentiation vs multiplications on elliptic curve over much smaller modulo |
|
Mar 3 |
comment |
Why is elliptic curve cryptography not widely used, compared to RSA? @ThomasPornin Do you have a citation for the outperfomance of RSA on signatures verification ? |
|
Mar 3 |
answered | What goals is homomorphic encryption aiming to solve? |
|
Feb 28 |
answered | What is the difference between MAC and HMAC? |
|
Feb 28 |
revised |
Is SHA-1 still practical secure under specific scenarios? edited body |
|
Feb 28 |
accepted | Is SHA-1 still practical secure under specific scenarios? |
|
Feb 28 |
comment |
Is SHA-1 still practical secure under specific scenarios? @CodesInChaos Yes the key is unknown |
|
Feb 27 |
asked | Is SHA-1 still practical secure under specific scenarios? |
|
Feb 25 |
accepted | Which one is fastest? Karatsuba or Montgomery multiplication? |
