Pages that link to "Item:Q3600378"
From MaRDI portal
The following pages link to Efficient Protocols for Set Membership and Range Proofs (Q3600378):
Displaying 20 items.
- Rate-limited secure function evaluation (Q329720) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Foundations of fully dynamic group signatures (Q2210441) (← links)
- Privacy-enhanced remote data integrity checking with updatable timestamp (Q2663494) (← links)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership (Q2790035) (← links)
- Foundations of Fully Dynamic Group Signatures (Q2822669) (← links)
- New Techniques for Non-interactive Shuffle and Range Arguments (Q2822687) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- A General, Flexible and Efficient Proof of Inclusion and Exclusion (Q3073693) (← links)
- A Secure and Efficient Proof of Integer in an Interval Range (Q3104687) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- PAChain: Private, Authenticated and Auditable Consortium Blockchain (Q3297622) (← links)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Universally Composable Adaptive Priced Oblivious Transfer (Q3392915) (← links)
- QA-NIZK Arguments of Same Opening for Bilateral Commitments (Q5048959) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Efficient Non-interactive Range Proof (Q5323058) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)