Pages that link to "Item:Q3593168"
From MaRDI portal
The following pages link to Non-interactive Zero-Knowledge Arguments for Voting (Q3593168):
Displayed 18 items.
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Timed-release computational secret sharing and threshold encryption (Q1692147) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← 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)
- Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
- Verifiable Elections That Scale for Free (Q4916026) (← 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)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← 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)
- Arithmetic sketching (Q6186591) (← links)