Pages that link to "Item:Q3408212"
From MaRDI portal
The following pages link to Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs (Q3408212):
Displaying 36 items.
- Identity-based trapdoor mercurial commitments and applications (Q719291) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- UC priced oblivious transfer with purchase statistics and dynamic pricing (Q2179394) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys (Q2827708) (← links)
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees (Q2827721) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- Vector Commitments and Their Applications (Q4916001) (← links)
- UC Updatable Databases and Applications (Q5048962) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← 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)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK (Q6132412) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Linear-map vector commitments and their practical applications (Q6175974) (← links)
- PointProofs, revisited (Q6175975) (← links)
- Concise Mercurial Subvector Commitments: Definitions and Constructions (Q6488391) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← links)
- Chainable functional commitments for unbounded-depth circuits (Q6582224) (← links)
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces (Q6604928) (← links)
- Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
- Zero-knowledge functional elementary databases (Q6604931) (← links)
- Updatable, aggregatable, succinct mercurial vector commitment from lattice (Q6635762) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
