User Mark

0 votes

Accepted

Are there any algorithms for which generating any zero-knowledge proofs is not practical?

answered Apr 2, 2020 at 18:08

0 votes

Accepted

How is STS more secure than regular DH

answered Jul 27, 2019 at 19:49

0 votes

Sensitivity of probability measure in differential privacy

answered Aug 1, 2019 at 13:59

0 votes

Homomorphic Encryption CKKS scheme, Encoding: canonical embeding discretization

answered Aug 2 at 16:50

0 votes

Homomorphic encryption with both algorithm and data encrypted?

answered Apr 30 at 23:42

0 votes

Sigma parameter from Trapdoors for Lattices

answered Jun 27 at 2:16

0 votes

Regev's learning with error

answered Jul 12 at 18:47

0 votes

Matrix multiplication circuit

answered Jul 12 at 19:15

0 votes

Accepted

Volume $q^n$ of a dual q-ary lattice in MR09

answered Sep 30, 2021 at 18:52

0 votes

Accepted

Would this hash based encryption algorithm work in theory?

answered Apr 12, 2022 at 8:30

0 votes

Accepted

An unconditional proof of a PRP by restricting adversary run time

answered Jun 10, 2022 at 22:33

0 votes

Accepted

Why is using a truly random function in a fixed length encryption scheme not efficient?

answered Jun 8, 2022 at 17:22

0 votes

Small public key size or small signature size, which is preferred?

answered Feb 28, 2022 at 22:27

0 votes

Accepted

Can Shor's algorithm factor over finite fields/rings/groups?

answered Mar 10, 2022 at 19:58

0 votes

LWE Decryption: Generating errors for (c1, c2) that match binary message m

answered Mar 13 at 22:58

0 votes

FHE Relinearization

answered Mar 25 at 18:15

0 votes

Accepted

Reduction from Distinguisher to Indishtinguishability

answered Mar 27 at 18:34

0 votes

Are lattice-based cryptography and error-correcting codes mathematically unsound?

answered Mar 31 at 22:43

0 votes

Reencrypting in Homomorphic Encryption

answered Feb 9 at 20:09

0 votes

ISIS problem in the case of $m=n$

answered Jan 16 at 22:15

0 votes

Showing that CPA encryption schemes cannot preserve the length of a message

answered Jan 21 at 0:22

0 votes

Is there any way to claculate the hash of (a + b +c)) if you only know hash(a) and Hash(b) and Hash(c)?

answered Oct 28, 2022 at 20:56

0 votes

Accepted

Parameters for high density SIS

answered Jun 14, 2022 at 20:50

0 votes

Accepted

On using interaction to achieve FHE from old PHE schemes

answered Jun 16, 2022 at 4:57

0 votes

Why is FHE nontrivial?

answered Nov 19, 2022 at 3:07

-1 votes

FHE modular reduction in specific range

answered Nov 19, 2022 at 2:55

-1 votes

hiding bits inside random bits, is this some sort of encryption?

answered Dec 5, 2021 at 8:59

Stack Exchange Network

327 Answers

Are there any algorithms for which generating any zero-knowledge proofs is not practical?

How is STS more secure than regular DH

Sensitivity of probability measure in differential privacy

Homomorphic Encryption CKKS scheme, Encoding: canonical embeding discretization

Homomorphic encryption with both algorithm and data encrypted?

Sigma parameter from Trapdoors for Lattices

Regev's learning with error

Matrix multiplication circuit

Volume $q^n$ of a dual q-ary lattice in MR09

Would this hash based encryption algorithm work in theory?

An unconditional proof of a PRP by restricting adversary run time

Why is using a truly random function in a fixed length encryption scheme not efficient?

Small public key size or small signature size, which is preferred?

Can Shor's algorithm factor over finite fields/rings/groups?

LWE Decryption: Generating errors for (c1, c2) that match binary message m

FHE Relinearization

Reduction from Distinguisher to Indishtinguishability

Are lattice-based cryptography and error-correcting codes mathematically unsound?

Reencrypting in Homomorphic Encryption

ISIS problem in the case of $m=n$

Showing that CPA encryption schemes cannot preserve the length of a message

Is there any way to claculate the hash of (a + b +c)) if you only know hash(a) and Hash(b) and Hash(c)?

Parameters for high density SIS

On using interaction to achieve FHE from old PHE schemes

Why is FHE nontrivial?

FHE modular reduction in specific range

hiding bits inside random bits, is this some sort of encryption?