Efficient range proofs with transparent setup from bounded integer commitments
From MaRDI portal
Publication:2056793
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
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology - ASIACRYPT 2003
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Compact E-Cash
- Compact privacy protocols from post-quantum and timed classical assumptions
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Cryptocomputing with rationals
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- Efficient Protocols for Set Membership and Range Proofs
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Efficient proofs that a committed number lies in an interval
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Lattice signatures without trapdoors
- Non-interactive Zero-Knowledge Arguments for Voting
- One-shot verifiable encryption from lattices
- Parallel coin-tossing and constant-round secure two-party computation
- Public Key Cryptography – PKC 2004
- Randomized algorithms in number theory
- Removing the strong RSA assumption from arguments over the integers
- Security arguments for digital signatures and blind signatures
- Security proofs for signature schemes
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Subvector commitments with application to succinct arguments
- The Knowledge Complexity of Interactive Proof Systems
- Zether: towards privacy in a smart contract world
Cited in
(22)- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- 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
- Removing the strong RSA assumption from arguments over the integers
- Vector commitments with proofs of smallness: short range proofs and more
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- Fast public-key silent OT and more from constrained Naor-Reingold
- Efficient proofs that a committed number lies in an interval
- An improved threshold homomorphic cryptosystem based on class groups
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
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)
