Published in

Springer, Lecture Notes in Computer Science, p. 305-325, 2015

DOI: 10.1007/978-3-319-24174-6_16

Links

Tools

Export citation

Search in Google Scholar

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

Proceedings article published in 2015 by Fabrice Benhamouda ORCID, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge. Our scheme maps elements from the ring (or equivalently, n elements from