Improved Structure Preserving Signatures Under Standard Bilinear Assumptions

DOI10.1007/978-3-662-54388-7_7zbMath1400.94155OpenAlexW2585373495MaRDI QIDQ5738756

Arnab Roy, Charanjit S. Jutla

Publication date: 13 June 2017

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-54388-7_7

zbMATH Keywords

bilinear pairingsQA-NIZKSXDHCramer-ShoupGroth-Sahaistructure preserving signaturesmatrix-DDH

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

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 ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Compact structure-preserving signatures with almost tight security ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

Cites Work

• Unnamed Item
• An Algebraic Framework for Diffie-Hellman Assumptions
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Commuting Signatures and Verifiable Encryption
• Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
• Structure-Preserving Signatures from Standard Assumptions, Revisited
• Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
• Structure-Preserving Signatures and Commitments to Group Elements
• Universally Composable Adaptive Oblivious Transfer
• 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
• A Framework for Universally Composable Non-committing Blind Signatures
• Monte Carlo Methods for Index Computation (mod p)
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures

This page was built for publication: Improved Structure Preserving Signatures Under Standard Bilinear Assumptions