Pages that link to "Item:Q5311535"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2004 (Q5311535):
Displaying 25 items.
- Concurrent non-malleable statistically hiding commitment (Q436560) (← links)
- New receipt-free voting scheme using double-trapdoor commitment (Q543836) (← links)
- Identity-based trapdoor mercurial commitments and applications (Q719291) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- Identity-based chameleon hashing and signatures without key exposure (Q903661) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- All-but-many encryption (Q1747665) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security (Q2822671) (← links)
- Identification Schemes from Key Encapsulation Mechanisms (Q3011903) (← links)
- Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs (Q3408212) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- New Constructions and Applications of Trapdoor DDH Groups (Q4916024) (← links)
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks (Q4933209) (← links)
- Automata, Languages and Programming (Q5716783) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- New unbounded verifiable data streaming for batch query with almost optimal overhead (Q6173295) (← links)
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More (Q6488375) (← links)
