Efficient range proofs with transparent setup from bounded integer commitments
type: Item
instance of: scholarly article
title: Efficient range proofs with transparent setup from bounded integer commitments
zbMATH Open document ID: 1479.94149
DOI: 10.1007/978-3-030-77883-5_9
author: Geoffroy Couteau
author: Michael Klooß
author: Huang Lin
author: Michael Reichle
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440640
zbMATH Keywords: range proof
zbMATH Keywords: integer commitments
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 9
OpenAlex ID: W3164127247
cites work: Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
cites work: Zether: towards privacy in a smart contract world
cites work: Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
cites work: Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
cites work: Q3374927
cites work: Efficient Protocols for Set Membership and Range Proofs
cites work: Compact E-Cash
cites work: Removing the Strong RSA Assumption from Arguments over the Integers
cites work: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
cites work: Q4364540
cites work: CryptoComputing with Rationals
cites work: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Non-interactive Zero-Knowledge Arguments for Voting
cites work: Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
cites work: Public Key Cryptography – PKC 2004
cites work: Parallel coin-tossing and constant-round secure two-party computation
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Subvector commitments with application to succinct arguments
cites work: One-Shot Verifiable Encryption from Lattices
cites work: Lattice Signatures without Trapdoors
cites work: Q4035712
cites work: Security Proofs for Signature Schemes
cites work: Security arguments for digital signatures and blind signatures
cites work: Dirichlet’s proof of the three-square theorem: An algorithmic perspective
cites work: Randomized algorithms in number theory
cites work: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
description: scientific article; zbMATH DE number 7440640