The following pages link to (Q4783736):
Displaying 17 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Electronic jury voting protocols (Q596143) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- Privacy Preserving Data Mining within Anonymous Credential Systems (Q3540036) (← links)
- Simplified Submission of Inputs to Protocols (Q3540053) (← links)
- A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting (Q3600375) (← links)
- A Commitment-Consistent Proof of a Shuffle (Q3634509) (← links)
- Formal and Precise Analysis of Soundness of Several Shuffling Schemes (Q4933216) (← links)
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security (Q5492131) (← links)
- Practical construction for secure trick-taking games even with cards set aside (Q6573960) (← links)
- Shuffle arguments based on subset-checking (Q6660397) (← links)
- Efficient succinct zero-knowledge arguments in the CL framework (Q6665550) (← links)
