Efficient Structure-Preserving Signature Scheme from Standard Assumptions

DOI10.1007/978-3-642-32928-9_5zbMath1310.94176OpenAlexW1959766941MaRDI QIDQ2912787

Kristiyan Haralambiev, Maria Dubovitskaya, Jan Camenisch

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-32928-9_5

zbMATH Keywords

digital signaturesstructure-preservingdecisional linear assumption

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Practical Round-Optimal Blind Signatures in the Standard Model ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Adaptive Oblivious Transfer and Generalization ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Compact structure-preserving signatures with almost tight security ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

This page was built for publication: Efficient Structure-Preserving Signature Scheme from Standard Assumptions