Combining Encryption and Proof of Knowledge in the Random Oracle Model

DOI10.1093/COMJNL/47.1.58MaRDI QIDQ4828447zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2079934
• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1942416
• Random oracle model and analysis of primitives of a cryptographic scheme
• Zero knowledge in the random oracle model, revisited
• Adaptive proofs of knowledge in the random oracle model
• scientific article; zbMATH DE number 1107669
• On obfuscation with random oracles
• Security models and proof strategies for plaintext-aware encryption

Cited in

(10)

• scientific article; zbMATH DE number 2079934 (Why is no real title available?)
• 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?
• NM-CPA secure encryption with proofs of plaintext knowledge
• IND-CCA secure encryption based on a Zheng-Seberry scheme
• Formal Indistinguishability Extended to the Random Oracle Model
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Secure integration of asymmetric and symmetric encryption schemes
• Adaptive proofs of knowledge in the random oracle model
• Secure integration of asymmetric and symmetric encryption schemes

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

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