Randomizable Proofs and Delegatable Anonymous Credentials
From MaRDI portal
Publication:3183560
DOI10.1007/978-3-642-03356-8_7zbMath1252.94047OpenAlexW2150399720MaRDI 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 (37)
Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Another look at extraction and randomization of Groth's zk-SNARK ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ Issuer-hiding attribute-based credentials ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Efficient and secure attribute-based signature for monotone predicates ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Hierarchical Attribute-Based Signatures ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Efficient traceable signatures in the standard model ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Achieving Optimal Anonymity in Transferable E-Cash with a Judge ⋮ 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 ⋮ Recovering Lost Device-Bound Credentials ⋮ Hierarchical Identities from Group Signatures and Pseudonymous Signatures ⋮ Formal Treatment of Privacy-Enhancing Credential Systems ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Transferable e-cash: a cleaner model and the first practical instantiation ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ 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
This page was built for publication: Randomizable Proofs and Delegatable Anonymous Credentials
