P-signatures and Noninteractive Anonymous Credentials

DOI10.1007/978-3-540-78524-8_20zbMath1162.94338OpenAlexW1931152882MaRDI QIDQ5445515

Markulf Kohlweiss, Melissa Chase, Anna Lysyanskaya, Mira Belenkiy

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Structure-preserving signatures and commitments to group elements ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Efficient and secure attribute-based signature for monotone predicates ⋮ Generalizing Efficient Multiparty Computation ⋮ Privacy-preserving blueprints ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Credential transparency system ⋮ NIWI and new notions of extraction for algebraic languages ⋮ SNACKs: leveraging proofs of sequential work for blockchain light clients ⋮ Smooth zero-knowledge hash functions ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Efficient traceable signatures in the standard model ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Decentralized Attribute-Based Signatures ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Escrow free attribute-based signature with self-revealability ⋮ Non-interactive Confirmer Signatures ⋮ Formal Treatment of Privacy-Enhancing Credential Systems ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ Towards Lightweight Anonymous Entity Authentication for IoT Applications ⋮ Non-interactive anonymous router ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages