Pages that link to "Item:Q3020005"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Black-Box Constructions of Protocols for Secure Computation (Q3020005):

Displaying 24 items.

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)
What security can we achieve within 4 rounds? (Q2010586) (← links)
The price of active security in cryptographic protocols (Q2119012) (← links)
On the round complexity of black-box secure MPC (Q2128561) (← 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)
Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
On the feasibility of extending oblivious transfer (Q2413614) (← links)
On Black-Box Complexity of Universally Composable Security in the CRS Model (Q2795971) (← links)
What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract) (Q2938838) (← links)
Simple, Black-Box Constructions of Adaptively Secure Protocols (Q3611778) (← links)
(Q4941882) (← links)
Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
Advances in Cryptology - EUROCRYPT 2004 (Q5307254) (← links)
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols (Q5502762) (← links)
Round-optimal secure multi-party computation (Q5918346) (← links)
Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
Black-box anonymous commit-and-prove (Q6134847) (← links)
On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model (Q6157502) (← links)
The price of active security in cryptographic protocols (Q6595846) (← links)