Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Abstract

We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme semantically secure based on the worst-case lattice problem GapSVP. From this we construct a threshold cryptosystem which has a very efficient and non-interactive decryption protocol. We… (More)
DOI: 10.1007/978-3-642-11799-2_13

Topics

  • Presentations referencing similar topics