Abstract
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 information about the clear-text.
Keywords
EncryptionComputer scienceProbabilistic encryptionProperty (philosophy)Multiple encryptionProbabilistic logicTheoretical computer science40-bit encryptionFilesystem-level encryptionAdversaryComputer security56-bit encryptionAttribute-based encryptionScheme (mathematics)On-the-fly encryptionArtificial intelligenceMathematicsPublic-key cryptography
Affiliated Institutions
Related Publications
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
A secure and optimally efficient multi‐authority election scheme
Abstract In this paper we present a new multi‐authority secret‐ballot election scheme that guarantees privacy, universal veriability, and robustness. It is the first scheme for ...
A New Approach for Algebraically Homomorphic Encryption.
The existence of an efficient and provably secure algebraically homomorphic scheme (AHS), i.e., one that supports both addition and multiplication operations, is a long stated o...
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...
Publication Info
- Year
- 1982
- Type
- article
- Pages
- 365-377
- Citations
- 844
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
844
OpenAlex
Cite This
Shafi Goldwasser,
Silvio Micali
(1982).
Probabilistic encryption & how to play mental poker keeping secret all partial information.
, 365-377.
https://doi.org/10.1145/800070.802212
Identifiers
- DOI
- 10.1145/800070.802212