Efficient fully structure-preserving signatures for large messages
From MaRDI portal
Publication:2811133
DOI10.1007/978-3-662-48797-6_11zbMATH Open1396.94079OpenAlexW2293540181MaRDI QIDQ2811133FDOQ2811133
Authors: Jens Groth 
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_11
Recommendations
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Short structure-preserving signatures
- Structure-preserving signatures from type II pairings
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
Cited In (14)
- A generic construction of an anonymous reputation system and instantiations from lattices
- Threshold structure-preserving signatures
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Bringing order to chaos: the case of collision-resistant chameleon-hashes
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Partially structure-preserving signatures: lower bounds, constructions and more
- Issuer-hiding attribute-based credentials
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Lower bounds on structure-preserving signatures for bilateral messages
- Traceable receipt-free encryption
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- Efficient fully structure-preserving signatures and shrinking commitments
This page was built for publication: Efficient fully structure-preserving signatures for large messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811133)
