The following pages link to (Q2707412):
Displaying 13 items.
- Electronic jury voting protocols (Q596143) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Secret, verifiable auctions from elections (Q1749541) (← links)
- Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)
- Generic plaintext equality and inequality proofs (Q2145406) (← links)
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers (Q2200560) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Absentia: secure multiparty computation on ethereum (Q2670861) (← links)
- A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits (Q3097998) (← links)
- Bit-Slice Auction Circuit (Q5030176) (← links)
- How to obtain full privacy in auctions (Q5492128) (← links)
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security (Q5492131) (← links)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data (Q6554885) (← links)
