Pages that link to "Item:Q2055679"
From MaRDI portal
The following pages link to Secure multi-party quantum computation with a dishonest majority (Q2055679):
Displaying 15 items.
- Rational protocol of quantum secure multi-party computation (Q1993846) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Oblivious transfer is in MiniQCrypt (Q2056751) (← links)
- Quantum Byzantine agreement for any number of dishonest parties (Q2107116) (← links)
- A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol (Q2111023) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- Round efficient secure multiparty quantum computation with identifiable abort (Q2120089) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform (Q2690549) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← 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)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort (Q6637565) (← links)
- Unconditionally secure commitments with quantum auxiliary inputs (Q6653002) (← links)
