Combining Encryption and Proof of Knowledge in the Random Oracle Model

DOI10.1093/comjnl/47.1.58zbMath1090.68030OpenAlexW2007711167MaRDI QIDQ4828447

Masayuki Abe

Publication date: 19 November 2004

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/47.1.58

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (4)

Generic Constructions of Stateful Public Key Encryption and Their Applications ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security ⋮ IND-CCA secure encryption based on a Zheng-Seberry scheme

This page was built for publication: Combining Encryption and Proof of Knowledge in the Random Oracle Model