International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Roger Fischlin

Affiliation: Goethe-University Frankfurt

Publications

Year
Venue
Title
2011
JOFC
2009
JOFC
2000
CRYPTO
2000
JOFC
1999
EPRINT
Fast Proof of Plaintext-Knowledge and Deniable Authentication Based on Chinese Remainder Theorem
Roger Fischlin
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.
1997
EUROCRYPT