Keywords
Probabilistic logicKey (lock)Computer scienceEncryptionDecoding methodsScheme (mathematics)Encoding (memory)Public-key cryptographyTheoretical computer scienceFunction (biology)Computer securityAlgorithmMathematicsArtificial intelligence
Affiliated Institutions
Related Publications
A Survey on Homomorphic Encryption Schemes
Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns....
Probabilistic encryption & how to play mental poker keeping secret all partial information
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any in...
SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
In the RSA public-key crypto system a message M (<R) is encrypted by calculating K≡me (mod R), where 0<K<R and R, e are integers which are made public. The recipient of K can de...
An ID-based cryptosystem based on the discrete logarithm problem
In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a lar...
Publication Info
- Year
- 2007
- Type
- book-chapter
- Pages
- 289-299
- Citations
- 260
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
260
OpenAlex
Cite This
Manuel Blum,
Shafi Goldwasser
(2007).
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information.
Lecture notes in computer science
, 289-299.
https://doi.org/10.1007/3-540-39568-7_23
Identifiers
- DOI
- 10.1007/3-540-39568-7_23