Pages that link to "Item:Q2931374"

The following pages link to Black-box constructions for secure computation (Q2931374):

Displaying 14 items.

• Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
• Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
• Best possible information-theoretic MPC (Q1631330) (← links)
• Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
• A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← links)
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
• Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
• On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
• Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
• Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols (Q5502762) (← links)
• Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)