Pages that link to "Item:Q3739050"
From MaRDI portal
The following pages link to An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information (Q3739050):
Displaying 19 items.
- Secret sets and applications (Q293178) (← links)
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- An efficient probabilistic encryption scheme (Q912074) (← links)
- Partitioned encryption and achieving simultaneity by partitioning (Q1099131) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- All-but-many encryption (Q1747665) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Wildcarded identity-based encryption (Q2429713) (← links)
- Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences (Q2490987) (← links)
- Design of strong cryptographic schemes based on Latin Squares (Q3005866) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
- Practical Chosen Ciphertext Secure Encryption from Factoring (Q3627442) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Security of Auditing Protocols Against Subversion Attacks (Q5859735) (← links)
