How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones

DOI10.1007/978-3-662-53890-6_16zbMATH Open1407.94159OpenAlexW2555289741MaRDI QIDQ2953786FDOQ2953786

Authors: Yuyu Wang, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka, Zongyang 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

Recommendations

• Improved (almost) tightly-secure structure-preserving signatures
• Structure-preserving signatures from standard assumptions, revisited
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Partially structure-preserving signatures: lower bounds, constructions and more
• Efficient fully structure-preserving signatures for large messages

zbMATH Keywords

signatureautomorphicfully structure-preservingtrapdoor signature

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• 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
• Commuting signatures and verifiable encryption
• Fair blind signatures without random oracles
• Structure-preserving signatures and commitments to group elements
• Title not available (Why is that?)
• 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
• On-line/off-line digital signatures
• Efficient noninteractive proof systems for bilinear groups
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
• Title not available (Why is that?)
• Randomizable Proofs and Delegatable Anonymous Credentials
• Ring signatures: Stronger definitions, and constructions without random oracles
• An algebraic framework for Diffie-Hellman assumptions
• Structure-preserving signatures from standard assumptions, revisited
• Short group signatures via structure-preserving signatures: standard model security from simple assumptions
• Short structure-preserving signatures
• Fully structure-preserving signatures and shrinking commitments
• Practical Round-Optimal Blind Signatures in the Standard Model
• Efficient fully structure-preserving signatures for large messages
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Anonymous transferable e-cash
• Universally Composable Adaptive Priced Oblivious Transfer
• A framework for practical universally composable zero-knowledge protocols

Cited In (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

This page was built for publication: How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones

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