An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information

DOI10.1007/3-540-39568-7_23zbMath0602.94010OpenAlexW1569930334MaRDI QIDQ3739050

Manuel Blum, Shafi Goldwasser

Publication date: 1985

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39568-7_23

zbMATH Keywords

securityinteger factorizationprobabilistic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Secret sets and applications, Linear complexity of the \(x^{2} \bmod p\) orbits, Certifying trapdoor permutations, revisited, Partitioned encryption and achieving simultaneity by partitioning, Enhancements of trapdoor permutations, Efficient cryptosystems from \(2^k\)-th power residue symbols, Wildcarded identity-based encryption, Practical chosen ciphertext secure encryption from factoring, An efficient probabilistic encryption scheme, Cryptography and cryptographic protocols, Design of strong cryptographic schemes based on Latin Squares, All-but-many encryption, A uniform-complexity treatment of encryption and zero-knowledge, Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences, Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles, Practical Chosen Ciphertext Secure Encryption from Factoring, On the limits of nonapproximability of lattice problems, Security of Auditing Protocols Against Subversion Attacks, The discrete logarithm modulo a composite hides \(O(n)\) bits