Pages that link to "Item:Q2056793"
From MaRDI portal
The following pages link to Efficient range proofs with transparent setup from bounded integer commitments (Q2056793):
Displaying 17 items.
- Practical Range Proof for Cryptocurrency Monero with Provable Security (Q3297505) (← links)
- Batch Range Proof for Practical Small Ranges (Q3558307) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups (Q6110377) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- Zero-knowledge range arguments for signed fractional numbers from lattices (Q6173119) (← links)
- Bicorn: an optimistically efficient distributed randomness beacon (Q6573968) (← links)
- Verifiable decentralized multi-client functional encryption for inner product (Q6604924) (← links)
- Non-interactive zero-knowledge functional proofs (Q6604930) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments (Q6637547) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- An improved threshold homomorphic cryptosystem based on class groups (Q6660542) (← links)
