Tightly CCA-secure encryption without pairings
From MaRDI portal
Recommendations
- Tightly Secure Signatures and Public-Key Encryption
- Tightly secure signatures and public-key encryption
- Concise multi-challenge CCA-secure encryption and signatures with almost tight security
- Kurosawa-Desmedt meets tight security
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
Cited in
(56)- Quantum algorithms for the \(k\)-XOR problem
- Unbounded ABE via bilinear entropy expansion, revisited
- Kurosawa-Desmedt meets tight security
- Improved inner-product encryption with adaptive security and full attribute-hiding
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Tightly CCA-secure inner product functional encryption scheme
- Tightly-secure authenticated key exchange, revisited
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Authenticated key exchange and signatures with tight security in the standard model
- Tightness subtleties for multi-user PKE notions
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- CCA-secure ABE using tag and pair encoding
- Multi-designated receiver signed public key encryption
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- Generalized public-key cryptography with tight security
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Improved, black-box, non-malleable encryption from semantic security
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- QANIZK for adversary-dependent languages and their applications
- Unbounded HIBE with tight security
- Towards tight adaptive security of non-interactive key exchange
- Concise multi-challenge CCA-secure encryption and signatures with almost tight security
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Iterated random oracle: a universal approach for finding loss in security reduction
- The kernel matrix Diffie-Hellman assumption
- Towards tightly secure deterministic public key encryption
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- Master-key KDM-secure IBE from pairings
- Hierarchical identity-based encryption with tight multi-challenge security
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Adaptive partitioning
- Multi-input inner-product functional encryption from pairings
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Tightly secure hierarchical identity-based encryption
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
- Fine-grained verifier NIZK and its applications
- Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
- Compact structure-preserving signatures with almost tight security
- Memory-tight multi-challenge security of public-key encryption
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- More efficient public-key cryptography with leakage and tamper resilience
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- Toothpicks: more efficient fork-free two-round multi-signatures
- Key exchange with tight (full) forward secrecy via key confirmation
- Tightly secure inner-product functional encryption revisited: compact, lattice-based, and more
- Practical blind signatures in pairing-free groups
- Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Tightly, adaptively secure proxy re-encryption in multi-challenge setting
- IBE with tight security against selective opening and chosen-ciphertext attacks
This page was built for publication: Tightly CCA-secure encryption without pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820476)
