Tightly CCA-Secure Encryption Without Pairings
From MaRDI portal
Publication:2820476
DOI10.1007/978-3-662-49890-3_1zbMath1347.94032OpenAlexW2464211838WikidataQ60220897 ScholiaQ60220897MaRDI QIDQ2820476
Eike Kiltz, Hoeteck Wee, Dennis Hofheinz, Romain Gay
Publication date: 9 September 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_1
Related Items (43)
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 ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ 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 ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Multi-designated receiver signed public key encryption ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ QANIZK for adversary-dependent languages and their applications ⋮ 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 ⋮ 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 ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ 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 ⋮ Unbounded HIBE with tight security ⋮ Tightly CCA-secure encryption scheme in a multi-user setting with corruptions ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Improved inner-product encryption with adaptive security and full attribute-hiding ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ New technique for chosen-ciphertext security based on non-interactive zero-knowledge ⋮ Generalized public-key cryptography with tight security ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Compact structure-preserving signatures with almost tight security ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Tightly secure hierarchical identity-based encryption ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ Tightly-secure authenticated key exchange, revisited ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Adaptive Partitioning
This page was built for publication: Tightly CCA-Secure Encryption Without Pairings
