Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions

DOI10.1007/978-3-662-48000-7_15zbMath1352.94048OpenAlexW1476678265MaRDI QIDQ3457071

No author found.

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01225353/file/short-gsis-full-version.pdf

zbMATH Keywords

efficiencystandard modelgroup signaturesstructure-preserving cryptographysimple assumptionsQA-NIZK arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (21)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Skipping the \(q\) in group signatures ⋮ Memory lower bounds of reductions revisited ⋮ 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 ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Rerandomizable signatures under standard assumption ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Compact structure-preserving signatures with almost tight security ⋮ Improved Structure Preserving Signatures Under Standard Bilinear Assumptions ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security ⋮ 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 ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

Cites Work

• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Dynamic Fully Anonymous Short Group Signatures
• Efficient Structure-Preserving Signature Scheme from Standard Assumptions
• A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
• Tightly Secure Signatures and Public-Key Encryption
• Identity-Based Cryptosystems and Signature Schemes
• The random oracle methodology, revisited
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
• Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
• Structure-Preserving Signatures and Commitments to Group Elements
• Perfect Non-interactive Zero Knowledge for NP
• Compact Group Signatures Without Random Oracles
• Universally Composable Adaptive Oblivious Transfer
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Group Encryption: Non-interactive Realization in the Standard Model
• Group Signatures
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
• Dual Form Signatures: An Approach for Proving Security from Static Assumptions
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Efficient Identity-Based Encryption Without Random Oracles
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Fully Anonymous Group Signatures Without Random Oracles
• Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
• P-signatures and Noninteractive Anonymous Credentials
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures

This page was built for publication: Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions