Pages that link to "Item:Q3612572"
From MaRDI portal
The following pages link to On Secure Multi-party Computation in Black-Box Groups (Q3612572):
Displaying 9 items.
- A subexponential construction of graph coloring for multiparty computation (Q490341) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Active Security in Multiparty Computation over Black-Box Groups (Q2912815) (← links)
- Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing (Q3297627) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
- (Q4409124) (← links)
- Counting Method for Multi-party Computation over Non-abelian Groups (Q5502759) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)