Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts
Authors:
Open Access
- 6 April 2019
- book chapter
- Published by Springer Nature
- p. 344-373
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Lattice-Based Zero-Knowledge Arguments for Integer Relations2018
- One-Shot Verifiable Encryption from Lattices2017
- Blueprint for a microwave trapped ion quantum computerScience Advances, 2017
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting2016
- Efficiently Verifiable Computation on Encrypted Data2014
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures2014
- On Ideal Lattices and Learning with Errors over RingsJournal of the ACM, 2013
- Surface codes: Towards practical large-scale quantum computationPhysical Review A, 2012
- Generalized Compact Knapsacks Are Collision Resistant2006
- Practical Verifiable Encryption and Decryption of Discrete Logarithms2003