Characterization of security notions for probabilistic private-key encryption
From MaRDI portal
Publication:2499267
Recommendations
Cited in
(30)- Authenticated encryption: relations among notions and analysis of the generic composition paradigm
- Handling adaptive compromise for practical encryption schemes
- On fingerprinting attacks and length-hiding encryption
- Composable and finite computational security of quantum message transmission
- Algebraic generalization of Diffie-Hellman key exchange
- Sharing many secrets with computational provable security
- Relationships between quantum IND-CPA notions
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- Complete characterization of security notions for probabilistic private-key encryption
- How to Encrypt with the LPN Problem
- How to Encrypt with a Malicious Random Number Generator
- The Notion of Security for Probabilistic Cryptosystems
- scientific article; zbMATH DE number 169375 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- Provably-secure time-bound hierarchical key assignment schemes
- Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
- scientific article; zbMATH DE number 1759277 (Why is no real title available?)
- scientific article; zbMATH DE number 1759477 (Why is no real title available?)
- New security notions and relations for public-key encryption
- Information Security and Privacy
- On the Impossibility of Strong Encryption Over $\aleph_0$
- Selected Areas in Cryptography
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Security notions for disk encryption
- Sender-binding key encapsulation
- Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions
- Hybrid encryption in correlated randomness model and KEM combiners
- Some (in)sufficient conditions for secure hybrid encryption
- Efficient provably-secure hierarchical key assignment schemes
- New constructions for provably-secure time-bound hierarchical key assignment schemes
This page was built for publication: Characterization of security notions for probabilistic private-key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499267)
