Efficient range proofs with transparent setup from bounded integer commitments
From MaRDI portal
Publication:2056793
DOI10.1007/978-3-030-77883-5_9zbMATH Open1479.94149OpenAlexW3164127247MaRDI QIDQ2056793FDOQ2056793
Authors: Geoffroy Couteau, Michael Klooß, Huang Lin, Michael Reichle 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_9
Recommendations
- Efficient Non-interactive Range Proof
- Efficient Protocols for Set Membership and Range Proofs
- A secure and efficient proof of integer in an interval range
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
Cites Work
- Security arguments for digital signatures and blind signatures
- Security proofs for signature schemes
- Parallel coin-tossing and constant-round secure two-party computation
- Title not available (Why is that?)
- Lattice signatures without trapdoors
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- The Knowledge Complexity of Interactive Proof Systems
- Compact E-Cash
- Public Key Cryptography – PKC 2004
- Efficient Protocols for Set Membership and Range Proofs
- Title not available (Why is that?)
- Efficient proofs that a committed number lies in an interval
- Advances in Cryptology - ASIACRYPT 2003
- Randomized algorithms in number theory
- Non-interactive Zero-Knowledge Arguments for Voting
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- One-shot verifiable encryption from lattices
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Subvector commitments with application to succinct arguments
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Zether: towards privacy in a smart contract world
- Cryptocomputing with rationals
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- Compact privacy protocols from post-quantum and timed classical assumptions
- Removing the strong RSA assumption from arguments over the integers
Cited In (22)
- A secure and efficient proof of integer in an interval range
- Batch range proof for practical small ranges
- Bicorn: an optimistically efficient distributed randomness beacon
- Practical Range Proof for Cryptocurrency Monero with Provable Security
- Efficient Protocols for Set Membership and Range Proofs
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Non-interactive zero-knowledge functional proofs
- Verifiable decentralized multi-client functional encryption for inner product
- Efficient Non-interactive Range Proof
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- An algebraic framework for silent preprocessing with trustless setup and active security
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Zero-knowledge arguments for subverted RSA groups
- Short-lived zero-knowledge proofs and signatures
- Vector commitments with proofs of smallness: short range proofs and more
- Removing the strong RSA assumption from arguments over the integers
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- Fast public-key silent OT and more from constrained Naor-Reingold
- An improved threshold homomorphic cryptosystem based on class groups
- Efficient proofs that a committed number lies in an interval
- 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
This page was built for publication: Efficient range proofs with transparent setup from bounded integer commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056793)
