Pages that link to "Item:Q3457073"

The following pages link to Round-Optimal Black-Box Two-Party Computation (Q3457073):

Displaying 14 items.

• Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
• Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
• Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
• What security can we achieve within 4 rounds? (Q2010586) (← links)
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
• On the round complexity of black-box secure MPC (Q2128561) (← links)
• On black-box extension of a non-interactive zero-knowledge proof system for secret equality (Q2152072) (← links)
• Round-optimal black-box protocol compilers (Q2170000) (← links)
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
• Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
• The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
• What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)