The following pages link to (Q4502505):
Displaying 14 items.
- New receipt-free voting scheme using double-trapdoor commitment (Q543836) (← links)
- Electronic jury voting protocols (Q596143) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- Formal and Precise Analysis of Soundness of Several Shuffling Schemes (Q4933216) (← links)
- Bit-Slice Auction Circuit (Q5030176) (← links)
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security (Q5492131) (← links)
- A theory of composition for differential obliviousness (Q6085261) (← links)
- \(\log^\ast\)-round game-theoretically-fair leader election (Q6108988) (← links)
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption (Q6134817) (← links)
- Lattice-Based Proof of a Shuffle (Q6166544) (← links)
