Pages that link to "Item:Q2849395"
From MaRDI portal
The following pages link to Efficient Multiparty Protocols via Log-Depth Threshold Formulae (Q2849395):
Displayed 14 items.
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Random probing security: verification, composition, expansion and new constructions (Q2096491) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing (Q3297627) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- On (Valiant’s) Polynomial-Size Monotone Formula for Majority (Q5098767) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)