Pages that link to "Item:Q3593168"
From MaRDI portal
The following pages link to Non-interactive Zero-Knowledge Arguments for Voting (Q3593168):
Displayed 10 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)
- 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)
- Efficient Non-interactive Range Proof (Q5323058) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)