Separating Short Structure-Preserving Signatures from Non-interactive Assumptions

DOI10.1007/978-3-642-25385-0_34MaRDI QIDQ3102213zbMATH OpenOpenAlexFDO

Authors Masayuki Abe, Jens Groth, Miyako Ohkubo

Publication date 2 December 2011

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-25385-0_34

zbMATH Keywords

Algebraic ReductionMeta-ReductionStructure-Preserving Signatures

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Short structure-preserving signatures
• Efficient Structure-Preserving Signature Scheme from Standard Assumptions
• Structure-preserving signatures from standard assumptions, revisited
• Fully structure-preserving signatures and shrinking commitments
• Short group signatures via structure-preserving signatures: standard model security from simple assumptions
• Short Undeniable Signatures Without Random Oracles: The Missing Link
• Compact structure-preserving signatures with almost tight security
• Compact structure-preserving signatures with almost tight security
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Short signatures from weaker assumptions

Cited in

(25)

• On the security loss of unique signatures
• Optimal security proofs for full domain hash. Revisited
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Verifiable random functions with optimal tightness
• Partially structure-preserving signatures: lower bounds, constructions and more
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Optimal tightness for chain-based unique signatures
• Efficient fully structure-preserving signatures and shrinking commitments
• On the adaptive security of MACs and PRFs
• Towards non-black-box separations of public key encryption and one way function
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Practical Round-Optimal Blind Signatures in the Standard Model
• Structure-preserving signatures from standard assumptions, revisited
• Short group signatures via structure-preserving signatures: standard model security from simple assumptions
• Improved structure preserving signatures under standard bilinear assumptions
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• Lattice-based signatures with tight adaptive corruptions and more
• A tightly secure ID-based signature scheme under DL assumption in AGM
• Threshold structure-preserving signatures
• On proving equivalence class signatures secure from non-interactive assumptions
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• On security proofs of existing equivalence class signature schemes
• On the limits of non-interactive blind signatures
• Linearly homomorphic structure-preserving signatures and their applications

This page was built for publication: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions

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