Public-key encryption indistinguishable under plaintext-checkable attacks

DOI10.1007/978-3-662-46447-2_15MaRDI QIDQ2941199zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michel Abdalla, Fabrice Benhamouda, David Pointcheval

Publication date 27 August 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46447-2_15

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
• Plaintext-checkable encryption with unlink-CCA security in the standard model
• IND-PCA secure KEM is enough for password-based authenticated key exchange (short paper)
• Password-authenticated public-key encryption
• Public‐Key Encryption and Security Notions

Cited in

(11)

• Multi-instance secure public-key encryption
• Improving practical UC-secure commitments based on the DDH assumption
• Plaintext checkable encryption with designated checker
• Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
• Provably secure password authenticated key exchange based on RLWE for the post-quantum world
• Provably-secure remote memory attestation for heap overflow protection
• Plaintext-checkable encryption with unlink-CCA security in the standard model
• Plaintext-verifiably-checkable encryption
• Verifier-based anonymous password-authenticated key exchange protocol in the standard model
• Hardware security without secure hardware: how to decrypt with a password and a server
• Public‐Key Encryption and Security Notions

This page was built for publication: Public-key encryption indistinguishable under plaintext-checkable attacks

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