International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Fast Proof of Plaintext-Knowledge and Deniable Authentication Based on Chinese Remainder Theorem

Authors:
Roger Fischlin
Download:
URL: http://eprint.iacr.org/1999/006
Search ePrint
Search Google
Abstract: We propose a fast and communication-efficient proof of plaintext-knowledge (PPTK) protocol based on the Chinese Remainder theorem. With a PPTK the receiver of a ciphertext verifies that the sender knows the corresponding cleartext in such a way that a dishonest sender or an eavesdropper does not learn anything about the plaintext except with sub-polynomial probability. We turn any semantically secure public key cryptosystem into an efficient (interactive) one which is immune against adaptive chosen ciphertext attacks by adding the PPTK protocol. Using our PPTK protocol we also derive an efficient protocol for deniable authentication.
BibTeX
@misc{eprint-1999-11328,
  title={Fast Proof of Plaintext-Knowledge and Deniable Authentication Based on Chinese Remainder Theorem},
  booktitle={IACR Eprint archive},
  keywords={Chinese Remainder Theorem, Chosen Ciphertext Attacks, Deniable Authentication, Non-Malleable Cryptography, Proof of Plaintext-Knowledge, Public Key Cryptosystem},
  url={http://eprint.iacr.org/1999/006},
  note={Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. fischlin@haendel.mi.informatik.uni-frankfurt.de 10500 received March 5, 1999, withdrawn April 19, 1999.},
  author={Roger Fischlin},
  year=1999
}