Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
From MaRDI portal
Publication:2423846
DOI10.1007/s00145-018-9281-4zbMath1434.94066OpenAlexW2789397092MaRDI QIDQ2423846
Daniel Slamanig, Christian Hanser, Georg Fuchsbauer
Publication date: 20 June 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9281-4
public-key cryptographypairing-based cryptographystructure-preserving signaturesattribute-based anonymous credentialsset commitments
Related Items (19)
EPID with malicious revocation ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Non-interactive blind signatures for random messages ⋮ Structure-preserving linearly homomorphic signature with designated combiner for subspace ⋮ Traceable constant-size multi-authority credentials ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Traceable constant-size multi-authority credentials ⋮ Credential transparency system ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Proofs for inner pairing products and applications ⋮ Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Efficient redactable signature and application to anonymous credentials ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Unlinkable and invisible \(\gamma \)-sanitizable signatures ⋮ An efficient certificate-based signature scheme in the standard model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact structure-preserving signatures with almost tight security
- Weakly secure equivalence-class signatures from standard assumptions
- Signer-anonymous designated-verifier redactable signatures for cloud-based data sharing
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
- Short Randomizable Signatures
- Short Structure-Preserving Signatures
- Formal Treatment of Privacy-Enhancing Credential Systems
- Efficient Fully Structure-Preserving Signatures for Large Messages
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Structure-Preserving Signatures from Type II Pairings
- Computing on Authenticated Data
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Malleable Proof Systems and Applications
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Bivariate Polynomials Modulo Composites and Their Applications
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Fully Structure-Preserving Signatures and Shrinking Commitments
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Commuting Signatures and Verifiable Encryption
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Signatures on Randomizable Ciphertexts
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
- Access Control Encryption: Enforcing Information Flow with Cryptography
- Randomizable Proofs and Delegatable Anonymous Credentials
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Practical Round-Optimal Blind Signatures in the Standard Model
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials
- Constant-Size Dynamic k-TAA
- Structure-Preserving Signatures and Commitments to Group Elements
- The Uber-Assumption Family
- An Efficient Anonymous Credential System
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Signing a Linear Subspace: Signature Schemes for Network Coding
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A practical and provably secure scheme for publicly verifiable secret sharing and its applications
- Foundations of Cryptography
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Vector Commitments and Their Applications
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
- Verifiably Encrypted Signatures: Security Revisited and a New Construction
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Pairing-Friendly Elliptic Curves of Prime Order
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Topics in Cryptology – CT-RSA 2005
- Access Control Encryption for Equality, Comparison, and More
- Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- An Efficient Self-blindable Attribute-Based Credential Scheme
This page was built for publication: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
