Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks

DOI10.1007/3-540-36288-6_6zbMath1033.94547OpenAlexW2135150725MaRDI QIDQ4414699

Yodai Watanabe, Junji Shikata, Hiroshi Imai

Publication date: 27 July 2003

Published in: Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36288-6_6

zbMATH Keywords

public key cryptosystemsindistinguishabilitysemantic securityciphertext attacksnondividability

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic ⋮ Provably secure Rabin-p cryptosystem in hybrid setting ⋮ A Public-Key Encryption Scheme with Pseudo-random Ciphertexts

This page was built for publication: Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks