A unifying umbrella for circular-secure cryptographic primitives
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Black-box non-interactive non-malleable commitments
- CCA security and trapdoor functions via key-dependent-message security
- Chosen ciphertext security from injective trapdoor functions
- Chosen-Ciphertext Security via Correlated Products
- Circular security is complete for KDM security
- Cryptographic group actions and applications
- Cryptographic primitives with hinting property
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Encryption-scheme security in the presence of key-dependent messages
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Hedged public-key encryption: how to protect against bad randomness
- How to build a trapdoor function from an encryption scheme
- More on average case vs approximation complexity
- On non-uniform security for black-box non-interactive CCA commitments
- Public-key anamorphism in (CCA-secure) public-key encryption and beyond
- Randomness recoverable secret sharing schemes
- Randomness-dependent message security
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Reproducible circularly-secure bit encryption: applications and realizations
- Simple chosen-ciphertext security from low-noise LPN
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
This page was built for publication: A unifying umbrella for circular-secure cryptographic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443203)