The following pages link to (Q4409110):
Displayed 12 items.
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- Lattice-based accumulator with constant time list update and constant time verification (Q6057222) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme (Q6088998) (← links)
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation (Q6108614) (← links)
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation (Q6108852) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Black-box anonymous commit-and-prove (Q6134847) (← links)
- Lower bounds for the number of decryption updates in registration-based encryption (Q6169371) (← links)
- Additive-homomorphic functional commitments and applications to homomorphic signatures (Q6175973) (← links)
- Efficient code-based fully dynamic group signature scheme (Q6201340) (← links)