Efficient range proofs with transparent setup from bounded integer commitments

DOI10.1007/978-3-030-77883-5_9zbMath1479.94149OpenAlexW3164127247MaRDI QIDQ2056793

Geoffroy Couteau, Michael Reichle, Michael Klooß, Huang Lin

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_9

zbMATH Keywords

range proofinteger commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Short-lived zero-knowledge proofs and signatures ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel coin-tossing and constant-round secure two-party computation
• Security arguments for digital signatures and blind signatures
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Subvector commitments with application to succinct arguments
• Zether: towards privacy in a smart contract world
• Security Proofs for Signature Schemes
• Lattice Signatures without Trapdoors
• Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
• CryptoComputing with Rationals
• Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
• Non-interactive Zero-Knowledge Arguments for Voting
• Efficient Protocols for Set Membership and Range Proofs
• Randomized algorithms in number theory
• The Knowledge Complexity of Interactive Proof Systems
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Dirichlet’s proof of the three-square theorem: An algorithmic perspective
• Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
• Compact E-Cash
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• One-Shot Verifiable Encryption from Lattices
• Removing the Strong RSA Assumption from Arguments over the Integers
• Public Key Cryptography – PKC 2004
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Efficient range proofs with transparent setup from bounded integer commitments