Efficient Structure-Preserving Signature Scheme from Standard Assumptions

DOI10.1007/978-3-642-32928-9_5MaRDI QIDQ2912787zbMATH OpenOpenAlexFDO

Authors Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev

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)

Recommendations

• More efficient (almost) tightly secure structure-preserving signatures
• Compact structure-preserving signatures with almost tight security
• Compact structure-preserving signatures with almost tight security
• Improved (almost) tightly-secure structure-preserving signatures
• Efficient fully structure-preserving signatures and shrinking commitments
• Structure-preserving signatures from standard assumptions, revisited
• Efficient fully structure-preserving signatures for large messages
• Optimal structure-preserving signatures. (Abstract)
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Constant-size structure-preserving signatures: generic constructions and simple assumptions

Cited in

(21)

• Tagged one-time signatures: tight security and optimal tag size
• A signature scheme with efficient proof of validity
• Short group signatures via structure-preserving signatures: standard model security from simple assumptions
• Linearly homomorphic structure-preserving signatures and their applications
• On the impossibility of structure-preserving deterministic primitives
• Practical Round-Optimal Blind Signatures in the Standard Model
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Compact structure-preserving signatures with almost tight security
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Round-optimal privacy-preserving protocols with smooth projective hash functions
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• A new hash-and-sign approach and structure-preserving signatures from DLIN
• Compact structure-preserving signatures with almost tight security
• On structure-preserving cryptography and lattices
• Efficient fully structure-preserving signatures and shrinking commitments
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Partially structure-preserving signatures: lower bounds, constructions and more
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• Adaptive oblivious transfer and generalization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912787)