Pages that link to "Item:Q2697903"
From MaRDI portal
The following pages link to Vector and functional commitments from lattices (Q2697903):
Displaying 16 items.
- 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)
- 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)
- Linear-map vector commitments and their practical applications (Q6175974) (← links)
- PointProofs, revisited (Q6175975) (← links)
- Committed private information retrieval (Q6550636) (← links)
- Chainable functional commitments for unbounded-depth circuits (Q6582224) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
- Efficient secure storage with version control and key rotation (Q6605322) (← links)
- Updatable, aggregatable, succinct mercurial vector commitment from lattice (Q6635762) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
