Pages that link to "Item:Q3611778"
From MaRDI portal
The following pages link to Simple, Black-Box Constructions of Adaptively Secure Protocols (Q3611778):
Displaying 12 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Round-Optimal Black-Box Two-Party Computation (Q3457073) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
