The following pages link to (Q4450762):
Displayed 18 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers (Q2200560) (← links)
- Privacy-preserving Krawtchouk moment feature extraction over encrypted image data (Q2666794) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Public-Key Cryptosystems with Primitive Power Roots of Unity (Q3511155) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer (Q5025956) (← links)
- ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL (Q5402657) (← links)
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions (Q5738751) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- Optimally Sound Sigma Protocols Under DCRA (Q5854433) (← links)
- A Simpler Rate-Optimal CPIR Protocol (Q5854446) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- How to verifiably encrypt many bits for an election? (Q6109453) (← links)
- Non-interactive secure computation of inner-product from LPN and LWE (Q6135407) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)