Composable and modular anonymous credentials: definitions and practical constructions

DOI10.1007/978-3-662-48800-3_11MaRDI QIDQ2795974zbMATH OpenOpenAlexFDO

Authors Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev, Markulf Kohlweiss

Publication date 23 March 2016

Published in Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://link.springer.com/chapter/10.1007%2F978-3-662-48800-3_11

zbMATH Keywords

anonymous credentialsgroth-sahai proofsstructure preserving signaturesuniversal composabilityvector commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1722673
• Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
• Randomizable Proofs and Delegatable Anonymous Credentials
• Anonymous credential schemes with encrypted attributes
• Universally composable accumulators

Cited in

(34)

• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Efficient redactable signature and application to anonymous credentials
• Improving revocation for group signature with redactable signature
• Updatable signatures and message authentication codes
• Partially structure-preserving signatures: lower bounds, constructions and more
• Issuer-hiding attribute-based credentials
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Efficient fully structure-preserving signatures and shrinking commitments
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
• Formal treatment of privacy-enhancing credential systems
• Universal composition with responsive environments
• Breaking and fixing anonymous credentials for the cloud
• A new approach to efficient revocable attribute-based anonymous credentials
• Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
• Information Security and Privacy
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Private polynomial commitments and applications to MPC
• PAPR: publicly auditable privacy revocation for anonymous credentials
• Enhanced Security of Attribute-Based Signatures
• Traceable constant-size multi-authority credentials
• Obtaining simulation extractable NIZKs in the updatable CRS model generically
• Compact structure-preserving signatures with almost tight security
• Traceable constant-size multi-authority credentials
• Proofs for inner pairing products and applications
• Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric
• PointProofs, revisited
• On black-box knowledge-sound commit-and-prove SNARKs
• Threshold structure-preserving signatures
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• Vector commitments with proofs of smallness: short range proofs and more
• Extended policy-based sanitizable signatures
• Non-interactive threshold BBS+ from pseudorandom correlations
• Non-malleable subvector commitments

This page was built for publication: Composable and modular anonymous credentials: definitions and practical constructions

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