Pages that link to "Item:Q3183560"

The following pages link to Randomizable Proofs and Delegatable Anonymous Credentials (Q3183560):

Displaying 33 items.

• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
• Constant-size structure-preserving signatures: generic constructions and simple assumptions (Q321316) (← links)
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
• Efficient traceable signatures in the standard model (Q631785) (← links)
• Transferable e-cash: a cleaner model and the first practical instantiation (Q2061973) (← links)
• Lattice-based blind signatures, revisited (Q2096538) (← links)
• Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
• Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
• Issuer-hiding attribute-based credentials (Q2149822) (← links)
• Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
• Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
• Efficient fully structure-preserving signatures and shrinking commitments (Q2318093) (← links)
• Short tightly secure signatures for signing a vector of group elements: a new approach (Q2330115) (← links)
• Efficient and secure attribute-based signature for monotone predicates (Q2406435) (← links)
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
• Recovering Lost Device-Bound Credentials (Q2794506) (← links)
• Hierarchical Identities from Group Signatures and Pseudonymous Signatures (Q2803658) (← links)
• Formal Treatment of Privacy-Enhancing Credential Systems (Q2807189) (← links)
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
• How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones (Q2953786) (← links)
• Achieving Optimal Anonymity in Transferable E-Cash with a Judge (Q3011914) (← links)
• Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
• Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
• Efficient Traceable Signatures in the Standard Model (Q3392912) (← links)
• Structure-Preserving Signatures from Standard Assumptions, Revisited (Q3457070) (← links)
• A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials (Q3460098) (← links)
• Decentralized Attribute-Based Signatures (Q4916005) (← links)
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size (Q4916017) (← links)
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures (Q4916021) (← links)
• Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES (Q4916022) (← links)
• Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes (Q5087265) (← links)
• Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)