publication . Part of book or chapter of book . Other literature type . Conference object . 2019

Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts

Vadim Lyubashevsky; Rafaël Del Pino; Gregor Seiler;
Open Access English
  • Published: 18 Jan 2019
  • Publisher: Springer International Publishing
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produced by several users, it is important that each user proves that her input is indeed well-formed. This may simply mean that the inputs are valid FHE ciphertexts or, more generally, that the plaintexts m additionally satisfy f(m) = 1 for some public function f. The most efficient FHE schemes are based on the hardness of the Ring-LWE problem and so a natural solution would be to use lattice-based zero-knowledge proofs for proving properties about the ciphertext. Such methods, however, require larger-than-necessary parameters and result in rather long proofs, especial...
arXiv: Computer Science::Cryptography and Security
free text keywords: Encryption, business.industry, business, Computation, Ciphertext, Mathematical proof, Discrete logarithm, Computer science, Discrete mathematics, Lattice (order)
Related Organizations
Funded by
EC| FutureTPM
Future Proofing the Connected World: A Quantum-Resistant Trusted Platform Module
  • Funder: European Commission (EC)
  • Project Code: 779391
  • Funding stream: H2020 | RIA
Download fromView all 4 versions
Conference object . 2019
Provider: ZENODO
Part of book or chapter of book
Provider: UnpayWall
Part of book or chapter of book . 2019
Provider: Crossref
Any information missing or wrong?Report an Issue