Pages that link to "Item:Q2691602"
From MaRDI portal
The following pages link to Succinct functional commitment for a large class of arithmetic circuits (Q2691602):
Displaying 8 items.
- Vector and functional commitments from lattices (Q2697903) (← links)
- Chainable functional commitments for unbounded-depth circuits (Q6582224) (← links)
- Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Witness encryption for succinct functional commitments and applications (Q6635767) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
- Certifying private probabilistic mechanisms (Q6652993) (← links)
