Pages that link to "Item:Q2304987"
From MaRDI portal
The following pages link to Revisiting post-quantum Fiat-Shamir (Q2304987):
Displayed 38 items.
- Signatures from sequential-OR proofs (Q2055653) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 (Q2055690) (← links)
- Threshold ring signatures: new definitions and post-quantum security (Q2055701) (← links)
- Classical vs quantum random oracles (Q2056754) (← links)
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work (Q2056756) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more (Q2104233) (← links)
- Improved lattice-based mix-nets for electronic voting (Q2104424) (← links)
- On tight quantum security of HMAC and NMAC in the quantum random oracle model (Q2120095) (← links)
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
- One-time traceable ring signatures (Q2148766) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- Online-extractability in the quantum random-oracle model (Q2170106) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions (Q2661695) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security (Q5041241) (← links)
- LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (Q5868888) (← links)
- Tighter security proofs for GPV-IBE in the quantum random oracle model (Q5925501) (← links)
- A lower bound on the length of signatures based on group actions and generic isogenies (Q6083676) (← links)
- A generic transform from multi-round interactive proof to NIZK (Q6088992) (← links)
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM (Q6104357) (← links)
- A note on the post-quantum security of (ring) signatures (Q6113964) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- Another round of breaking and making quantum money: how to not build it from lattices, and more (Q6138103) (← links)
- Redeeming reset indifferentiability and applications to post-quantum security (Q6157503) (← links)
- Tight adaptive reprogramming in the QROM (Q6157507) (← links)
- New constructions of collapsing hashes (Q6163967) (← links)
- Constructive post-quantum reductions (Q6163970) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Publicly-verifiable deletion via target-collapsing functions (Q6190132) (← links)
- A detailed analysis of Fiat-Shamir with aborts (Q6190142) (← links)