The following pages link to (Q4536289):
Displayed 17 items.
- Paillier-based publicly verifiable (non-interactive) secret sharing (Q398963) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Threshold cryptography based on Asmuth-Bloom secret sharing (Q2384533) (← links)
- Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry (Q2817804) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- A Secure Reverse Multi-Attribute First-Price E-Auction Mechanism Using Multiple Auctioneer Servers (Work in Progress) (Q2953875) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Fair Threshold Decryption with Semi-Trusted Third Parties (Q3634502) (← links)
- Practical Threshold Signatures with Linear Secret Sharing Schemes (Q3637139) (← links)
- Formal and Precise Analysis of Soundness of Several Shuffling Schemes (Q4933216) (← links)
- Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption (Q4975186) (← links)
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library (Q5505478) (← links)
- A Tamper-Evident Voting Machine Resistant to Covert Channels (Q5505481) (← links)