User preethi

10 votes

1 answer

1k views

Use of q-ary lattices in developing cryptosystems

asked Sep 24, 2015 at 6:06

10 votes

2 answers

2k views

Why is the Lovász condition used in the LLL algorithm?

asked Aug 23, 2016 at 6:30

9 votes

1 answer

1k views

Gaussian distribution in lattices

asked Feb 10, 2016 at 4:18

6 votes

1 answer

688 views

Hardness of Short Interger Solution in Lattices

asked May 14, 2018 at 6:31

5 votes

0 answers

3k views

How babai nearest plane algorithm solves approximate CVP

asked Aug 16, 2016 at 10:26

5 votes

1 answer

896 views

Significance of Gram-Schmidt coefficients in LLL algorithm

asked Jan 15, 2017 at 5:25

4 votes

1 answer

265 views

Is there any reduction from Short Integer Solution to $\textrm{SIVP}_\gamma$

asked Jun 8, 2017 at 3:46

4 votes

1 answer

212 views

apprSVP in lattices

asked Sep 16, 2015 at 6:46

4 votes

2 answers

808 views

Difference between special honest verifier zero-knowledge and zero-knowledge property

asked May 24, 2018 at 10:18

4 votes

1 answer

443 views

Finding the basis of the transpose of a q-ary lattice

asked Jul 1, 2019 at 11:33

3 votes

1 answer

226 views

Advantages of group signature schemes without encryption over with encryption

asked Jun 16, 2018 at 5:59

3 votes

2 answers

979 views

What happens if we choose the random secret keys in Diffie-Hellman greater than prime?

asked Jan 30, 2019 at 14:19

3 votes

1 answer

1k views

Can we construct a simulation sound NIZK (Non Interactive Zero-Knowledge) proof?

asked Mar 23, 2018 at 4:12

3 votes

2 answers

187 views

Correctness of ideal protocol of MPC in presence of malicious adversary

asked Jul 15, 2015 at 9:28

2 votes

1 answer

403 views

Why the basis is reduced in nearest plane algorithm in solving CVP

asked Aug 8, 2016 at 9:33

2 votes

1 answer

606 views

finding the basis of a kernel in a lattice

asked Feb 17, 2016 at 10:44

2 votes

2 answers

450 views

Single theorem adaptive vs non-adaptive non-interactive zero-knowledge proofs [duplicate]

asked Jan 30, 2018 at 9:09

2 votes

0 answers

213 views

Hardness of $SIS$ and its reduction to an NP-complete problem

asked Feb 17, 2018 at 10:19

1 vote

1 answer

701 views

why babai rounding technique does not work for finding closest vector using bad basis

asked Jan 9, 2017 at 6:25

1 vote

1 answer

226 views

Use of orthogonal vectors in lattice-based cryptography

asked Feb 18, 2016 at 5:48

1 vote

2 answers

538 views

Gaussian function in lattices

asked Feb 24, 2016 at 0:32

1 vote

1 answer

92 views

Does the signatures generated by a revoked member before revocation remains valid in VLR group signatures

asked May 1, 2019 at 9:14

0 votes

1 answer

144 views

Can we use non-adaptive zero-knowledge proof in group signatures

asked Jan 30, 2018 at 3:20

0 votes

1 answer

376 views

Disjunction of several instances of sigma protocol

asked May 23, 2018 at 7:22

0 votes

1 answer

257 views

How Hermite Lattice reduced basis implies LLL reduced basis?

asked Jan 23, 2017 at 5:47

-2 votes

1 answer

872 views

Advantages of Lattice-based cryptography over elliptic curve cryptography

asked Oct 22, 2017 at 5:27

Stack Exchange Network

26 Questions

Use of q-ary lattices in developing cryptosystems

Why is the Lovász condition used in the LLL algorithm?

Gaussian distribution in lattices

Hardness of Short Interger Solution in Lattices

How babai nearest plane algorithm solves approximate CVP

Significance of Gram-Schmidt coefficients in LLL algorithm

Is there any reduction from Short Integer Solution to $\textrm{SIVP}_\gamma$

apprSVP in lattices

Difference between special honest verifier zero-knowledge and zero-knowledge property

Finding the basis of the transpose of a q-ary lattice

Advantages of group signature schemes without encryption over with encryption

What happens if we choose the random secret keys in Diffie-Hellman greater than prime?

Can we construct a simulation sound NIZK (Non Interactive Zero-Knowledge) proof?

Correctness of ideal protocol of MPC in presence of malicious adversary

Why the basis is reduced in nearest plane algorithm in solving CVP

finding the basis of a kernel in a lattice

Single theorem adaptive vs non-adaptive non-interactive zero-knowledge proofs [duplicate]

Hardness of $SIS$ and its reduction to an NP-complete problem

why babai rounding technique does not work for finding closest vector using bad basis

Use of orthogonal vectors in lattice-based cryptography

Gaussian function in lattices

Does the signatures generated by a revoked member before revocation remains valid in VLR group signatures

Can we use non-adaptive zero-knowledge proof in group signatures

Disjunction of several instances of sigma protocol

How Hermite Lattice reduced basis implies LLL reduced basis?

Advantages of Lattice-based cryptography over elliptic curve cryptography