Pages that link to "Item:Q5739213"
From MaRDI portal
The following pages link to Computationally Binding Quantum Commitments (Q5739213):
Displaying 35 items.
- Unconditionally secure multi-party quantum commitment scheme (Q1617190) (← links)
- Classical proofs for the quantum collapsing property of classical hash functions (Q1631333) (← links)
- An efficient quantum digital signature for classical messages (Q1994716) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Quantum-access-secure message authentication via blind-unforgeability (Q2055681) (← 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)
- \textsf{CSI-RAShi}: distributed key generation for CSIDH (Q2118548) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions (Q2661695) (← links)
- A review of quantum and hybrid quantum/classical blockchain protocols (Q2677258) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Relationships between quantum IND-CPA notions (Q2695636) (← links)
- Classical binding for quantum commitments (Q2695637) (← links)
- Collapse-Binding Quantum Commitments Without Random Oracles (Q2953776) (← links)
- Collapseability of Tree Hashes (Q5041240) (← links)
- Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
- Quantum bit commitment with cheat sensitive binding and approximate sealing (Q5246135) (← links)
- Dispelling myths on superposition attacks: formal security model and attack analyses (Q5918646) (← links)
- Cryptography from pseudorandom quantum states (Q6097262) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP (Q6157505) (← links)
- Sponge-based authenticated encryption: security against quantum attackers (Q6166985) (← links)
- Post-quantum insecurity from LWE (Q6169346) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Universal reductions: reductions relative to stateful oracles (Q6169554) (← links)
- Practical robust DKG protocols for CSIDH (Q6535118) (← links)
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states (Q6562577) (← links)
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions (Q6562579) (← links)
- VSS from distributed ZK proofs and applications (Q6595689) (← links)
- Towards compressed permutation oracles (Q6604882) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q6617635) (← links)
- Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation (Q6636121) (← links)
- Unconditionally secure commitments with quantum auxiliary inputs (Q6653002) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
