Pages that link to "Item:Q2947520"
From MaRDI portal
The following pages link to Generalizing Efficient Multiparty Computation (Q2947520):
Displaying 14 items.
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Preface (to the special issue on general secure multiparty computation) (Q1976001) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Realizable Rational Multiparty Cryptographic Protocols (Q2818052) (← links)
- Multiparty Computation from Somewhat Homomorphic Encryption (Q2914293) (← links)
- Collusion-Free Multiparty Computation in the Mediated Model (Q3183583) (← links)
- (Q4535073) (← links)
- Communication Locality in Secure Multi-party Computation (Q4910288) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts (Q5738790) (← links)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol (Q5756545) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5896075) (← links)
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle (Q6107739) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)