Structure-preserving signatures and commitments to group elements

DOI10.1007/s00145-014-9196-7zbMath1355.94042OpenAlexW2013689473MaRDI QIDQ290392

Masayuki Abe, Miyako Ohkubo, Jens Groth, Kristiyan Haralambiev, Georg Fuchsbauer

Publication date: 1 June 2016

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

Full work available at URL: https://doi.org/10.1007/s00145-014-9196-7

zbMATH Keywords

automorphic signaturesblind signaturesGroth-Sahai proofsgroup signatureshomomorphic commitmentsstructure-preserving cryptographystructure-preserving signatures

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ A blind coupon mechanism enabling veto voting over unreliable networks ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Private polynomial commitments and applications to MPC ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs ⋮ Proofs for inner pairing products and applications ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Foundations of fully dynamic group signatures ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Compact structure-preserving signatures with almost tight security ⋮ Access Control Encryption for Equality, Comparison, and More ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• A framework for universally composable non-committing blind signatures
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Efficient Signatures of Knowledge and DAA in the Standard Model
• Malleable Proof Systems and Applications
• Group to Group Commitments Do Not Shrink
• Scalable Group Signatures with Revocation
• 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
• Achieving Optimal Anonymity in Transferable E-Cash with a Judge
• One-Time Signatures and Chameleon Hash Functions
• Structure Preserving CCA Secure Encryption and Applications
• Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
• Anonymous Proxy Signatures
• Concurrent Blind Signatures Without Random Oracles
• About the Security of MTI/C0 and MQV
• Fair Blind Signatures without Random Oracles
• Structure-Preserving Signatures and Commitments to Group Elements
• Compact Group Signatures Without Random Oracles
• Perfect NIZK with Adaptive Soundness
• Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
• Universally Composable Adaptive Oblivious Transfer
• Digital Signatures
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Security of Blind Signatures under Aborts
• Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
• Group Encryption: Non-interactive Realization in the Standard Model
• Real Traceable Signatures
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Group Signatures
• 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
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
• Survey: Leakage Resilience and the Bounded Retrieval Model
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Group Signatures with Efficient Concurrent Join
• Fully Anonymous Group Signatures Without Random Oracles
• Advances in Cryptology - CRYPTO 2003
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
• Equivocal Blind Signatures and Adaptive UC-Security
• P-signatures and Noninteractive Anonymous Credentials
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Security in Communication Networks
• Topics in Cryptology – CT-RSA 2005
• Theory of Cryptography
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Structure-preserving signatures and commitments to group elements