Tightly Secure Signatures and Public-Key Encryption
From MaRDI portal
Publication:2914286
DOI10.1007/978-3-642-32009-5_35zbMath1296.94152OpenAlexW2404371125MaRDI QIDQ2914286
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_35
Related Items (53)
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 ⋮ Structure-preserving signatures and commitments to group elements ⋮ On the security loss of unique signatures ⋮ Tightly secure signatures and public-key encryption ⋮ Parameter-hiding order revealing encryption ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ Skipping the \(q\) in group signatures ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Optimal tightness for chain-based unique signatures ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ 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 ⋮ 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 ⋮ Tightly CCA-secure encryption scheme in a multi-user setting with corruptions ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Tight security for the generic construction of identity-based signature (in the multi-instance setting) ⋮ On the tightness of forward-secure signature reductions ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Generalized public-key cryptography with tight security ⋮ 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 ⋮ Tightly secure ring signatures in the standard model ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Non-Interactive Zero-Knowledge Proofs of Non-Membership ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Tightly secure hierarchical identity-based encryption ⋮ Signatures from sequential-OR proofs ⋮ More efficient digital signatures with tight multi-user security ⋮ Verifiable random functions with optimal tightness ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Adaptive Partitioning ⋮ Short identity-based signatures with tight security from lattices
This page was built for publication: Tightly Secure Signatures and Public-Key Encryption
