Structure-Preserving Signatures from Standard Assumptions, Revisited
From MaRDI portal
Publication:3457070
DOI10.1007/978-3-662-48000-7_14zbMath1352.94043OpenAlexW2186696792WikidataQ59163658 ScholiaQ59163658MaRDI QIDQ3457070
Hoeteck Wee, Jia-xin Pan, Eike Kiltz
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_14
Related Items (24)
QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ 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 ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Structure-Preserving Smooth Projective Hashing ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Multimodal private signatures ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Attribute-based signatures for range of inner product and its applications ⋮ Policy-compliant signatures ⋮ Compact structure-preserving signatures with almost tight security ⋮ Access Control Encryption for Equality, Comparison, and More ⋮ Improved Structure Preserving Signatures Under Standard Bilinear Assumptions ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Tightly secure hierarchical identity-based encryption ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Partially structure-preserving signatures: lower bounds, constructions and more
Cites Work
- On-line/off-line digital signatures
- An Algebraic Framework for Diffie-Hellman Assumptions
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Malleable Proof Systems and Applications
- Group Signatures with Almost-for-Free Revocation
- Tightly Secure Signatures and Public-Key Encryption
- Commuting Signatures and Verifiable Encryption
- Achieving Optimal Anonymity in Transferable E-Cash with a Judge
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Randomizable Proofs and Delegatable Anonymous Credentials
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Fair Blind Signatures without Random Oracles
- Structure-Preserving Signatures and Commitments to Group Elements
- Universally Composable Adaptive Oblivious Transfer
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Group Encryption: Non-interactive Realization in the Standard Model
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Shorter IBE and Signatures via Asymmetric Pairings
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Fully Anonymous Group Signatures Without Random Oracles
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Dual System Encryption via Predicate Encodings
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
This page was built for publication: Structure-Preserving Signatures from Standard Assumptions, Revisited