Efficient fully structure-preserving signatures and shrinking commitments

DOI10.1007/s00145-018-9300-5zbMath1466.94018OpenAlexW2885889522MaRDI QIDQ2318093

Mehdi Tibouchi, Markulf Kohlweiss, Masayuki Abe, Jens Groth, Miyako Ohkubo

Publication date: 13 August 2019

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9300-5

zbMATH Keywords

structure-preserving signaturesrandomizabilitysecret key extractionstructure-preserving commitments

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Aggregatable distributed key generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure-preserving signatures and commitments to group elements
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• On computable isomorphisms in efficient asymmetric pairing-based systems
• Pairings for cryptographers
• Ring signatures: Stronger definitions, and constructions without random oracles
• A framework for universally composable non-committing blind signatures
• Complexity of a determinate algorithm for the discrete logarithm
• On-line/off-line digital signatures
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
• Efficient Fully Structure-Preserving Signatures for Large Messages
• Type 2 Structure-Preserving Signature Schemes Revisited
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Structure-Preserving Signatures from Type II Pairings
• Group to Group Commitments Do Not Shrink
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• Fully Structure-Preserving Signatures and Shrinking Commitments
• How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones
• Commuting Signatures and Verifiable Encryption
• Generic Compilers for Authenticated Key Exchange
• Structure Preserving CCA Secure Encryption and Applications
• A Framework for Practical Universally Composable Zero-Knowledge Protocols
• Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
• Randomizable Proofs and Delegatable Anonymous Credentials
• Non-interactive and reusable non-malleable commitment schemes
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology – CRYPTO 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Fully Anonymous Group Signatures Without Random Oracles
• Fine-Tuning Groth-Sahai Proofs
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Topics in Cryptology – CT-RSA 2005
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• On the Impossibility of Structure-Preserving Deterministic Primitives
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
• Cryptography and Coding

This page was built for publication: Efficient fully structure-preserving signatures and shrinking commitments