Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments

DOI10.1007/978-3-031-58740-5_9MaRDI QIDQ6637547FDOQ6637547

Authors: Liam Eagen, Sanket Kanjalkar, Tim Ruffing, Jonas Nick 

Publication date: 13 November 2024

Recommendations

• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Efficient range proofs with transparent setup from bounded integer commitments
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions

zbMATH Keywords

confidential transactionsarithmetic circuits in the discrete logarithm setting

Mathematics Subject Classification ID

Macroeconomic theory (monetary models, models of taxation) (91B64) Cryptography (94A60)

Cites Work

• Parallel coin-tossing and constant-round secure two-party computation
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient Protocols for Set Membership and Range Proofs
• Advances in Cryptology - ASIACRYPT 2003
• Non-interactive Zero-Knowledge Arguments for Voting
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• On the size of pairing-based non-interactive arguments
• Fiat-Shamir transformation of multi-round interactive proofs
• Transparent SNARKs from DARK compilers
• Efficient range proofs with transparent setup from bounded integer commitments
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Recursive proof composition from accumulation schemes
• Expected-time cryptography: generic techniques and applications to concrete soundness
• Tight state-restoration soundness in the algebraic group model
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup

Cited In (1)

• CTA: confidential transactions protocol with state accumulator

This page was built for publication: Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637547)