Keywords
CiphertextPlaintextCryptosystemComputer scienceCiphertext indistinguishabilityPlaintext-aware encryptionEncryptionDeterministic encryptionZero-knowledge proofTheoretical computer scienceSemantic securityMathematical proofCryptographyRandomnessPublic-key cryptographyHybrid cryptosystemDiscrete mathematicsMalleabilityMathematicsAlgorithmComputer securityAttribute-based encryption
Affiliated Institutions
Related Publications
Nonmalleable Cryptography
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is tha...
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...
Publication Info
- Year
- 2005
- Type
- book-chapter
- Pages
- 529-555
- Citations
- 19
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
19
OpenAlex
Cite This
Shafi Goldwasser,
Dmitriy Kharchenko
(2005).
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem.
Lecture notes in computer science
, 529-555.
https://doi.org/10.1007/978-3-540-30576-7_29
Identifiers
- DOI
- 10.1007/978-3-540-30576-7_29