The following pages link to (Q4502496):
Displaying 12 items.
- An efficient IND-CCA2 secure Paillier-based cryptosystem (Q456166) (← links)
- The Rabin cryptosystem revisited (Q2349533) (← links)
- Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences (Q2490987) (← links)
- A research on new public-key encryption schemes (Q2572324) (← links)
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
- Bi-deniable public-key encryption protocol which is secure against active coercive adversary (Q2831419) (← links)
- Public-Key Encryptions Tolerating Adaptive and Composable Adversaries (Q3001858) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Public-Key Cryptosystems with Primitive Power Roots of Unity (Q3511155) (← links)
- Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption (Q5056012) (← links)
- (Q5489062) (← links)
- Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem (Q5750816) (← links)
