Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures

@inproceedings{Benhamouda2014BetterZP,
  title={Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures},
  author={Fabrice Benhamouda and Jan Camenisch and Stephan Krenn and Vadim Lyubashevsky and Gregory Neven},
  booktitle={ASIACRYPT},
  year={2014}
}
Lattice problems are an attractive basis for cryptographic systems because they seem to offer better security than discrete logarithm and factoring based problems. Efficient lattice-based constructions are known for signature and encryption schemes. However, the constructions known for more sophisticated schemes such as group signatures are still far from being practical. In this paper we make a number of steps towards efficient lattice-based constructions of more complex cryptographic… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 36 CITATIONS

C R ] 2 J an 2 01 9 Accountable Tracing Signatures from Lattices

  • 2019
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

On the Non-Existence of Short Vectors in Random Module Lattices

Ngoc Khanh Nguyen
  • IACR Cryptology ePrint Archive
  • 2019

Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ

  • IACR Cryptology ePrint Archive
  • 2019
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.