Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
From MaRDI portal
Recommendations
Cited in
(17)- Round-efficient black-box construction of composable multi-party computation
- A black-box construction of non-malleable encryption from semantically secure encryption
- ZK-PCPs from leakage-resilient secret sharing
- Strong continuous non-malleable encoding schemes with tamper-detection
- Non-malleable encryption: simpler, shorter, stronger
- Improved, black-box, non-malleable encryption from semantic security
- Non-malleable encryption: simpler, shorter, stronger
- Non-black-box simulation from one-way functions and applications to resettable security
- Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
- Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Lifting standard model reductions to common setup assumptions
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Some (in)sufficient conditions for secure hybrid encryption
This page was built for publication: Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445519)