Pages that link to "Item:Q6104330"
From MaRDI portal
The following pages link to Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330):
Displaying 25 items.
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Sequential half-aggregation of lattice-based signatures (Q6550626) (← 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)
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
- Updatable, aggregatable, succinct mercurial vector commitment from lattice (Q6635762) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Witness encryption for succinct functional commitments and applications (Q6635767) (← links)
- History-free sequential aggregation of hash-and-sign signatures (Q6636111) (← links)
- Foundations of adaptor signatures (Q6636503) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
- Ring signatures for deniable AKEM: Gandalf's fellowship (Q6648196) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
- Time-lock puzzles from lattices (Q6652906) (← links)
- Certifying private probabilistic mechanisms (Q6652993) (← links)
- Two-round threshold signature from algebraic one-more learning with errors (Q6653014) (← links)
- Adaptive security in SNARGs via iO and lossy functions (Q6660293) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
