Proof of plaintext knowledge for the ajtai-dwork cryptosystem

DOI10.1007/978-3-540-30576-7_29MaRDI QIDQ5711662zbMATH OpenOpenAlexFDO

Authors D. O. Kharchenko, Shafi Goldwasser

Publication date 7 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106171

zbMATH Keywords

Ajtai-Dwork CryptosystemLatticesProof of Plaintext KnowledgeVerifiable EncryptionWorst Case Complexity Assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptanalysis of the Ajtai-Dwork cryptosystem
• Eliminating decryption errors in the Ajtai-Dwork cryptosystem
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• A lattice-based public-key cryptosystem
• A lattice-based public-key cryptosystem

Cited in

(5)

• Generic plaintext equality and inequality proofs
• Toward non-interactive zero-knowledge proofs for NP from LWE
• Zero-knowledge protocols for the McEliece encryption
• Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
• Zero-knowledge arguments for subverted RSA groups

This page was built for publication: Proof of plaintext knowledge for the ajtai-dwork cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711662)