Black-box constructions of composable protocols without set-up
From MaRDI portal
Recommendations
- Black-box constructions of bounded-concurrent secure computation
- A new approach to black-box concurrent secure computation
- Bounded-concurrent secure two-party computation without setup assumptions
- Constant-round black-box construction of composable multi-party computation protocol
- Black-box constructions of protocols for secure computation
Cited in
(34)- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Unbounded ABE via bilinear entropy expansion, revisited
- A new approach to black-box concurrent secure computation
- A unified approach to constructing black-box UC protocols in trusted setup models
- Round-efficient black-box construction of composable multi-party computation
- A black-box construction of non-malleable encryption from semantically secure encryption
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
- Round-optimal black-box commit-and-prove with succinct communication
- Black-box constructions of bounded-concurrent secure computation
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Non-malleable commitments against quantum attacks
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- On black-box complexity of universally composable security in the CRS model
- Improved, black-box, non-malleable encryption from semantic security
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Adaptive hardness and composable security in the plain model from standard assumptions
- Black-box constructions for secure computation
- Black-box constructions of protocols for secure computation
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Round-optimal black-box two-party computation
- Bounded-concurrent secure two-party computation without setup assumptions
- scientific article; zbMATH DE number 1418320 (Why is no real title available?)
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Advances in Cryptology - EUROCRYPT 2004
- Concurrently composable security with shielded super-polynomial simulators
- On the exact round complexity of self-composable two-party computation
- Constant-round black-box construction of composable multi-party computation protocol
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Two-round concurrent 2PC from sub-exponential LWE
- Improved black-box constructions of composable secure computation
- Black-box timed commitments from time-lock puzzles
- Round-efficient composable two-party quantum computation
- Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH
This page was built for publication: Black-box constructions of composable protocols without set-up
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914276)
