Randomizable Proofs and Delegatable Anonymous Credentials
From MaRDI portal
Publication:3183560
DOI10.1007/978-3-642-03356-8_7zbMath1252.94047MaRDI QIDQ3183560
Anna Lysyanskaya, Melissa Chase, Markulf Kohlweiss, Mira Belenkiy, Jan Camenisch, Hovav Shacham
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_7
Related Items
Decentralized Attribute-Based Signatures, Tagged One-Time Signatures: Tight Security and Optimal Tag Size, Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes, Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract), Hierarchical Attribute-Based Signatures, Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials, Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares, Constant-size structure-preserving signatures: generic constructions and simple assumptions, Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES, Efficient traceable signatures in the standard model, Transferable e-cash: a cleaner model and the first practical instantiation, Lattice-based blind signatures, revisited, Two-sided malicious security for private intersection-sum with cardinality, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model, Another look at extraction and randomization of Groth's zk-SNARK, Issuer-hiding attribute-based credentials, Gemini: elastic SNARKs for diverse environments, Fully homomorphic NIZK and NIWI proofs, Efficient fully structure-preserving signatures and shrinking commitments, Short tightly secure signatures for signing a vector of group elements: a new approach, Efficient and secure attribute-based signature for monotone predicates, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Recovering Lost Device-Bound Credentials, Hierarchical Identities from Group Signatures and Pseudonymous Signatures, Formal Treatment of Privacy-Enhancing Credential Systems, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones, Achieving Optimal Anonymity in Transferable E-Cash with a Judge, Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes, Compact E-Cash and Simulatable VRFs Revisited, Efficient Traceable Signatures in the Standard Model, Structure-Preserving Signatures from Standard Assumptions, Revisited, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials
