Pages that link to "Item:Q4916001"
From MaRDI portal
The following pages link to Vector Commitments and Their Applications (Q4916001):
Displaying 50 items.
- A sub-linear lattice-based submatrix commitment scheme (Q831634) (← links)
- Vector barrier certificates and comparison systems (Q2024361) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
- New code-based cryptographic accumulator and fully dynamic group signature (Q2099154) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Decentralized policy-hiding ABE with receiver privacy (Q2167764) (← links)
- UC priced oblivious transfer with purchase statistics and dynamic pricing (Q2179394) (← links)
- Publicly verifiable database scheme with efficient keyword search (Q2201628) (← links)
- Publicly verifiable databases with efficient insertion/deletion operations (Q2396817) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- KVaC: key-value commitments for blockchains and beyond (Q2691607) (← 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)
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives (Q2790034) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees (Q2827721) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- Vector Commitments and Their Applications (Q4916001) (← links)
- UC Updatable Databases and Applications (Q5048962) (← links)
- SoK: blockchain light clients (Q6045245) (← 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)
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice (Q6080919) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← 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)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? (Q6173284) (← links)
- New unbounded verifiable data streaming for batch query with almost optimal overhead (Q6173295) (← 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)
- Proof of availability and retrieval in a modular blockchain architecture (Q6573989) (← links)
- Limits on revocable proof systems, with implications for stateless blockchains (Q6573990) (← 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)
- Efficient secure storage with version control and key rotation (Q6605322) (← links)
