Pages that link to "Item:Q5311558"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2004 (Q5311558):
Displaying 50 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Unconditionally anonymous ring and mesh signatures (Q321307) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Efficient oblivious transfers with access control (Q453798) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Conditional e-payments with transferability (Q635291) (← links)
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem (Q683912) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- A note on the Chen-Morrissey-Smart DAA scheme (Q763534) (← links)
- EPID with malicious revocation (Q826251) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- Improved algebraic MACs and practical keyed-verification anonymous credentials (Q1698653) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Batch verification of short signatures (Q1928768) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Efficient redactable signature and application to anonymous credentials (Q2055711) (← links)
- A classification of computational assumptions in the algebraic group model (Q2096519) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme (Q2149820) (← links)
- Issuer-hiding attribute-based credentials (Q2149822) (← links)
- Security analysis of DGM and GM group signature schemes instantiated with XMSS-T (Q2151287) (← links)
- Skipping the \(q\) in group signatures (Q2152050) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds (Q2167723) (← links)
- Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Short pairing-free blind signatures with exponential security (Q2170071) (← links)
- Rerandomizable signatures under standard assumption (Q2179379) (← links)
- Foundations of fully dynamic group signatures (Q2210441) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Predicate encryption supporting disjunctions, polynomial equations, and inner products (Q2377068) (← links)
- Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- A provably secure short signature scheme based on discrete logarithms (Q2456500) (← links)
- Tight security for signature schemes without random oracles (Q2516531) (← links)
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system (Q2691596) (← links)
- Practical dynamic group signatures without knowledge extractors (Q2692957) (← links)
- Recovering Lost Device-Bound Credentials (Q2794506) (← links)
- Formal Treatment of Privacy-Enhancing Credential Systems (Q2807189) (← links)
- Secret Handshakes with Dynamic Expressive Matching Policy (Q2817485) (← links)
- Foundations of Fully Dynamic Group Signatures (Q2822669) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- A strong designated verifier signature scheme tightly related to the LRSW assumption (Q2868163) (← links)
- Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources (Q2889864) (← links)
- Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability (Q2946483) (← links)