More efficient commitments from structured lattice assumptions
type: Item
instance of: scholarly article
title: More efficient commitments from structured lattice assumptions
DOI: 10.1007/978-3-319-98113-0_20
author: Carsten Baum
author: Vadim Lyubashevsky
author: Sabine Oechsner
author: Chris Peikert
author: Ivan B. Damgård
publication date: 2018-10-17T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6957563
MaRDI profile type: Publication
full work available at URL: 978-3-319-98113-0 20
OpenAlex ID: W2886714247
Recommended article: Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
Recommended article: Succinct vector, polynomial, and functional commitments from lattices
Recommended article: Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Recommended article: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
Recommended article: Q4343425
Recommended article: Efficient commitment schemes with bounded sender and unbounded receiver
Recommended article: Compact and Efficient UC Commitments Under Atomic-Exchanges
Recommended article: Q4536816
Recommended article: Efficient non-malleable commitment schemes
description: scientific article; zbMATH DE number 6957563