Concise multi-challenge CCA-secure encryption and signatures with almost tight security
From MaRDI portal
(Redirected from Publication:2936596)
Recommendations
Cited in
(29)- Tightly-secure encryption in the multi-user, multi-challenge setting with improved efficiency
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
- Miniature CCA2 PK Encryption: Tight Security Without Redundancy
- Memory-tight multi-challenge security of public-key encryption
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Parallel-CFS
- CCA-Secure and Revocable Certificateless Encryption with Ciphertext Evolution
- Tightly secure signatures and public-key encryption
- Parameter-hiding order revealing encryption
- Rerandomizable signatures under standard assumption
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- Kurosawa-Desmedt meets tight security
- Fine-grained verifier NIZK and its applications
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- Linearly homomorphic structure-preserving signatures and their applications
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Adaptive partitioning
- Tightly secure ring signatures in the standard model
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Optimal tightness for chain-based unique signatures
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- Compact structure-preserving signatures with almost tight security
- Generalized public-key cryptography with tight security
- Tightly CCA-secure encryption without pairings
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
This page was built for publication: Concise multi-challenge CCA-secure encryption and signatures with almost tight security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936596)
