How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones

DOI10.1007/978-3-662-53890-6_16zbMath1407.94159OpenAlexW2555289741MaRDI QIDQ2953786

Yu Yu Wang, Keisuke Tanaka, Goichiro Hanaoka, Takahiro Matsuda, Zong-yang Zhang

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_16

zbMATH Keywords

signatureautomorphicfully structure-preservingtrapdoor signature

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Aggregatable distributed key generation ⋮ Efficient fully structure-preserving signatures and shrinking commitments

Cites Work

• Unnamed Item
• Unnamed Item
• Ring signatures: Stronger definitions, and constructions without random oracles
• On-line/off-line digital signatures
• Short Structure-Preserving Signatures
• Efficient Fully Structure-Preserving Signatures for Large Messages
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• An Algebraic Framework for Diffie-Hellman Assumptions
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Malleable Proof Systems and Applications
• Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption
• Group Signatures with Almost-for-Free Revocation
• Tightly Secure Signatures and Public-Key Encryption
• Anonymous Transferable E-Cash
• Fully Structure-Preserving Signatures and Shrinking Commitments
• Commuting Signatures and Verifiable Encryption
• A Framework for Practical Universally Composable Zero-Knowledge Protocols
• Randomizable Proofs and Delegatable Anonymous Credentials
• Universally Composable Adaptive Priced Oblivious Transfer
• 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
• Fair Blind Signatures without Random Oracles
• Structure-Preserving Signatures and Commitments to Group Elements
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
• Computing on Authenticated Data: New Privacy Definitions and Constructions
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• P-signatures and Noninteractive Anonymous Credentials
• Topics in Cryptology – CT-RSA 2005
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles

This page was built for publication: How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones